POJ-2109-Power of Cryptography-2013-12-08 22:28:27
2014-01-11 22:14
357 查看
Power of Cryptography
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
Source
México and Central America 2004
# include<stdio.h>
# include<math.h>
int main()
{
double n,m;
while(scanf("%lf%lf",&n,&m)==2)
printf("%.0lf\n",pow(m,1/n));
return 0;
}
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 17166 | Accepted: 8673 |
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
Source
México and Central America 2004
# include<stdio.h>
# include<math.h>
int main()
{
double n,m;
while(scanf("%lf%lf",&n,&m)==2)
printf("%.0lf\n",pow(m,1/n));
return 0;
}
相关文章推荐
- poj 2109 Power of Cryptography (double 精度)
- POJ 2109 Power of Cryptography
- POJ 2109 Power of Cryptography【高精度+二分 Or double水过~~】
- POJ-2109-Power of Cryptography
- POJ 2109 Power of Cryptography
- POJ2109——Power of Cryptography
- POJ 2109 Power of Cryptography【高精度+二分 Or double水过~~】
- POJ 2109 Power of Cryptography
- poj 2109 -- Power of Cryptography
- POJ--2109 Power of Cryptography
- POJ 2109 -Power of Cryptography
- poj 2109 Power of Cryptography
- POJ 2109 Power of Cryptography 大数,二分,泰勒定理 难度:2
- POJ 2109 Power of Cryptography【高精度+二分 Or double水过~~】
- POJ 2109 Power of Cryptography
- POJ:2109-Power of Cryptography(关于double的误差)
- POJ 2109 :Power of Cryptography
- POJ 2109 Power of Cryptography
- poj 2109 Power of Cryptography
- Power of Cryptography - poj 2109