You are given two integers n and k. Find the greatest integer x, such that, x^k <= n.
Input Format
First line contains number of test cases, T. Next T lines contains integers, n and k.
solution link: https://ide.codingblocks.com/s/269369
only one test case is passing
added comments
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.
hey, can you tell the reason for doing that d=mid+1 thing in the code.