hdu 1018
来源:互联网 发布:淘宝怎么买彩票 编辑:程序博客网 时间:2024/06/09 21:39
Big Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 29336 Accepted Submission(s): 13454
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
ps:公式题
题意:一个数n的阶层的位数等于1+log10(i)+.....+log10(n)
#include<cmath>#include<cstdio>using namespace std;int main(){ int num,t; scanf("%d",&t); while(t--) { double a=1.0; scanf("%d",&num); for(int i=1;i<=num;i++) a+=log10(i); printf("%d\n",(int)a); } return 0;}
0 0
- hdu 1018
- hdu 1018
- HDU 1018
- hdu 1018
- hdu 1018
- hdu-1018
- hdu 1018
- HDU 1018
- HDU 1018
- hdu 1018
- HDU-1018
- HDU-1018
- hdu 1018
- hdu 1018
- hdu 1018
- HDU 1018
- hdu 1018
- hdu 1018
- Bellman-Ford算法
- 注意检查变量的边界
- ListView的Item中带按钮以及按钮布局的显示与隐藏
- 转载收藏java佛祖注释
- 设备旋转的处理方法
- hdu 1018
- 指针函数与函数指针的区别
- android repo 建仓
- 子串和
- SDN你必须知道的十大问题——SDN有哪些开源项目?
- Convert Sorted List to Binary Search Tree
- 缓冲区溢出漏洞入门介绍
- A-star算法
- js 从开始和结束时间得到中间所有天