UVa 10916 - Factstone Benchmark
2012-07-28 09:56
369 查看
m! <= 2^n ,求最大的m;
两边同时取对数。
两边同时取对数。
#include<iostream> #include<cmath> using namespace std; int f[21]; int main() { int n, i, j, k; double sum=0; for (i=0, j=0, k=4; i<21; i++, k*=2) { for (j++; ; j++) { sum+=log10((double)j); if (sum >= k*log10(2.)) { f[i]=j-1; break; } } } while(cin >> n, n) cout << f[(n-1960)/10] << endl; return 0; }
相关文章推荐
- UVA 10916 Factstone Benchmark
- UVA 10916 Factstone Benchmark
- UVa 10916 Factstone Benchmark
- uva 10916 - Factstone Benchmark
- uva 10916 Factstone Benchmark
- UVA - 10916 Factstone Benchmark
- UVA - 10916 Factstone Benchmark(数学)
- Uva 10916 Factstone Benchmark
- Uva 10916 - Factstone Benchmark
- UVA 10916 Factstone Benchmark
- uva 10916 Factstone Benchmark(打表)
- UVA 10916 - Factstone Benchmark
- UVa 10916 - Factstone Benchmark
- uva 10916 Factstone Benchmark(对数函数的活用)
- UVA - 10916 Factstone Benchmark
- UVA-10916 Factstone Benchmark
- UVa 10916 - Factstone Benchmark
- UVa 10916 - Factstone Benchmark
- UVa 10916 - Factstone Benchmark
- uva 10916 Factstone Benchmark