acdream Number theory

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
#include <set>

using namespace std;
typedef long long ll;
const int N = 300000;

int flag[N];
int cnt[N], n;
int p[N], sz;

void make_prime(){
    for(int i=2; i<N;++i) if(!flag[i]){
        for(int j=i+i;j<N;j+=i) flag[j]=i;
    }
}
void disp(int x){
    sz = 0;
    while(flag[x]){
        p[sz++] = flag[x];
        x /= flag[x];
    }
    if(x > 1) p[sz++] = x;
    sz = unique(p, p+sz)-p;//不同元素的个数
}
int cal(){
    int ret = 0;
    int mask = 1 << sz;

    for(int i = 1; i < mask; ++i){
        int bit = 0, tem = 1;
        for(int j = 0; j < sz; ++j)
            if(i >> j & 1) bit++, tem *= p[j];
        if(bit & 1) ret += cnt[tem];//模拟可知
        else ret -= cnt[tem];
        cnt[tem]++;
    }
    return ret;
}

int main(){
    make_prime();
    while(scanf("%d", &n) != EOF){
        memset(cnt, 0, sizeof(cnt));
        ll ans = 1LL * n * (n - 1) / 2;
        for(int i = 0, x; i < n; ++i){
            scanf("%d", &x);
            if(x == 1) continue;
            disp(x);
            ans -= cal();
        }
        cout << ans << endl;
    }
    return 0;
}

This time I will give you some straight!

Give you a sequence a1, a2, a3...,an, the question is how many pair(ai, aj) that ai and aj is coprime（互质）? (i < j)