HDOJ--1018--Big Number

题目描述：
In many applications very large integers numbers are required. Some of these applications are using keys for secure transmission of data, encryption, etc. In this problem you are given a number, you have to determine the number of digits in the factorial of the number.
输入描述:
Input consists of several lines of integer numbers. The first line contains an integer n, which is the number of cases to be tested, followed by n lines, one integer 1 ≤ n ≤ 10 7 on each line.
输出描述:
The output contains the number of digits in the factorial of the integers appearing in the input.
输入：
2
10
20
输出：
7
19
题意：
n!位数
题解：
斯特林公式或者log10(i)
代码：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cmath>
using namespace std;

int main(){
    int n,t;
    scanf("%d",&t);
    while(t--){
        scanf("%d",&n);
        double sum = 0;
        for(int i = 1; i <= n; i ++){
            sum += log10(i);
        }
        printf("%d\n",(int)sum + 1);
    }
    return 0;
}