Power of Cryptography POJ - 2109
来源:互联网 发布:tomcat修改端口号 编辑:程序博客网 时间:2024/06/05 11:37
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).
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 k n = p.
For each integer pair n and p the value k should be printed, i.e., the number k such that k n =p.
2 163 277 4357186184021382204544
431234
#include <iostream>#include <cstdio>#include <cmath>int main(){ double a,b,ans; int maxx,minx,mid;//底数不超过int while(~scanf("%lf %lf",&a,&b)) { minx=1;maxx=pow(10,9); while(minx<=maxx) { mid=(maxx+minx)/2; ans=pow(mid,a); if(ans==b) { printf("%d\n",mid); break; } else { if(ans<b) minx=mid; else maxx=mid; } } } 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
- Android Studio配置SVN
- redis window密码配置文件启动
- QCamera使用QGraphicsVideoItem输出图像
- 出现次数最多的整数
- Day 12 绝对路径相对路径
- Power of Cryptography POJ - 2109
- python技巧(12)
- Lua学习笔记——基础篇
- HashMap在非线程安全下的死循环
- Lua学习笔记——进阶
- Hdu-5921 Binary Indexed Tree(数位DP)
- Lua学习笔记——C语言与Lua的交互
- 这是开始
- ToolBar报错:AppCompat does not support the current theme features