高精度 hdu 2940 Hex Factorial

#include<cstdio>
#include<cstring>
#include<cmath>
using namespace std;
const int BIT = 16;
struct BIGint{
int bit[200];
void MEMset(){
memset(bit,0,sizeof(bit));
bit[1] = 1;
}
void multiply(int n){
int tmp;
for (int i = 1;i < 200;++i)
bit[i] *= n;

for (int i = 1;i < 200;++i)
if (tmp = bit[i] / BIT){
bit[i] %= BIT;
bit[i+1] += tmp;
}
}
int CountZore(){
int i = 199,ans(0);
while( !bit[i--] );
while(i) if(!bit[i--])ans++;
return ans;
}
}bigInt;
int ans[110];
void init(){
memset(ans,0,sizeof(ans));
bigInt.MEMset();
for (int i = 2;i <= 101;++i){
bigInt.multiply(i);
ans[i] = bigInt.CountZore();
}
}

int main ()
{
init();
int n;
while(~scanf("%d",&n) && n >= 0)
printf("%d\n",ans
);

return 0;
}