The new(1)

[珠浩 杨]

我们这次任务试着去做一道acm的题，题目如下：
Big Number
Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 15022 Accepted: 4714

Description
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
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 <= m <= 10^7 on each line.

Output
The output contains the number of digits in the factorial of the
integers appearing in the input.

Sample Input

2
10
20

Sample Output

7
19

PS：这道题是做大数的运算，也是排序中的一种，大家把这题归到排序的文件夹中。
因为是第一次做题，所以时间就长一点，到下周日前。收到就回复。

杨珠浩
2011年11月28日

[Andrew Chui]

收到了！！！

[Qzi]

收到了

2011/11/28 Andrew Chui <colorfu...@gmail.com>

--
Your biological and technological distinctiveness will be added to our own. Resistance is futile.

[杨珠浩]

上传的这个Doc文件里面有大数的程序，是用VS2008编译过的，用g++我也编译过了，希望大家有空可以去看下。那么接下来我会发布下一个有关排序的acm题。

> *Your biological and technological distinctiveness will be added to our
> own. Resistance is futile.*
>