Power of Cryptography(POJ-2109 && UVA-113)
来源:互联网 发布:matlab智能算法 编辑:程序博客网 时间:2024/06/05 17:54
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,求k;
思路:这个题的分类是贪心,一时间没想到怎么用贪心做,就用了pow函数试了一下,没想到过了。。。。
#include<iostream>#include<cstdio>#include<cstring>#include<cmath>using namespace std;int main(){ double n,p; while(scanf("%lf%lf",&n,&p)!=EOF) { cout<<(pow(p,1/n))<<endl; } return 0;}
阅读全文
0 0
- UVA (POJ 2109) Power of Cryptography
- Power of Cryptography(POJ-2109 && UVA-113)
- UVA 113 - Power of Cryptography(数学)
- UVA 113 - Power of Cryptography(数学)
- uva 113 Power of Cryptography(开方)
- UVa 113 Power of Cryptography
- uva 113Power of Cryptography
- uva 113 Power of Cryptography
- UVA 113 - Power of Cryptography
- uva 113 - Power of Cryptography
- UVa 113 - Power of Cryptography
- UVA 113 - Power of Cryptography
- UVa 113Power of Cryptography
- UVa 113: Power of Cryptography
- uva 113 - Power of Cryptography
- UVA 113 Power of Cryptography
- uva 113 Power of Cryptography
- UVA 113 Power of Cryptography
- CAS(9)-通过Proxy访问其它Cas应用
- hihoCoder太阁最新面经算法竞赛题解(4)
- PL/SQL Developer 导入导出数据库
- Java8之Collections.sort
- NOIP2017模拟赛(八)总结
- Power of Cryptography(POJ-2109 && UVA-113)
- PAT 乙等 1031 查验身份证
- apache与nginx的区别
- CAS(10)-spring整合
- JavaScript闭包(Closure)
- eclipse中FreeMarker插件的在线安装
- 实现多线程4种方法
- 【CodeM初赛A 6】二分图染色 题解
- ajax同步异步的区别