POJ 2109 Power of Cryptography
来源:互联网 发布:燕十八的php讲的怎么样 编辑:程序博客网 时间:2024/06/05 22:42
Power of Cryptography
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 60000/30000K (Java/Other)
Total Submission(s) : 7 Accepted Submission(s) : 2
Problem 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).
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 163 277 4357186184021382204544
Sample Output
431234注意1:double 可以进行很大的数的计算#include<stdio.h>#include<math.h>int main (void){ double n,p; double sum; while(~scanf("%lf%lf",&n,&p)) { sum=pow(p,1/n); printf("%.lf\n",sum); } return 0;}
0 0
- 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
- 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
- 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
- 使用xib封装一个自定义view的步骤
- POJ 2013 Symmetric Order 水
- POJ-1922 Ride to School
- 数值的交换
- 第13章:状态开关按钮(ToggleButton)和开关(Switch)的功能和用法
- POJ 2109 Power of Cryptography
- 神经元模型
- POJ-2000 Gold Coins
- MVVM(Model-View-ViewModel)框架——avalon。
- Caffe学习:Forward and Backward
- latex笔记
- java注意事项
- 通讯录实战
- Android 应用程序窗体显示状态操作(requestWindowFeature()的应用