Power of Cryptography POJ2109

Power of Cryptography
Time Limit: 1000MS
 
Memory Limit: 30000K
Total Submissions: 11348
 
Accepted: 5847
Description
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 n
th. power, for an integer k (this integer is what your program must find).
Input
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
101 and there exists an integer k, 1<=k<=10
9 such that k
n = p.
Output
For each integer pair n and p the value k should be printed, i.e., the number k such that k n =p.
Sample Input

2 16
3 27
7 4357186184021382204544

Sample Output

4
3
1234

Source
México and Central America 2004
관건: 유형 표시 범위
정형 int-2*10^9~2*10^9
단정밀도형float-3.4*10^38~3.4*10^38
이중 정밀도형 더블-1.7*10^308~1.7*10^308
코드는 다음과 같습니다.

#include <iostream>
#include <math.h>
using namespace std;

int main()
{
	int n;
	double p;
	while(cin>>n)
	{
		cin>>p;
		cout<<pow(p,1.0/n)<<endl;
	}
	return 0;
}