A Trivial Problem CodeForces - 633B
Mr. Santa asks all the great programmers of the world to solve a trivial problem. He gives them an integer m and asks for the number of positive integers n, such that the factorial of n ends with exactly m zeroes. Are you among those great programmers who can solve this problem?
Input
The only line of input contains an integer m (1 ≤ m ≤ 100 000) — the required number of trailing zeroes in factorial.
Output
First print k — the number of values of n such that the factorial of n ends with m zeroes. Then print these k integers in increasing order.
Example
Input
1
Output
5
5 6 7 8 9
Input
5
Output
0
Note
The factorial of n is equal to the product of all integers from 1 to n inclusive, that is n! = 1·2·3·...·n.
Mr. Santa asks all the great programmers of the world to solve a trivial problem. He gives them an integer m and asks for the number of positive integers n, such that the factorial of n ends with exactly m zeroes. Are you among those great programmers who can solve this problem?
Input
The only line of input contains an integer m (1 ≤ m ≤ 100 000) — the required number of trailing zeroes in factorial.
Output
First print k — the number of values of n such that the factorial of n ends with m zeroes. Then print these k integers in increasing order.
Example
Input
1
Output
5
5 6 7 8 9
Input
5
Output
0
Note
The factorial of n is equal to the product of all integers from 1 to n inclusive, that is n! = 1·2·3·...·n.
In the first sample, 5! = 120, 6! = 720, 7! = 5040, 8! = 40320 and 9! = 362880.
题解:这道题就是问阶乘的末尾有几个零。只需要求出有几个5就行了。
#include<stdio.h>
int main()
{
long long n;
while(scanf("%I64d",&n)!=EOF)
{
long long k=0;
for(int i=5;;i=i+5)
{
long long temp=i;
while(temp%5==0)
{
temp /= 5 ;
k++;
}
if(k>=n)
if(k==n)
{
printf("5\n");
printf("%d %d %d %d %d\n",i,i+1,i+2,i+3,i+4 );
break;
}
else
{
printf("0\n");
break;
}
}
}
}