UVA (POJ 2109) Power of Cryptography
来源:互联网 发布:网络零售的优势和缺点 编辑:程序博客网 时间:2024/05/16 17:35
Power of Cryptography
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 18102 Accepted: 9135
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
0 0
- UVA (POJ 2109) Power of Cryptography
- Power of Cryptography(POJ-2109 && UVA-113)
- 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
- SIFT算法:Matlab程序代码测试例子的说明(Lowe的代码)
- poj3253
- 影响网站加载速度之外部资源文件分析
- Question 5
- Timesten cache group aging 功能的实现
- UVA (POJ 2109) Power of Cryptography
- opensips创建数据库时报database engine not specified错误的解决
- Hi, Eclipse
- JDBC驱动程序
- POJ1423
- 数字游戏(java)
- GnuGk服务器的安装
- MTK Android 之MT6577驱动笔记
- 多项式分布的理解概率公式的理解