M

[align=left]Problem Description[/align]
Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers among these primes. Work in this area has resulted in the practical use of results from number theory and other branches
of mathematics once considered to be only of theoretical interest.

This problem involves the efficient computation of integer roots of numbers.

Given an integer n>=1 and an integer p>= 1 you have to write a program that determines the n th positive root of p. In this problem, given such integers n and p, p will always be of the form k to the nth. power,
for an integer k (this integer is what your program must find).
 

[align=left]Input[/align]
The input consists of a sequence of integer pairs n and p with each integer on a line by itself. For all such pairs 1<=n<= 200, 1<=p<10¹⁰¹ and there exists an integer k, 1<=k<=10⁹ such that kⁿ = p.

 

[align=left]Output[/align]
For each integer pair n and p the value k should be printed, i.e., the number k such that k n =p.

 

[align=left]Sample Input[/align]

2 16
3 27
7 4357186184021382204544

 

[align=left]Sample Output[/align]

4
3
1234

感觉会有精度问题和超时问题。。。但是本人懒偷巧用了math.h里的pow函数。。
代码：

#include<iostream>

#include<math.h>

using namespace std;

int main()

{

  double n;

    while (cin>>n)

    {
double s;

    cin>>s;

   cout<<pow(s, 1/n)<<endl;

    }

    return 0;

}