UVA 10892 LCM Cardinality——质因分解

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <cmath>
#define OUT freopen("out.txt", "w", stdout)
using namespace std;
const int maxn = 1e5 + 10;
bool isprime[maxn];
int prime[maxn], primecnt;
void init() {
    memset(isprime, true, sizeof(isprime));
    primecnt = 0;
    for (int i = 2; i < maxn; i++) {
        if (isprime[i]) {
            prime[++primecnt] = i;
            for (int j = i * 2; j < maxn; j += i) isprime[j] = false;
        }
    }
}
int p[maxn], cnt;
void breakdown(int x) {
    cnt = 0;
    for (int i = 1; i <= primecnt && x > 1; i++) {
        if (x % prime[i]) continue;
        ++cnt;
        while (x % prime[i] == 0 && x > 1) {
            p[cnt]++;
            x /= prime[i];
        }
    }
    if (x > 1) p[++cnt] = 1;
}
int main() {
    //OUT;
    init();
    int n;
    while (~scanf("%d", &n) && n) {
        memset(p, 0, sizeof(p));
        breakdown(n);
        long long ans = 1;
        for (int i = 1; i <= cnt; i++) {
            ans *= (long long)2 * p[i] + 1;
        }
        ans = (ans + 1) / 2;
        printf("%d %lld\n", n, ans);
    }
    return 0;
}