Number lengths

FJNU.1180

Description
N! (N factorial) can be quite irritating and difficult to compute for large values of N. So instead of calculating N!, I want to know how many digits are in it. (Remember that N! = N * (N - 1) * (N - 2) * ... * 2 * 1)

Input
Each line of the input will have a single integer N on it 0 < N < 1000000 (1 million). Input is terminated by end of file.

Output
For each value of N, print out how many digits are in N!.

Sample Input
1
3
32000
1000000

Sample Output
1
1
130271
5565709

My Program

#include < iostream >
#include < cmath >
using   namespace  std;

int  main()
... {
    long n,k;
    double i,x;
    while(cin>>n)
    ...{
        x=0;
        for(i=1;i<=n;i++)
            x+=log(i)/log(10.0);
        k=(int)x+1;
        cout<<k<<endl;
    }
    return 0;
}

YOYO's Note: 
阶乘的位数就等于lgN!+1，即对1~N取对数的和+1即可。
因为没有注意log是double类型，浪费了次CE……