# Big Number

 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 Source Asia 2002, Dhaka (Bengal) Recommend JGShining weishu qu log  ac `#include #include #include using namespace std; int main() { double t; double sum; int n; cin>>n; int x; int i,j; int sum1; while(n--) { sum=0; cin>>x; for(i=x;i>=1;i--) { sum=sum+log10(i); } sum1=int(sum)+1; cout<

• 本文已收录于以下专栏：

## HDU 1018 Big Number N！的位数

Big Number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total...

## HDU 1018 Big Number (数的阶乘的长度：数学)

Big Number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tot...

## HDU 1212 Big Number 大数取模

Big Number                                        ...

## ACM-数论之Big Number——hdu1018

ACM 数论 Big Number hdu1018 斯特林公式

## HODJ Big Number（java 阶乘）

Big Number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Tot...

## Codeforces 757B Bash's Big Day math, number theory

B. Bash's Big Day time limit per test 2 seconds memory limit per test 512 megabytes ...

## 杭电OJ——1018 Big number！

Big Number    Time Limit: 2000/1000 MS (Java/Others)     Memory Limit: 65536/32768 K (Java/Others)...

举报原因： 您举报文章：深度学习：神经网络中的前向传播和反向传播算法推导 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)