首页 > 代码库 > HDU 1018 Big Number

HDU 1018 Big Number

2024-07-11 14:58:15   231人阅读

Big Number

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


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！结果的位数，由于数据范围是 1 ~ 10000000，常规方案肯定不行，采用数组进行大数乘法的话，数组将会存不下，因为10000000！实在太大。那么该怎么办呢？
在这之前，我们必须要知道一个知识，任意一个正整数a的位数等于(int)log10(a) + 1；为什么呢？下面给大家推导一下：  对于任意一个给定的正整数a，  假设10^(x-1)<=a<10^x，那么显然a的位数为x位，  又因为  log10(10^(x-1))<=log10(a)<(log10(10^x))  即x-1<=log10(a)<x  则(int)log10(a)=x-1,  即(int)log10(a)+1=x  即a的位数是(int)log10(a)+1我们知道了一个正整数a的位数等于(int)log10(a) + 1，现在来求n的阶乘的位数：假设A=n!=1*2*3*......*n，那么我们要求的就是(int)log10(A)+1，而：	log10(A)        =log10(1*2*3*......n)  （根据log10(a*b) = log10(a) + log10(b)有）         =log10(1)+log10(2)+log10(3)+......+log10(n)现在我们终于找到方法，问题解决了，我们将求n的阶乘的位数分解成了求n个数对10取对数的和，并且对于其中任意一个数，都在正常的数字范围之类。总结一下：n的阶乘的位数等于		  (int)(log10(1)+log10(2)+log10(3)+......+log10(n)) + 1

 就可以写出解题代码了：

 1 #include <math.h> 2 #include <stdio.h> 3 #include <string.h> 4  5 int main(){ 6     int T, m; 7     double ans; 8     scanf ("%d", &T); 9     while(T --){10         ans = 0;11         scanf("%d", &m);12         for (int i = 1; i <= m; i ++)13             ans += log10(i);14         printf ("%d\n", (int)ans + 1);15     }16     return 0;17 }
View Code

 


联系
我们