poj-2109 Power of Cryptography
来源:互联网 发布:西安软件新城招聘信息 编辑:程序博客网 时间:2024/06/08 05:00
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 <string.h>#include <stdlib.h>#include <math.h>#include <algorithm>using namespace std;double e=1e-6;int main(){ double n,p; while (~scanf("%lf%lf",&n,&p)) { printf("%.0lf\n",pow(p+e,1/n)); } 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
- @Resource和@Autowired对比
- Android快速开发框架:ThinkAndroid(附下载地址)
- Spring MVC详解(七) 注解式控制器的数据验证、类型转换及格式化(2)
- Intrepid climber (dfs+树)
- Android应用开发之使用Socket进行大文件断点上传续传
- poj-2109 Power of Cryptography
- C++对象模型——对象的差异(第一章)
- linux mkdir http://www.linuxidc.com/Linux/2011-04/35180.htm
- 杂谈异常处理try-catch-finally
- 写给新手程序员的一封信(转载)
- 浅谈 C# 语言的 using 语句
- iOS8系统下的无法弹出通知
- hdu5317(2015多校3)--RGCDQ(素数筛+枚举)
- C# 语言中 struct 的陷阱