POJ 2109 Power of Cryptography
来源:互联网 发布:腾讯股票数据接口api 编辑:程序博客网 时间:2024/05/21 22:49
Power of Cryptography
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 18103 Accepted: 9136
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
#include<stdio.h>#include<math.h>#define N 1000000int main(){ double n,m; double t; int i; while(scanf("%lf%lf",&m,&n)!=EOF) { for(i=1;i<N;i++) { t = pow(i,m); if(t==n) { break; } } printf("%d\n",i); } 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
- 自我反省记录
- POJ 1961 Period(KMP)
- [Linux内存]vmalloc学习笔记
- java算法
- 黑马程序员-- 面向对象VII--
- POJ 2109 Power of Cryptography
- 【HDU2544】记第一次写Floyd
- Java中枚举类的使用总结
- RTSP服务器实例live555源代码分析
- 一个伪球迷的世界杯记忆
- flash - AVM2 指令参考
- 以太网RJ45 针脚定义
- 新人职场要淡定 情商比智商更重要
- js报TypeError $(...) is null错误,jquery失效的原因及解决办法