Big Number
来源:互联网 发布:世界征服者 mac 编辑:程序博客网 时间:2024/05/19 13:43
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 30894 Accepted Submission(s): 14311
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
21020
Sample Output
719
#include<stdio.h>#include<math.h>int main(){int a,b,i,k,j;scanf("%d",&a);while(a--){double sum=0;scanf("%d",&b);for(i=1;i<=b;i++)sum=sum+log10((double)i);printf("%d\n",(int)sum+1);}return 0;}
0 0
- big big number 求和
- big number
- Big Number
- Big Number
- big number
- Big Number
- Big Number
- Big Number
- Big Number
- Big Number
- Big Number
- Big Number
- Big Number
- Big Number
- Big Number
- Big Number
- Big Number
- Big Number
- Jedis - Redis事务
- 随机数相加
- 未解——mathematica输出形式,如何展开?
- File文件读取与输入输出流
- 《数据结构与算法分析》哈希表(散列)简介与实现
- Big Number
- Jquery - JSON / JSON string
- wpf 控件的依赖属性和数据绑定
- flash as3用代码播放声音的常用方法和属性
- IT人-你真的知道自己要什么吗?
- 判断素数 hdoj1795
- HD2524 矩形A+B
- 网络编程
- 使用无插件的eclipse版本进行J2EE开发所需要下载的插件