hdu 1164 Eddy's research I

#include<iostream>
#include<cstring>
#include<cstdio>
#include<string>
#include<cmath>
#include<algorithm>
using namespace std;
#define MAX 65535
int prime[MAX+5];
bool vis[MAX+5];
int index=0;
void get_prime(){
    memset(vis,false,sizeof(vis));
    int i=2;
    //int sum=0;
    for(;i<=MAX;i++){
        if(!vis[i]){
            prime[index++]=i;
        }
        int j=0;
        for(;j<index&&i*prime[j]<=MAX;j++){
            vis[i*prime[j]]=true;
            //sum++;
            if(i%prime[j]==0){
                break;
            }
        }
    }
    /*i=0;
    for(;i<index;i++){
        cout<<i<<' '<<prime[i]<<endl;
    }*/
    //cout<<"1"<<' '<<sum<<endl;
}
int main()
{
    //freopen("INPUT.txt", "r", stdin);
    get_prime();
    int n;
    while(cin>>n){
        int j=0;
        for(;j<index&&n>1;j++){
            if(n%prime[j]==0){
                //cout<<j<<"***"<<prime[j]<<endl;
                n/=prime[j];
                cout<<prime[j];
                while(n%prime[j]==0){
                    n/=prime[j];
                    cout<<"*"<<prime[j];
                }
                break;
            }
        }
        for(;j<index&&n>1;j++){
            while(n%prime[j]==0){
                    n/=prime[j];
                    cout<<"*"<<prime[j];
                }
        }
        cout<<endl;
    }
    return 0;
}

素数分解与输出，注意输出格式