What is a efficient algorithm to calculate nth root of some number??

I’m doing using `pow(n,(1.0/(double)j);`

but it gives precision error, is there any other efficient way to calculate this?

What is a efficient algorithm to calculate nth root of some number??

I’m doing using `pow(n,(1.0/(double)j);`

but it gives precision error, is there any other efficient way to calculate this?

You are not supposed to ask this question during the ongoing contest…You better wait for the contest to end.