codeforces-A Trivial Problem 判断n!末尾0的个数模板

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<stack>
#include<set>
#include<vector>
#include<ctime>
using namespace std;
int a,c,n;
int fun2(int n)
{
int num = 0;

while(n)
{
num += n / 5;
n = n / 5;
}

return num;
}//判断n!末尾0的个数
int b[1000000],l;
int main()
{
while(scanf("%d",&n)!=EOF)
{
l = 0;
for(int i = 1;;i++)
{
int a = fun2(i);
if(a==n){
b[l] = i;
l++;
}
if(a>n)break;
}
printf("%d\n",l);
if(l!=0)
{
for(int i=0;i<l-1;i++)
printf("%d ",b[i]);
printf("%d\n",b[l-1]);
}
}
return 0;
}