poj 2109 Power of Cryptography
来源:互联网 发布:武汉淘宝摄影 编辑:程序博客网 时间:2024/05/29 17:04
Power of Cryptography
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 23142 Accepted: 11683
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
这一题有一个bug
代码如下
代码菜鸟,如有错误,请多包涵!!!#include<cstdio>#include<iostream>#include<cmath>using namespace std;int main(){ double n,p; while(cin>>n>>p) { cout<<pow(p,1.0/n)<<endl; } 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
- Java IO(十):Buffered 和 Data
- 数据结构实验之栈六:下一较大值(二)
- Ansi、Unicode与通用类型
- Tomcat启动超时报错对应方法
- linux下安装软件包的方法
- poj 2109 Power of Cryptography
- Java IO(十一):序列化与 ObjectInputStream、ObjectOutputStream
- 集训训练赛day2
- mysql-5.6.32-win32免安装版的配置详解
- Java IO(十二):Reader 和 Writer
- Simpsons’ Hidden Talents
- JS:代码执行顺序问题
- Thread_Lock(线程锁)
- 字符串常用函数