莫比乌斯反演：跟着Po大爷的讲稿刷题

2301: [HAOI2011]Problem b

#include<bits/stdc++.h>
using namespace std;
const int maxn=50000+105,N=50000;
int mu[maxn],sum[maxn],p[maxn],sz;
bool isp[maxn];
void ready()
{
    sz=0;
    sum[1]=mu[1]=1;
    memset(isp,1,sizeof(isp));
    for(int i=2;i<=N;i++)
    {
        if(isp[i])
        {
            mu[i]=-1;
            p[++sz]=i;
        }
        for(int k=1;k<=sz && p[k]*i<=N;k++)
        {
            isp[i*p[k]]=0;
            if(i%p[k]==0)
            {
                mu[i*p[k]]=0;
                break;
            }
            mu[i*p[k]]=-mu[i];
        }
        sum[i]=sum[i-1]+mu[i];
    }
}
int a,b,c,d,k;
int calc(int n,int m)
{
    if(n>m)swap(n,m);
    int ret=0;
    for(int i=1,last;i<=n;i=last+1)
    {
        last=min(n/(n/i),m/(m/i));
        ret+=(n/i)*(m/i)*(sum[last]-sum[i-1]);
    }
    return ret;
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out1.txt","w",stdout);
    ready();
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d%d%d%d%d",&a,&b,&c,&d,&k);
        int ans=0;
        ans+=calc( b/k , d/k );
        ans-=calc( (a-1)/k , d/k );
        ans-=calc( b/k , (c-1)/k );
        ans+=calc( (a-1)/k , (c-1)/k );
        printf("%d\n",ans);
    }
    return 0;
}

BZOJ 2820: YY的GCD

#include<cmath>
#include<queue>
#include<cctype>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long LL;
const int maxn=1e7+105,N=1e7;
int u[maxn],p[maxn],sum[maxn],sz;
bool isp[maxn];
void ready()
{
    u[1]=1;
    memset(isp,1,sizeof(isp));
    for(int i=2;i<=N;i++)
    {
        if(isp[i])
        {
            u[i]=-1;
            p[++sz]=i;
        }
        for(int k=1;k<=sz && i*p[k]<=N;k++)
        {
            isp[i*p[k]]=0;
            if(i%p[k]==0)
            {
                u[i*p[k]]=0;
                break;
            }
            u[i*p[k]]=-u[i];
        }
    }
    for(int i=1;i<=sz;i++)
        for(int k=p[i];k<=N;k+=p[i])
            sum[k]+=u[k/p[i]];
    for(int i=1;i<=N;i++)
        sum[i]+=sum[i-1];
}
void solve()
{
    int n,m;
    LL ans=0;
    scanf("%d%d",&n,&m);
    if(n>m)swap(n,m);
    for(int i=1,last;i<=n;i=last+1)
    {
        last=min(n/(n/i),m/(m/i));
        ans+=1ll*(n/i)*(m/i)*(sum[last]-sum[i-1]);
    }
    printf("%lld\n",ans);
}
int main()
{
    //freopen("in.txt","r",stdin);
    int T;
    ready();
    scanf("%d",&T);
    while(T--)
        solve();
    return 0;
}

BZOJ 3529: [Sdoi2014]数表

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+105,N=1e5;
int mu[maxn],p[maxn],ans[maxn],sz;
bool isp[maxn];
struct BIT
{
    int c[maxn];
    int lowbit(int x)
    {
        return x&(-x);
    }
    void add(int i,int v)
    {
        for(;i<=N;i+=lowbit(i))c[i]+=v;
    }
    int query(int i)
    {
        int ret=0;
        for(;i;i-=lowbit(i))ret+=c[i];
        return ret;
    }
}bit;
struct data{
    int id,f;
    friend bool operator<(data a,data b)
    {
        return a.f<b.f;
    }
}E[maxn];
struct query{
    int a,n,m,id;
    friend bool operator<(query a,query b)
    {
        return a.a<b.a;
    }
}q[maxn];
void ready()
{
    sz=0;
    mu[1]=1;
    memset(isp,1,sizeof(isp));
    for(int i=2;i<=N;i++)
    {
        if(isp[i])
        {
            mu[i]=-1;
            p[++sz]=i;
        }
        for(int k=1;k<=sz && p[k]*i<=N;k++)
        {
            isp[i*p[k]]=0;
            if(i%p[k]==0)
            {
                mu[i*p[k]]=0;
                break;
            }
            mu[i*p[k]]=-mu[i];
        }
    }
    for(int i=1;i<=N;i++)E[i]=(data){i,1};
    for(int i=2;i<=N;i++)
        for(int j=i;j<=N;j+=i)
            E[j].f+=i;
    sort(E+1,E+N+1);
}
int T,top=1;
void Init()
{
    scanf("%d",&T);
    for(int i=1;i<=T;i++)
    {
        q[i].id=i;
        scanf("%d%d%d",&q[i].n,&q[i].m,&q[i].a);
    }
    sort(q+1,q+T+1);
}
int solve(int a,int n,int m)
{
    while(top<=N && E[top].f<=a)
    {
        for(int k=E[top].id;k<=N;k+=E[top].id)
            bit.add(k,E[top].f*mu[k/E[top].id]);
        top++;
    }
    int ret=0;
    if(n>m)swap(n,m);
    for(int i=1,last;i<=n;i=last+1)
    {
        last=min(n/(n/i),m/(m/i));
        ret+=(n/i)*(m/i)*(bit.query(last)-bit.query(i-1));
    }
    return ret;
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out1.txt","w",stdout);
    ready();
    Init();
    for(int i=1;i<=T;i++)
        ans[q[i].id]=solve(q[i].a,q[i].n,q[i].m);
    for(int i=1;i<=T;i++)
        printf("%lld\n", ans[i] & ( (1ll<<31)-1 ) );
    return 0;
}