HDU-1018

Posted

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了HDU-1018相关的知识,希望对你有一定的参考价值。

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 ≤ 107 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


 

数n的位数计算公式:lg(n)+1 

所以 n!的位数为 lg(n*(n-1)*(n-2)...*3*2*1)+1

        =lg(n)+lg(n-1)+lg(n-2)+...+lg(3)+lg(2)+lg(1)+1

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

int main(void)
{
    double w;
    int t;
    long num;
    
    while(cin >> t)
    {
        while(t--)
        {
            cin >> num;
            
            w = 1;
            for(int i = 1; i <= num; i++)
            {
                w += log10(i);
            }
            cout << (int)w << endl;
        }
    }
    return 0;
}

 

以上是关于HDU-1018的主要内容,如果未能解决你的问题,请参考以下文章

hdu1018--斯特灵公式

hdu1018(求n!的位数)

HDU-1018

hdu 1018

HDU 1018 Big Number 数学题

hdu 1018 共同交流~