poj 2109 Power of Cryptography
2012-06-29 07:43
417 查看
这个题用double就能过;
View Code
View Code
#include<iostream> #include<cstdio> #include<cstdlib> #include<algorithm> #include<cmath> #include<queue> #include<set> #include<map> #include<vector> using namespace std; int main( ) { double k,p; while( scanf( "%lf %lf",&k,&p )==2 ) { printf( "%.0f\n",pow( p,1.0/k ) ); } //system( "pause" ); return 0; }
相关文章推荐
- POJ-2109-Power of Cryptography-2013-12-08 22:28:27
- poj2109——Power of Cryptography
- POJ 2109:Power of Cryptography:巨水无比
- POJ 2109-Power of Cryptography(double乘方)
- Power of Cryptography(POJ 2109)(二分)
- Power of Cryptography(POJ 2109 math )
- poj 2109 Power of Cryptography
- POJ2109——贪心——Power of Cryptography
- poj 2109 Power of Cryptography (double 精度)
- POJ 2109 Power of Cryptography【高精度+二分 Or double水过~~】
- poj 2109 Power of Cryptography(暴力枚举)
- POJ 2109 Power of Cryptography(我的水题之路——k^n=p)
- poj 2109 Power of Cryptography
- POJ--2109 Power of Cryptography
- POJ 2109 Power of Cryptography
- POJ2109——Power of Cryptography
- POJ 2109 Power of Cryptography
- POJ 2109 Power of Cryptography【高精度+二分 Or double水过~~】
- poj 2109 -- Power of Cryptography
- POJ 2109 Power of Cryptography 大数,二分,泰勒定理 难度:2