const int MAX=1231;
int hashtable[MAX]={0};
int primemap[MAX];
void find()
{
int count=0;
for(int i=2;i<MAX;i++){
if(hashtable[i]==0){ //i如果是素数
primemap[count++]=i;
for(int j=i*2;j<MAX;j+=j){
primemap[j]=1;
}
}
}
}
struct fenjie{
int zhishu,number;
};
fenjie *fen(int n)
{
struct fenjie a[13];
for(int i=2;i<13;i++)
{
int count=0;
if(primemap[i]==0)
if(n%i==0){
a[count].zhishu=i;
a[count].number=0;
while(n%i==0){
a[count].number++;
n/=i;
}
count++;
}
}
return a;
}