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?
The only line of input contains an integer m (1 ≤ m ≤ 100 000) — the required number of trailing zeroes in factorial.
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.
1
5 5 6 7 8 9
5
0
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.
给你一个m,让你输出符合条件的n,n要符合的条件是n!末尾有m个0, 想要末尾有0的话,必须是2*5,求阶乘 乘到5的话钱肯定能有2,所以数一下阶乘因子有多少个
5结尾就有多少个0
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int zero[500000];
int a[10];
int main(){
int n,i,j;
for(i = 0; i < 500000; i ++){
j = 0;
n = i;
while(n){
n/=5;
j+=n;
}//算n的阶乘因子有多少个5
zero[i] = j;
}
while(scanf("%d",&n)!=EOF){
j=0;
for(i = 0; i < 500000; i ++){
if(zero[i] == n){
a[j++]=i;
}
}
printf("%d\n",j);
for(i=0;i<j;i++){
if(i != j-1)
printf("%d ",a[i]);
else
printf("%d\n",a[i]);
}
}
}