杭電1018-Big Number

2455 ワード
杭電ACM_すいもんだい
Big Number
Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20623    Accepted Submission(s): 9261
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   ，n        
    ，   1<=n<10000000， n=10000000    n
              ，         ， 
       ，   n     ，         
   ，   ，               ，  
                  ，        
   ，             。         
       。


    ，     n      ， n    n   
  ，                 。


    ，           ，       a   
  (int)log10(a) + 1；    ？         ：


              a，
    10^(x-1)<=a<10^x，    a    x ，
     
  log10(10^(x-1))<=log10(a)
#include
using namespace std;
int main()
{
	int t,n,i;
	double m;
	while(cin>>t)
	{
		while(t--)
		{
			cin>>n;
			m=0;
			for(i=1;i<=n;i++)
			{
				m+=log10(double(i));
			}
			cout<
Javaスレッドを実行してからreturnする方法
JAva読み出しXML(JDOM)