113 - Power of Cryptography
2013-05-26 00:53
169 查看
题目原文:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=49
输入两个数n,p,计算k=
View Code
输入两个数n,p,计算k=
#include<stdio.h> #include<math.h> int main() { double n,p; while(scanf("%lf%lf",&n,&p)!=EOF) { printf("%d\n",(int)(pow(p,1.0/n)+0.5)); } return 0; }
View Code
相关文章推荐
- uva 113 - Power of Cryptography
- UVA 113 - Power of Cryptography
- UVA - 113 Power of Cryptography
- UVa-113-Power of Cryptography
- 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 113 - Power of Cryptography(二分)
- UVA 113 Power of Cryptography
- UVA-113 Power of Cryptography
- UVa 113: Power of Cryptography
- 113 - Power of Cryptography
- UVA 113 Power of Cryptography 解题报告
- UVa 113 - Power of Cryptography
- UVa 113|Power of Cryptography|牛顿迭代法|pow函数的应用
- Power of Cryptography(POJ-2109 && UVA-113)
- UVA 113 - Power of Cryptography
- UVa OJ 113-Power of Cryptography