#include
#include
typedef struct num
{
int data[10000];
int len;
} NUM;
void jc(NUM* sj, int n)
{
int i = 0, j = 0, temp = 0, inc = 0;
int len = 0;
memset(sj, 0, sizeof(NUM));
sj->data[0] = 1;
for (i=1;i<=n;i++)
{
for (j=0;j<=len;j++)
{
temp = sj->data[j]*i + inc;
sj->data[j] = temp%100000;
inc = temp/100000;
}
if (inc)
len++, sj->data[j] = inc, inc = 0;
}
sj->len = len;
}
/*算法1*/
int countzero_1(NUM*sj)
{
int i = 0, k ,n;
while (sj->data[i]==0)
i++;
n = sj->data[i];
k = 0;
while (n%10==0)
n/=10,k++;
return i * 5 + k;
}
/*算法2*/
int countzero_2(int st,int dt)
{
int count=0 ;
int i ;
for(i=st;i<=dt;++i)
{
int temp=i ;
while(temp%5==0)
{
++count ;
temp/=5 ;
}
}
return count ;
}
int main()
{
NUM rst;
jc(&rst,100);
printf("%d\n", countzero_1(&rst));
printf("%d\n", countzero_2(1,100));
return 0;
} ----------物联网校企联盟技术部