poj2109 Power of Cryptography(数学题)
2014-07-10 15:47
274 查看
题目链接:http://poj.org/problem?id=2109
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.
Sample Input
Sample Output
代码如下:
----------------------------------------------------------------------------------------------------------------------------------------------------------
欢迎光临天资小屋 :http://user.qzone.qq.com/593830943/main
----------------------------------------------------------------------------------------------------------------------------------------------------------
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.
Sample Input
2 16 3 27 7 4357186184021382204544
Sample Output
4 3 1234
代码如下:
#include <iostream> #include <cmath> using namespace std; int main() { double n, p, k; while(cin >> n >> p) { k = pow(p,1/n); cout<<k<<endl; } return 0; }
相关文章推荐
- poj2109 Power of Cryptography
- POJ2109 Power of Cryptography (高精度+二分) (可以double水過去)
- Power of Cryptography 数学题 注意double能表示的最大范围
- UVA 113 Power of Cryptography (数学)
- 数学类-113 - Power of Cryptography
- 数学1A - Power of Cryptography
- poj2109 Power of Cryptography(水题。。。)
- POJ2109 ZOJ2486 UVA113 UVALive3098 Power of Cryptography【数学】
- POJ2109——Power of Cryptography
- POJ2109 Power of Cryptography(easy!)
- POJ2109《Power of Cryptography》方法:pow(p, 1/n)
- POJ2109 Power of Cryptography
- POJ2109:Power of Cryptography
- POJ2109,Power of Cryptography,神题,火钳刘明
- 貪心::poj1328 radar installation && poj2109 Power of Cryptography && poj2586 Y2K Accounting Bug
- poj2109 Power of Cryptography
- UVA 113-Power of Cryptography 数学水题
- poj2109 Power of Cryptography
- UVA 113 - Power of Cryptography(数学)
- POJ2109--Power of Cryptography