HDOJ-1018 Big Number

http://acm.hdu.edu.cn/showproblem.php?pid=1018

Test instructions: Gives a number n, the number of bits of the factorial of the output n

Khan Σ (° °| | |) ︴
At first, we were prepared to multiply the multiplication of large numbers, but the factorial result of 10000 was nearly 40,000.
The factorial of 10^7 ...

Positive: For a number n the number of bits can be calculated with LOG10 (n) + 1
So for n! The number of digits = log10 (1*2*...* (N-1) *n) +1 = log10 (1) +log10 (2) +: +LOG10 (N-1) +log10 (N) + 1
"Simple Rude

# include <stdio.h># include <math.h>int main () {int T, num;scanf ("%d", &t), while (t--) {scanf ("%d", & num);d ouble len = 0;for (int i = 1; I <= num; i++) {len + = log10 ((double) i);} printf ("%d\n", (int) len + 1);} return 0;}

　　

HDOJ-1018 Big Number