杜教筛模板

 
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<map>
#define ll long long
#define N 2000005
using namespace std;
const int now=1<<20;
ll phi[N];
int pr[N],miu[N],su[N],tot;
void yu()
{
    phi[1]=1;
    miu[1]=1;
    for(int i=2;i<=now;i++)
    {
        if(!phi[i])
        {
            pr[i]=i;
            phi[i]=i-1;
            miu[i]=-1;
            su[++tot]=i;
        }
        for(int j=1;j<=tot&&su[j]<=pr[i]&&su[j]*i<=now;j++)
        {
            int p=su[j]*i;
            pr[p]=su[j];
            if(su[j]==pr[i])
            {
                phi[p]=phi[i]*su[j];
                miu[p]=0;
            }
            else
            {
                miu[p]=miu[i]*(-1);
                phi[p]=phi[i]*(su[j]-1);
            }
        }
        phi[i]+=phi[i-1];
        miu[i]+=miu[i-1];
    }
    return ;
}
map<int,int>mp;
int g(int x)
{
    if(x<=now)return miu[x];
    if(mp.find(x)!=mp.end())return mp[x];
    int ans=0;int r=0;
    for(int l=2;l<=x;l=r+1)
    {
        r=x/(x/l);
        ans+=g(x/l)*(r-l+1);
    }
    ans=1-ans;
    return mp[x]=ans;
}
map<int,ll>mmp;
ll f(int x)
{
    if(x<=now)return phi[x];
    if(mmp.find(x)!=mmp.end())return mmp[x];
    ll ans=0;int r=0;
    for(int l=2;l<=x;l=r+1)
    {
        r=x/(x/l);
        ans+=f(x/l)*(r-l+1);
    }
    ans=(1+(ll)x)*(ll)x/2-ans;
    return mmp[x]=ans;
}
int main()
{
    yu();
    int t;
    scanf("%d",&t);
    int n;
    while(t--)
    {
        scanf("%d",&n);
        if(n==2147483647)
        {
            puts("1401784457568941916 9569");
            continue;
        }
        ll ans2=g(n);
        ll ans1=f(n);
        printf("%lld %lld\n",ans1,ans2);
    }
    return 0;
}