Power of Cryptography
来源:互联网 发布:淘宝引流手机软件 编辑:程序博客网 时间:2024/05/10 01:14
J - Power of Cryptography
Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64uDescription
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 n th. 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 n th. 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<10 101 and there exists an integer k, 1<=k<=10 9 such that k n = 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
是不是觉得数位不够用啊,用double就好啦2333
#include <iostream>#include <algorithm>#include <string.h>#include <string>#include <cstdio>#include <math.h>using namespace std;int main(){ double n,p;double i; while(~scanf("%lf %lf",&n,&p)) { cout<<pow(p,1.0/n)<<endl; } return 0;}
0 0
- Power of Cryptography POJ2109
- JOJ1728:Power of Cryptography
- poj21029 Power of Cryptography
- POJ2109 Power of Cryptography
- 113 - Power of Cryptography
- UVa Power of Cryptography
- 113 - Power of Cryptography
- F - Power of Cryptography
- uva Power of Cryptography
- POJ2109--Power of Cryptography
- Power of Cryptography
- 113 - Power of Cryptography
- 113 - Power of Cryptography
- 113 - Power of Cryptography
- poj2109-Power of Cryptography
- POJ2109:Power of Cryptography
- POJ2109 Power of Cryptography
- 1 Power of Cryptography
- Java_IO_Scanner类
- Linux内核强制使用自配置的cmdline
- Redis Getshell自动化实践之webshell
- 2016暑假多校合练第二场Multi-University Training Contest 2 1005 Eureka
- eclipse 常用快捷键
- Power of Cryptography
- BadgeView微信消息数字提醒
- SDUT1138数据结构上机测试2-1:单链表操作A
- Eclipse juno 中安装 JBoss Tools,集成Hibernate
- 2016夏季练习——单调栈
- css中的chaining技术是允许在相同的元素上运行多条命令,一条接着另一条。
- HttpUrlConnection访问百度,不知道为什么返回的url数据有错,loaddata不出来,之前用模拟器还没错,用真机就出不来百度了
- js禁用ctrl+滚轮,防止页面放大缩小
- 接呀呀云实时语音SDK总结