n的阶乘中5的倍数个数一定比2的倍数个数少,所以只用看有多少因子5就行啦。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<map>
#include<vector>
#include<cmath>
#define mm(a,b) memset(a,b,sizeof(a))
#define ACCELERATE (ios::sync_with_stdio(false),cin.tie(0))
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
using namespace std;
int main()
{
int n,m;
scanf("%d",&n);
while(n--)
{
scanf("%d",&m);
int cnt=0;
while(m)
{
cnt+=m/5;
m/=5;
}
printf("%d\n",cnt);
}
return 0;
}