UVA 113 - Power of Cryptography(二分)
2012-07-14 15:06
405 查看
题目链接
被数据给吓到了,本来以为是各种高精度的综合题,又想是否是高深的数学结论题,怎么做出来的人这么多啊。。。看reader的时候同学的BOLG有,发现原来是double 就可以搞,无语。。。。连精度都不卡。。。
被数据给吓到了,本来以为是各种高精度的综合题,又想是否是高深的数学结论题,怎么做出来的人这么多啊。。。看reader的时候同学的BOLG有,发现原来是double 就可以搞,无语。。。。连精度都不卡。。。
#include <stdio.h> #include <string.h> #include <stdlib.h> #include <math.h> #define N 1000000000 int main() { int n; double p,s,str,end; while(scanf("%d%lf",&n,&p)!=EOF) { str = 1; end = N; while(str < end) { s = pow((str+end)/2,n); if(s < p) { str = (str+end)/2; } else if(s == p) { break; } else { end = (str+end)/2; } } printf("%.0lf\n",str); } return 0; }
相关文章推荐
- UVA 113-Power of Cryptography(二分+double处理大数据)
- UVA - 113 Power of Cryptography (大数幂+二分)
- POJ2109 ZOJ2486 UVA113 UVALive3098 Power of Cryptography【数学】
- UVA 113 (暑假-数学-A - 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
- uva 113 - Power of Cryptography
- UVA 113 Power of Cryptography (数学)
- UVA - 113 Power of Cryptography
- uva 113 Power of Cryptography(double活用)
- UVA 113 Power of Cryptography
- UVa 113 - Power of Cryptography
- uva 113 power of Cryptography
- UVA 113 - Power of Cryptography