Big number

最新推荐文章于 2020-07-24 11:37:03 发布

原创最新推荐文章于 2020-07-24 11:37:03 发布 · 404 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#integer #encryption #output #numbers #input #each

C语言专栏收录该内容

6 篇文章

订阅专栏

题目;

Problem 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 ≤ n ≤ 10⁷ 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

代码:

#include<stdio.h>
#include<math.h>
#define e 2.718281828
#define pi 3.141592653
main()
{
   long n;double m,re;
   while(scanf("%ld",&n)==1)
    {
     while(n--)
      {
         scanf("%lf",&m);
          re=m*(log10(m)-log10(e))+0.5*log10(2*pi*m);
          printf("%d/n",(int)re+1);
      }
    }
}