HDU 1018 Big Number (数学题)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1018

解题报告:输入一个n,求n!有多少位。

首先任意一个数 x 的位数 = (int)log10(x) + 1;

所以n!的位数 = (int)log10(1*2*3*.......n) + 1;

= (int)(log10(1) + log10(2) + log10(3) + ........ log10(n)) + 1;

 1 #include<cstdio>
 2 #include<cstring>
 3 #include<algorithm>
 4 #include<iostream>
 5 #include<cmath>
 6 #include<queue>
 7 using namespace std;
 8 const int maxn = 100000+5;
 9 double ans[maxn];
10
11 double dabiao(int n)
12 {
13     double temp = 0;
14     for(int i = 1;i <= n;++i)
15     temp += log10((double)i);
16     return temp;
17 }
18 int main()
19 {
20     int T,n;
21     scanf("%d",&T);
22     while(T--)
23     {
24         scanf("%d",&n);
25         printf("%d\n",(int)dabiao(n) + 1);
26     }
27     return 0;
28 }

HDU 1018 Big Number (数学题)

时间: 2024-10-25 18:33:17

HDU 1018 Big Number (数学题)的相关文章

HDU 1018 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

HDU 1018 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

HDU 1018 Big Number (简单数学)

Big Number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25649    Accepted Submission(s): 11635 Problem Description In many applications very large integers numbers are required. Some of these

HDU 1018 -- Big Number (Stirling公式求n!的位数)

题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1018 Big Number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 40551    Accepted Submission(s): 19817 Problem Description In many applications ver

HDU 1018 Big Number (log函数求数的位数)

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

HDU 1018.Big Number【7月25】

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, y

hdu 1018 Big Number 两种方法 log方法(300+ms)+斯特林公式(0+ms)

Big Number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 28178    Accepted Submission(s): 12819 Problem Description In many applications very large integers numbers are required. Some of thes

hdu 1018 Big Number 数学结论

Big Number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 34084    Accepted Submission(s): 16111 Problem Description In many applications very large integers numbers are required. Some of these

HDU 1018:Big Number (位数递推公式)

Problem DescriptionIn 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