POJ 2109 Power of Cryptography
来源:互联网 发布:常见软件生命周期模型 编辑:程序博客网 时间:2024/05/22 04:47
Power of Cryptography
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 17948 Accepted: 9055
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
毛大数处理和贪心啊 一个double解决好吧
#include <iostream>#include <stdio.h>#include <string.h>#include <math.h>using namespace std;int main(){ int n; double p; while(scanf("%d%lf",&n,&p)!=EOF) { printf("%d\n",(int)(pow(p,1.0/n)+0.5)); } 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
- 微软面试100题之第7题
- AJAX框架介绍
- 运算符优先级
- 找出MXN数组中所有不相邻元素,并求出它们的和(相邻的数:前一个数是偶数,后一个数是素数)
- 一个求两个数最大公约数的算法
- POJ 2109 Power of Cryptography
- Spring security学习笔记四
- Android新浪微博客户端(一)——主框架搭建
- 21天战拖记——Day11:番茄工作法(2014-05-14)
- 嵌入式Linux内核I2C子系统详解
- testing....
- 自制蓝桥杯题库单机评测系统
- oracle 内存管理
- iOS之Object-c编程基础之NSNumber