| Power of Cryptography |
Background
Current work in cryptography involves (among other things) large prime numbers and computing powers of numbers modulo functions of 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 of only theoretical interest.
This problem involves the efficient computation of integer roots of numbers.
The Problem
Given an integer 
and an integer 
you are to write a program that determines 
, the positive 
root of p. In this problem, given such integers n and p, p will always be of the form 
for an integer k (this integer is what your program must find).
The 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 
, 
and there exists an integer k, 
such that 
.
The Output
For each integer pair n and p the value should be printed, i.e., the number k such that .
Sample Input
2 16 3 27 7 4357186184021382204544
Sample Output
4 3 1234
这道题目里面 p, n 没有超过 double 范围，所以。。。。水题，典型的纸老虎。
拙劣的代码
1 #include <iostream> 2 #include <cstdlib> 3 #include <cstdio> 4 #include <cmath> 5 6 using namespace std; 7 8 int main(void) 9 { 10 double n , p; 11 int k; 12 13 #ifndef ONLINE_JUDGE 14 freopen("in", "r", stdin); 15 #endif 16 17 while (cin >> n >> p) 18 { 19 k = floor(pow(p, 1 / n) + 0.5); 20 cout << k << endl; 21 } 22 23 return 0; 24 }