POJ1423 Big Number 【求N的阶乘的位数】
来源:互联网 发布:部落冲突弹跳法术数据 编辑:程序博客网 时间:2024/05/21 20:39
Big Number
Time Limit: 1000MS Memory Limit: 65536KTotal Submissions: 26151 Accepted: 8349
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 <= m <= 10^7 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
Source
Dhaka 2002
#include <stdio.h>#include <math.h>const double PI = acos(-1.0);const double E = exp(1.0);int main() {int t, n;scanf("%d", &t);while(t--) {scanf("%d", &n);printf("%d\n", (int)(log10(2*PI*n)/2+n*log10(n/E))+1);} return 0;}
0 0
- POJ1423 Big Number 【求N的阶乘的位数】
- hdu 1018 -Big Number(求n的阶乘的位数)
- hdoj 1018 Big number 求n阶乘的位数
- Big Number(求任意阶乘的位数)
- UVa1185 - Big Number(求阶乘的位数)
- [ACM Steps]2.2.8 Big Number 求N!位数 大数N阶乘的位数
- 【HDU1018】Big Number - 求n!的位数
- POJ1423求n的阶乘 Java解题
- 求大数的阶乘的位数:PKU :1423:Big Number
- zoj 1526 Big Number (N阶乘的位数)
- 杭电1018 Big Number (求阶乘结果的位数)
- 求大数阶乘的位数(ACM Big Number问题)
- Big Number(求阶乘数的位数)
- HDU1018 POJ1423 UVALive2697 UVA1185 ZOJ1526 Big Number【阶乘位数】
- HDU 1018 Big Number(求n!的位数)
- Big Number(hdu1018,求n!的位数)
- Hdu 1018 Big Number 求N!的位数
- HDU 1018 Big Number(求n!的位数)
- 关于在windows os 下 MBR/GPT 分区的实现 (一)
- 一点想法
- tomcat配置虚拟路径
- list
- Java数据类型Null判断
- POJ1423 Big Number 【求N的阶乘的位数】
- POJ 1017:装箱问题
- Android DrawerLayout 高仿QQ5.2双向侧滑菜单
- sql语句
- POJ 1061:青蛙的约会
- 51cto万年历:http://edu.51cto.com/lesson/id-12126.html
- POJ 1067:取石子游戏
- 巧用tmpfs加速你的linux服务器
- 反转链表