hdu 1018 Big Number (数学题)

Problem Description

Inmany applications very large integers numbers are required. Some of theseapplications are using keys for secure transmission of data, encryption, etc.In this problem you are given a number, you have to determine the number ofdigits in the factorial of the number.

 

Input

Inputconsists of several lines of integer numbers. The first line contains aninteger n, which is the number of cases to be tested, followed by n lines, oneinteger 1 ≤ n ≤ 107 on each line.

 

Output

Theoutput contains the number of digits in the factorial of the integers appearingin the input.

 

SampleInput

2

10

20

 

Sample Output

7

19

/**************************************************

 //  不能直接算N!,数据规模  1<N<10^7  太大,超出  2^31  的范围,所以取对数函数
//  N = M*10^n   n = log10(N)  log10()  函数在头文件cmath中

984 MS,差点超时


 ************************************************/


#include <iostream>
#include<cmath>
using namespace std;
int main()
{
    double sum;
    int T,n;
    cin>>T;
    while(T--)
    {
        cin>>n;
        sum = 1;
        for(int i = 1;i<=n;i++)
            sum+=log10(i);
        cout<<(int)sum<<endl;
    }
    return 0;
}


posted on 2014-04-04 20:59  CY_ 阅读( ...) 评论( ...) 编辑 收藏

转载于:https://www.cnblogs.com/gray1566/p/3704319.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值