唯一质因数分解定理:
任意一个合数a仅能以一种方式，写成如下的乘积形式：
a = p1^e1*p2^e2*…*pr^er

const int N = (int)2e5 + 7;
int noprime[N], pcnt, p[N / 2];
int nump[N / 2], yinzi[N / 2];
int n, m, top;
void getprime(){
    pcnt = 0;
    memset(noprime, 0, sizeof(noprime));
    noprime[0] = noprime[1] = 1;
    for(int i = 2; i < N; ++i) {
        if(!noprime[i])p[pcnt++] = i;
        for(int j = 0; j < pcnt && i * p[j] < N; ++j) {
            noprime[i * p[j]] = 1;
            if(i % p[j] == 0)break;
        }
    }
}
void cal(int t){
    memset(nump, 0, sizeof(nump));
    top = -1;
    int tmp = (int)sqrt(t*1.0);
    for(int i = 0; i < pcnt && p[i] <= tmp; ++i) {
        if(t % p[i] == 0) {
            yinzi[++top] = p[i];
            while (t % p[i] == 0) {
                nump[top] ++;
                t /= p[i];
            }
        }
        if(t == 1)break;
    }
    if(t > 1) {
        yinzi[++top] = t;
        nump[top] ++;
    }
}