codertcm的博客

输入N求N的阶乘的10进制表示的长度。例如6! = 720，长度为3。 Input 第1行：一个数T，表示后面用作输入测试的数的数量。（1 <= T <= 1000) 第2 - T + 1行：每行1个数N。（1 <= N <= 10^9) Output 共T行，输出对应的阶乘的长度。 Sample Input 3 4 5 6 Sample Output ...

As we all know the Train Problem I, the boss of the Ignatius Train Station want to know if all the trains come in strict-increasing order, how many orders that all the trains can get out of the railwa...