hdu 2964 Prime Bases

#include<iostream>
using namespace std;
int a[11][2];
int prime[12] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31};
int t;

int A(int x)
{
int i, j;
__int64 sum = 1;
for( i=0; sum <= x; i++ )
sum *= prime[i];
sum /= prime[i-1];
a[t][0] = i-2;
if(sum != 0)
a[t++][1] = x / sum;
return  x % sum;
}

int main()
{
int n;
while(scanf("%d", &n) != EOF  && n)
{
t = 0;
printf("%d =", n);
memset(a, 0, sizeof(a));
int i, j;
while(n >= 1)
n = A(n);

bool p = false;
for( i=t-1; i >= 0; i-- )
{
if(p)
printf(" +");
p = true;
printf(" %d",a[i][1]);
if(a[i][0] > -1)
{
for( j=0; j <= a[i][0]; j++ )
printf("*%d", prime[j]);
}
}
printf("\n");
}
return 0;
}