Big Number
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 30865 Accepted Submission(s): 14297
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)
题目大意给你一个数要你找到小于这个数最大的质数
思路: 素数打表 搜索 数据比较小直接暴力也可以水过
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
using namespace std;
int main()
{
int t,m;
cin>>t;
while(t--)
{
cin>>m;
double x = 0;
for(int i = 1;i <= m; i++)
{
x += log10(i);
}
int n = (int)x + 1;
cout<<n<<endl;
}
return 0;
}