码迷,mamicode.com
首页 > 其他好文 > 详细

HDU-1018(简单数学)

时间:2015-08-13 22:01:50      阅读:103      评论:0      收藏:0      [点我收藏+]

标签:

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
 
 
分析:求n!的位数。注意到n的位数等于(int)lg(n)+1。
 
 1 #include<cstdio>
 2 #include<iostream>
 3 #include<cstring>
 4 #include<cmath>
 5 using namespace std;
 6 int main()
 7 {
 8     int n;
 9     cin>>n;
10     while(n--)
11     {
12         int x;
13         double answer=0;
14         cin>>x;
15         while(x!=1)
16         {
17             answer+=log10((double)x);
18             x--;
19         }
20         cout<<(int) answer+1<<endl;
21     }
22     return 0;
23 }

 

HDU-1018(简单数学)

标签:

原文地址:http://www.cnblogs.com/RRirring/p/4728494.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!