LightOJ - 1236 Pairs Forming LCM 唯一分解定理与LCM

题意：

略

思路：

由 唯一分解定理和 lcm 的关系，推出每个素因子的出现的可能种数，所有质因子之间种类数是相互乘的

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1e7 + 7, maxd = 100 + 7;
const ll mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

ll n;
bool p[maxn];
ll prim[maxn/10];
int num_;
int cnt[maxd];

void init() {
    memset(p, 1, sizeof p);
    num_ = 0;
    for(int i = 2; i < maxn; ++i) {
        if(p[i]) {
            prim[num_++] = i;
            for(int j = 2*i; j < maxn; j += i)
                p[j] = 0;
        }
    }
}

//void init() { // 另一种快速打表方法
//    memset(p, 1, sizeof p);
//    num_ = 0;
//    for(int i = 2; i < maxn; ++i) {
//        if(p[i]) prim[num_++] = i;
//        for(int j = 0; prim[j]*i < maxn && j < num_; ++j) {
//            p[i*prim[j]] = 0;
//            if(i % prim[j] == 0) break;
//        }
//    }
//}

void solve() {
    memset(cnt, 0, sizeof cnt);
    int pos = 0, m = sqrt(n);
    for(int i = 0; prim[i] <= m && i < num_; ++i) {
        if(n < maxn && p[n]) break;
        if(n % prim[i] == 0) {
            int num = 0;
            while(n % prim[i] == 0) {
                num++;
                n /= prim[i];
            }
            cnt[pos++] = num;
        }
        if(n == 1) break;
    }
    if(n > 1) cnt[pos++] = 1;
    int ans = 1;
    for(int i = 0; i < pos; ++i) {
        ans *= (2 * cnt[i] + 1);
    }
    cout << (ans/2 + 1) << endl;
}

int main() {
    kuaidian;
    init();

    int T;
    cin >> T;
    for(int tt = 1; tt <= T; ++tt) {
        cin >> n;
        cout << "Case " << tt << ": ";
        solve();
    }

    return 0;
}