UVALive - 8270 A Partial Order Relation 哈斯图边数

题目

$求出n的偏序关系下的哈斯图的边数$
如图
$n = 60$

---

题解

$考虑对n质因子分解$
$分解为m个质数因子每个因子有c_{i}个$
对于每一质数因子$i$会被相关联$c_i*{\prod_{j=1}^m (c_j+1)}(j \ne i)$条边

---

代码

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn = 1000000;
ll prime[maxn];
ll factor[100000][2];int facnt;
void getPrime() {
    memset(prime,0,sizeof(prime));
    for(ll i=2;i<maxn;i++) {
        if(!prime[i]) prime[++prime[0]] = i;
        for(ll j=1;j<=prime[0]&&prime[j]*i<maxn;j++) {
            prime[prime[j]*i] = 1;
            if(i % prime[j] == 0) break;
        }
    }
}
void getFactor(ll p) {
    facnt = 0;
    ll tmp = p;
    for(ll i=1;prime[i]*prime[i]<=tmp;i++) {
        factor[facnt][1] = 0;
        if(tmp % prime[i] == 0) {
            factor[facnt][0] = prime[i];
            while(tmp % prime[i] == 0) {
                factor[facnt][1]++;
                tmp /= prime[i];
            }
            facnt++;
        }
    }
    if(tmp != 1) {
        factor[facnt][0] = tmp;
        factor[facnt++][1] = 1;
    }
}
ll n;
int main()
{
    getPrime();
    int caset;scanf("%d",&caset);
    while(caset--) {
        scanf("%lld",&n);
        getFactor(n);
        ll ans = 0;
        for(int i=0;i<facnt;i++) {
            ll tmp = 1;
            for(int j=0;j<facnt;j++) if(i!=j){
                tmp *= (factor[j][1] + 1);
            }
            ans += tmp * factor[i][1];
        }
        printf("%lld\n",ans);
    }   
    return 0;
}