zoj 2277 The Gate to Freedom
2013-08-16 18:52
239 查看
N^N = X
---> Nlog10(N) = log10( X )
----> X的最高位为 Nlog10(N) 小数部分的第一个非0位
---> Nlog10(N) = log10( X )
----> X的最高位为 Nlog10(N) 小数部分的第一个非0位
#include<stdio.h> #include<math.h> int main(void) { double n; while(scanf("%lf",&n) != EOF) { n = n*log10(n); n = n - (long long int)n; n = pow(10,n); while((int)n == 0) n *= 10; printf("%d\n",(int)n); } return 0; }
相关文章推荐
- zoj 2277 The Gate to Freedom
- zoj 2277 The Gate to Freedom
- ZOJ 2277 The Gate to Freedom(n^n)
- ZOJ 2277 The Gate to Freedom
- zoj2277 The Gate to Freedom
- 【ZOJ2277】The Gate to Freedom
- POJ 1050/ ZOJ 1074:To the Max - DP求子矩阵和
- ZOJ&nbsp;1074&nbsp;To&nbsp;the&nbsp;Max
- DP--ZOJ - 1074 To the Max
- ZOJ_3949 Edge to the Root
- zoj 1074 To the Max 最大子矩阵之和
- ZOJ1053-FDNY to the Rescue!(图论之最短路)
- zoj 1053 && poj 1122 FDNY to the Rescue!
- poj1122&&zoj1053 FDNY to the Rescue! ——最短路入门题_Dijkstra算法
- [jumping to the gate] 娱乐向setjmp
- ZOJ 1074 To the Max (DP)
- ZOJ3582 Back to the Past
- zoj 1074 || poj 1050 To the Max(简单DP)
- TOJ 2010 ZOJ 1074 HDU1081 To The Max /最大子矩阵和
- HDOJ 1081(ZOJ 1074) To The Max(动态规划)