hd 1018 Big Number 正整数a的位数(int)log10(a)+1;n的阶乘的位数

最新推荐文章于 2021-02-16 10:43:10 发布

lc311309010103

最新推荐文章于 2021-02-16 10:43:10 发布

阅读量1.1k

点赞数

分类专栏：阶乘大数

本文链接：https://blog.csdn.net/lc311309010103/article/details/38321487

版权

该博客讨论了如何解决大数问题，特别是计算正整数n的阶乘的位数。通过利用对数的性质，将问题转化为求n个正整数对10取对数的和，然后加1得到位数。提供的C语言代码实现通过累加log10(i)来计算总位数，从而避免了直接进行大数乘法导致的效率问题。

摘要由CSDN通过智能技术生成

Big Number

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 25557 Accepted Submission(s): 11594

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 case