POJ2109

POJ2109

题目

Power of Cryptography
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 30684 Accepted: 15252
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 nth. 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<10101 and there exists an integer k, 1<=k<=109 such that kn = 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.

题意

给一个n和一个大数p，要求出p的n次方根k，k为整数。

分析

p的n次方根就是求p的1/n次方，本题中的p最大为10的101次方，而double占8个字节，数值范围为-1.79E308 到1.79E308，精度为15~16位。由于题目限定k为整数，所以15位有效数字已经够用，足够保证最终答案的正确性。

代码

#include <iostream>
#include <algorithm>
#include <cmath>
#include <cstdio> 

using namespace std;

int main()
{
	double n, p;
	while (scanf("%lf%lf", &n, &p) != EOF)
	{
		cout << pow(p,1.0/n) << endl;
	}
	return 0;
}