Kth Root Question in Mathematics section of HackerBlocks

#1

I solved it using norrmal method of pow(n,1/k)…but it was showing wrong in case 3 …i checked the test case input and output but they were same…and in the editrial it used binary search for doing it…how is binary search more efficient then normal method ??

#2


This code works fine.Normal (a*b)%c will give tle for large value of a,b,c.