What test case am i missing

#1

What test case am i missing

#2

we will aplly binary search in this problem. For every possible mid obtained by using binary search we will check of it is the best suitable candidate or not for becoming the Kth root and then we reduce the search space of the binary search according to the mid value. If mid^k is greater than N then we will find the best suitable value from left to mid-1 otherwise we will find much larger value by finding it from mid+1 to right.
add the case when k=1 print n
for eg for input
1
1000000000000 100
ans should be 1 not 6

#3

whats wrong in my code

#4

told you above
for k==1 case you need to add that
your code fails for

debug and see

also your code will fail for larger test cases ,so u need to employ binary search