【第22期】观点:IT 行业加班,到底有没有价值?

hdu-1018-Big Number-简单数学

原创 2016年05月30日 19:18:16

Link: http://acm.hdu.edu.cn/showproblem.php?pid=1018

Big Number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 34113    Accepted Submission(s): 16119

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

Source

Asia 2002, Dhaka (Bengal)

Recommend

JGShining   |   We have carefully selected several similar problems for you:  1013 1017 1016 1002 1071 

解释

其实我们很容易想到 lg(n!)+1 即为所求结果

Code

#include <iostream>
#include <cmath>
#include <cstdio>
using namespace std;
int n;
int main()
{
    int ans;
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&n);
        long double res=log10(1);
        for(int i=2;i<=n;i++)
            res+=log10(i);
        ans=floor(res)+1;
        cout<<ans<<endl;
    }
    return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

HDU 1018 Big Number

Problem Description <div class="p

hdu 1018 Big Number 数学

难度:2 很好玩 题意:求n!阶乘的数的位数。 方法一:log10(n!)=log10(1)+log10(2)+…..+log10(n);

欢迎关注CSDN程序人生公众号

关注程序员生活,汇聚开发轶事。

HDU 1018 Big Number(求n!的位数)

题目链接:<a href="http://acm.hdu.edu.cn/showproblem.php?pid=1018" target="_blank" style="color: rgb(202,0,0); text-decoration: none; font-family: Arial; font-size: 14px; line-height: 26px;

HDU 1018 Big Number 数学题解

Problem Description In many applications very large integers numbers are required. Some of these ...

HDU1018 Big Number

题目地址:http://acm.hdu.edu.cn/showproblem.php?pid=1018&lt;?xml:namespace pr
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)