1423 Big Number n!的位数

最新推荐文章于 2021-02-17 21:35:59 发布

原创最新推荐文章于 2021-02-17 21:35:59 发布 · 514 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

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

acm_数学问题专栏收录该内容

163 篇文章

订阅专栏

Big Number

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 15616		Accepted: 4931

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

#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
//求n！的位数：
const double pi=acos(-1*1.0);
int main()
{
    int ci;
    scanf("%d",&ci);
    while(ci--)
    {
        int n;
        scanf("%d",&n);
        if(n==0||n==1)  {printf("1/n");continue;}
        int ans=int((n*log(n*1.0)-n+log(2*n*pi)/2)/log(10.0))+1;
        printf("%d/n",ans);
    }
    return 0;
}