UESTC 982质因子分解

/* ***********************************************
Author        :guanjun
Created Time  :2016/7/14 15:52:06
File Name     :1.cpp
************************************************ */
#include <iostream>
#include <cstring>
#include <cstdlib>
#include <stdio.h>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <math.h>
#include <stdlib.h>
#include <iomanip>
#include <list>
#include <deque>
#include <stack>
#define ull unsigned long long
#define ll long long
#define mod 90001
#define INF 0x3f3f3f3f
#define maxn 50000
#define cle(a) memset(a,0,sizeof(a))
const ull inf = 1LL << 61;
const double eps=1e-5;
using namespace std;
priority_queue<int,vector<int>,greater<int> >pq;
struct Node{
    int x,y;
};
struct cmp{
    bool operator()(Node a,Node b){
        if(a.x==b.x) return a.y> b.y;
        return a.x>b.x;
    }
};

bool cmp(int a,int b){
    return a>b;
}
int prime[maxn];
int vis[maxn];
int cnt;
void get(){
    cnt=0;
    cle(vis);
    for(int i=2;i<maxn;i++){
        if(!vis[i]){
            prime[++cnt]=i;
            for(int j=i+i;j<maxn;j+=i){
                vis[j]=1;
            }
        }
    }
}
vector<int>v;
int main()
{
    #ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
    #endif
    //freopen("out.txt","w",stdout);
    ll t,n;
    get();
    cin>>t;
    while(t--){
        cin>>n;
        ll tmp=n;
        v.clear();
        for(int i=1;i<=cnt;i++){
            int x=prime[i];
            while(n%x==0){
                n/=x;
                v.push_back(x);
            }
        }
        if(n>1)v.push_back(n);
        int m=v.size();
        printf("%d=",tmp);
        for(int i=0;i<m;i++){
            printf("%d%c",v[i],i==m-1?10:‘*‘);
        }
    }
    return 0;
}