poj 2109 Power of Cryptography
来源:互联网 发布:卸载sql server 2008 编辑:程序博客网 时间:2024/05/19 17:48
Power of Cryptography
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20250 Accepted: 10214
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
Source
México and Central America 2004
[Submit] [Go Back] [Status] [Discuss]
题意就是求k^n=q中的k
换底公式可以乱搞之。。。。
尼玛。。。。
可以挑战高精度+二分呦
double 型的数据最长可以达到10^(-307) ~ 10^308 还是远大于题目要求的。。。
醉了
结果代码就变成了。。。几行。。。
#include <iostream>#include <math.h>using namespace std;int main(){double a,b;while(cin>>a>>b){cout<<pow(b,1/a)<<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
- 缅甸皇家国际报道:传奇赌王何鸿燊:在位最长的赌王的人生揭秘搏www.hj316.com
- 2013年10月,网易游戏,游戏研发工程师----
- MFC Dialog子窗口大小随父窗口而能改变,控件随窗口大小而改变
- 随笔_2015_05_25
- 陈怡暖:多国休市黄金清淡交投于1200附近,短线震荡可能性仍大
- poj 2109 Power of Cryptography
- 第11周项目1教师兼干部类
- 读书笔记: More Effective ++ 操作符 条款6,区别increment/decrement操作符的前置(prefix)和后置(postfix)的形式
- 蓝桥杯决赛真题——数量周期
- 初试LocalDB二
- Linux系统编程——特殊进程之守护进程
- Python中super的用法
- 2.2.6 RotateList.h
- memcached分布式缓存和hibernate结合