SPOJ Problem 346:Bytelandian gold coins

#include<cstdio>
#include<cstring>
int a[100005];
int q[100005],l,r,t,i,n;
long long ans;
int main(){
    for (i=0;i<=100000;i++){
        a[i]=a[i/2]+a[i/3]+a[i/4];
        if (i>a[i])a[i]=i;
    }
    while(scanf("%d",&n)!=EOF){
        l=0;r=1;ans=0;
        memset(q,0,sizeof(q));
        q[1]=n;
        while(l<r){
            t=q[++l];
            if (t<=100000)ans+=a[t];
            else {
                q[++r]=t/2;
                q[++r]=t/3;
                q[++r]=t/4;
            }
        }
        printf("%lld\n",ans);
    }
}