杜教筛模版

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
int n,m,T,ans;
const int MAXN=7000000;
vector<int>prime;
bool check[MAXN+5];
short mob[MAXN+5],premob[MAXN+5];
int phi[MAXN+5];
long long prephi[MAXN+5];
void sieve()
{
    prephi[1]=phi[1]=1;         //欧拉筛
    premob[1]=mob[1]=1;         //莫比乌斯函数筛
    for(int i=2;i<=MAXN;i++)
    {
        if(check[i]==0)
        {
            prime.push_back(i);
            phi[i]=i-1;
            mob[i]=-1;
        }
        for(int j=0;j<prime.size()&&i*prime[j]<=MAXN;j++)
        {
            check[i*prime[j]]=1;
            if(i%prime[j]==0)
            {
                phi[i*prime[j]]=phi[i]*prime[j];
                mob[i*prime[j]]=0;
                break;
            }
            phi[i*prime[j]]=phi[i]*(prime[j]-1);
            mob[i*prime[j]]=-mob[i];
        }
        prephi[i]=prephi[i-1]+phi[i];
        premob[i]=premob[i-1]+mob[i];
    }
}
struct DuSieve
{
    function<long long(int)>get_preFcovG,get_preG,get_preF;
    gp_hash_table<int,long long>F;
    long long get_preF(int n)
    {
        if(n<=MAXN)return get_preF(n);
        if(F.find(n)!=F.end())return F[n];
        long long ans=get_preFcovG(n);
        for(long long l=2,r;l<=n;l=r+1)
        {
            r=n/(n/l);
            ans-=(get_preG(r)-get_preG(l-1))*get_preF(n/l);
        }
        return F[n]=ans;
    }
    DuSieve(function<long long(int)>FcG,function<long long(int)>pG,function<long long(int)>pF)
    {
        get_preFcovG=FcG;
        get_preG=pG;
        get_preF=pF;
    }
};
int main()
{
    sieve();
    DuSieve PHI=DuSieve([](int n) {return (1ll+n)*n/2;},[](int n) {return n;},[](int n) {return prephi[n];});
    DuSieve MU=DuSieve([](int n) {return 1;},[](int n) {return n;},[](int n) {return premob[n];});
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        printf("%lld %lld\n",PHI.get_preF(n),MU.get_preF(n));
    }
    return 0;
}