sir one of my test case is getting wrong and i tried most of the test cases as far as i know and all of them are correct…can you please help me…?
Kth root problem
The approach you are using is wrong,You need to apply binary search in this problem. For every possible mid obtained by using binary search you will check of it is the best suitable candidate or not for becoming the Kth root and then reduce the search space of the binary search according to the mid value. If mid^k is greater than N then you will find the best suitable value from left to mid-1 otherwise you will find much larger value by finding it from mid+1 to right.
pleas look into my code and tell me the problem