this is my knowledge

my name is jiang he

Big Number

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
weishu
qu log 
ac
#include<iostream>
#include<cstring>
#include<cmath>
using namespace std;
int main()
{
   double t;
   double sum;
   int n;
   cin>>n;
   int x;
   int i,j;
   int sum1;
   while(n--)
   {
       sum=0;
       cin>>x;
       for(i=x;i>=1;i--)
        {
            sum=sum+log10(i);
        }
        sum1=int(sum)+1;
        cout<<sum1<<endl;
   }
   return 0;
}


阅读更多
版权声明:本文为博主原创文章,未经博主允许不得转载。 https://blog.csdn.net/zx8225885qw/article/details/51542140
个人分类: 数学 函数
上一篇a+b problem 2
下一篇Hat's Fibonacci
想对作者说点什么? 我来说一句

没有更多推荐了,返回首页

关闭
关闭