hdu2841 Visible Trees（容斥原理）

题意：从（0,0）处能看到n*m矩阵中的多少个点
解法：题意即为求$\sum_{i=1}^{n}\sum_{j=1}^{m}[gcd(i,j)==1]$
详细化简过程见数论笔记本，数论11题博客中有此模型解答。
复杂度O（$\sqrt{max(n,m)}$ )

#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#define lowbit(x) x&(-x)
#define mem(a,b) memset(a,b,sizeof(a))
#define ll long long
using namespace std;
#define rad 10000

const ll maxn = 100000+10;

int t;
ll n,m;
bool not_prime[maxn];
vector<ll> prime;
ll mu[maxn],sumu[maxn];

void mobius(){
    mu[1]=1;
    for(ll i=2;i<maxn;i++){
        if(!not_prime[i]) prime.push_back(i),mu[i]=-1;
        for(ll j=0;j<prime.size(),i*prime[j]<maxn;j++){
            not_prime[i*prime[j]]=1;
            if(!(i%prime[j])) { mu[i*prime[j]]=0; break; }
            else mu[i*prime[j]]=-mu[i];
        }
    }
    for(ll i=1;i<maxn;i++) sumu[i]=sumu[i-1]+mu[i];
}

ll cal(ll a,ll b){
    if(a>b) swap(a,b);
    ll ans=0,tmp;
    for(ll i=1;i<=a;i=tmp+1){
        tmp=min(a/(a/i),b/(b/i));
        ans+=(sumu[tmp]-sumu[i-1])*(a/i)*(b/i);
    }
    return ans;
}

int main(){
    //freopen("a.txt","r",stdin);
    scanf("%d",&t);
    mobius();
    while(t--){
        scanf("%lld%lld",&n,&m);
        printf("%lld\n",cal(n,m));
    }
    return 0;
}