POJ1423————Big Number

最新推荐文章于 2020-10-13 11:39:28 发布

心向阳光2014

最新推荐文章于 2020-10-13 11:39:28 发布

阅读量346

点赞数

CC 4.0 BY-SA版权

分类专栏：公式题 POJ

本文链接：https://blog.youkuaiyun.com/lv414333532/article/details/47341293

POJ 同时被 2 个专栏收录

63 篇文章

订阅专栏

公式题

1 篇文章

订阅专栏

本文探讨了斯特林公式在计算阶乘位数中的应用，并通过实例展示了如何利用该公式解决实际问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Big Number

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 26892		Accepted: 8592

阶乘的位数（公式题）；

斯特林公式：

log(n!) = log10(sqrt(2*pi*n)) + n*log10(n/e);

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