hdu1018大数阶乘的位数,斯特林数的各种应用
来源:互联网 发布:淘宝店铺活动怎么参加 编辑:程序博客网 时间:2024/05/23 20:45
Big Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 23115 Accepted Submission(s): 10424
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
题目分析:
第一种做法:
N!=1*2*3....*n
求位数我们一般用对一个数取对数就可以了 ,
log10(n!)=log10(1)+ log10(2) +log10(3)...+log10(n);
所以循环求和就可以了!
但是这里注意一点 结果要加1!因为这里计算出来的 log10(1)=0 !
所以结果要加上这个误差 ‘1’
第二种做法:
这就是我最近研究的斯特林数,第一类斯特林数就可以做这个!
补充一点,斯特林数能够做一切关于阶乘有关的大数运算 要深入学习!
这里给出递归公式:
log10(n!)=1.0/2*log10(2*pi*n)+n*log10(n/e)
然后我就附上代码了;
两种做法都有!
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
#
include
<iostream>
#
include
<cmath>
#
include
<cstdio>
#define e
2.7182818284590452354
#define pi acos(-
1
)
using
namespace
std;
int
main(){
int
cas,ans,n;
cin>>cas;
while
(cas--){
scanf(
"%d"
,&n);
ans=(
int
)(
1.0
/
2.0
*log(
2.0
*pi*n)/log(
10.0
)+
1.0
*n*log(n/e)/log(
10.0
)+
1
);
printf(
"%d\n"
,ans);
}
return
0
;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
#
include
<iostream>
#
include
<cmath>
#
include
<cstdio>
#define e
2.7182818284590452354
#define pi acos(-
1
)
using
namespace
std;
int
main(){
int
cas,ans,i,n;
double sum;
cin>>cas;
while
(cas--){
scanf(
"%d"
,&n);
sum=
1
;
for
(i=
1
;i<=n;i++)
sum+=log10(i);
printf(
"%d\n"
,((
int
)sum));
}
return
0
;
}
0 0
- hdu1018大数阶乘的位数,斯特林数的各种应用
- HDU1018-Big Number(阶乘的位数)
- hdu1018 阶乘位数的数学原理
- hdu1018 Big Number(阶乘数的位数)
- Big Number(hdu1018,大数的位数log)
- 大数阶乘的位数
- 大数阶乘的位数
- 杭电hdu1018,bignumber 求阶乘的位数用log
- hdu1018+ cug1441N!的位数
- HDU1018求大数N!的位数【取对数】
- hdu1018阶乘位数
- 求大数阶乘结果的位数
- 关于大数的阶乘与确定阶乘结果的位数
- 【HDU1018】Big Number - 求n!的位数
- HDU1018 Big Number n!的位数
- hdu1018(求n!的位数)
- hdu1018(求n!的位数)
- 求大数的阶乘的位数:PKU :1423:Big Number
- [MDIT每天一小时]2014年Android系统就业前景浅析
- HDU 3518 Boring counting
- 在Eclipse中使用Maven构建Spring项目
- First Missing Positive
- DOM学习笔记
- hdu1018大数阶乘的位数,斯特林数的各种应用
- JAVA的动态代理
- Hadoop Pig学习笔记(一) 各种SQL在PIG中实现
- 第二层是指 软件,包括可用来搜集
- C/C++内存分配知识
- 测试
- 做出上述表述的高管是谷歌首席财务官
- Linux异步通知 fasync
- 明天开始专心找工作