POJ 2109 Power of Cryptography
来源:互联网 发布:ipad客户端办公软件 编辑:程序博客网 时间:2024/06/16 09:59
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
给出n和p,求k使得k^n=p
#include <iostream>#include <math.h>using namespace std;int main(){ double n,p; while(cin>>n>>p) cout<<pow(p,1.0/n)<<endl; return 0;}
#include <iostream>#include <math.h>using namespace std;int main(){ double n,p; while(cin>>n>>p) { int st=1,en=1000000000,mid; while(st<=en) { mid=(st+en)/2; double temp=pow(mid,n); if(p==temp) { cout<<mid<<endl; break; } if(temp>p) en=mid-1; else st=mid+1; } } 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的反射机制
- 使用Eclipse构建Maven项目 (step-by-step)
- IOS关于block回调的用法
- Git报错insufficient permission for adding an object to repository database .git/objects
- 新浪微博开发二(底部菜单栏的实现)
- POJ 2109 Power of Cryptography
- 美国麻省理工教授亲授科研学习方法(上)
- linux下重启oracle
- 带进度边框的自定义TextView
- C#获取CPU个数
- C语言: 指针强制类型转换
- Swift基础语法: 22 - Swift的函数类型, 嵌套函数
- svn提交异常"svn: 丢失了预定增加的"
- 计算机科学知识和技能评估