Can U explain the problem?
Kth root Problem
In this question u need to find largest value of x which satisfies this condition x^k <=n
where k and n are given constant.
ex -> if k=3 and n=9
then 1^3 <=9 (so 1 is possible)
2^3 <=9 ( 2 is also possible)
so our answer will be 2. ( 2 is largest x which satisfies x^k <=n condition)
Since constraints are large, you have to use binary search here.
You can refer this https://ide.codingblocks.com/s/305342
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.