zoukankan      html  css  js  c++  java
  • 杭电1018-Big Number(大数)

    Big Number

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


    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
     

             还记得那个奇妙的斯塔林公式吗?


             直接就是公式了!


    #include<cstdio>
    #include<cstring>
    #include<cmath>
    #define pi acos(-1.0)
    using namespace std;
    int n;
    int solve()
    {
    	return (int)((n*log(n)-n+(log(2*pi*n))/2)/log(10))+1;
    }
    int main()
    {
    	int N;
    	scanf("%d",&N);
    	while(N--)
    	{
    		scanf("%d",&n);
    		int t=solve();
    		printf("%d
    ",t);
    	}
    	return 0;
    }


  • 相关阅读:
    2020软件工程作业01
    问题清单
    2020软件工程个人作业06——软件工程实践总结作业
    感谢随笔
    2020软件工程作业05
    2020软件工程作业04
    2020软件工程作业03
    2020软件工程作业02
    2020软件工程作业01
    2020软件工程个人作业06——软件工程实践总结作业
  • 原文地址:https://www.cnblogs.com/yutingliuyl/p/6905433.html
Copyright © 2011-2022 走看看