poj 2109 : Power of Cryptography
2011-08-02 17:23
393 查看
求一个k,使得k的n次方等于p。
#include<iostream> #include<math.h> using namespace std; int main() { double n,p; while(scanf("%lf%lf",&n,&p)!=EOF) printf("%.0lf\n",pow(p,1.0/n)); return 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
- POJ2109 ZOJ2486 UVA113 UVALive3098 Power of Cryptography【数学】
- Poj 2109 / OpenJudge 2109 Power of Cryptography
- poj 2109 Power of Cryptography
- poj 2109 Power of Cryptography(数学)
- poj 2109 Power of Cryptography
- poj 2109 Power of Cryptography
- Power of Cryptography(POJ-2109 && UVA-113)
- POJ 2109 Power of Cryptography 数论