What is the logic behind solving this problem
Kth Root problem
@Alfred
we have to find the largest value of the result such that x^k<=n
then think this way:
x<=n^(1/k) and this you can simply do by using pow function in this:
Here for your reference i am attaching the code:
if you have any doubt you can ask here:
Happy Learning!!
I use pow function but itgives one test case wrong
I have a question why long double gives correct answer and double doesn’t while k has a max value of 10000
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.