#include<cstdio>
#include<tr1/unordered_map>
using namespace std;
using namespace std::tr1;
typedef long long ll;
typedef unsigned long long ull;
const int N=5e6,Max=2147483647;
template<class T>void rd(T &x)
{
x=0;ll f=0;char ch=getchar();
while(ch<'0'||ch>'9') {f|=(ch=='-');ch=getchar();}
while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=getchar();}
x=f?-x:x;
return;
}
ll phi[N+5];int mu[N+5];
int is[N+5],prime[N+5];
void init()
{
phi[1]=1,mu[1]=1;int tot=0;
for(int i=2;i<=N;++i)
{
if(!is[i]) prime[++tot]=i,phi[i]=i-1,mu[i]=-1;
for(int j=1;j<=tot&&(ll)i*prime[j]<=N;++j)
{
is[i*prime[j]]=1;
if(i%prime[j]==0)
{
phi[i*prime[j]]=phi[i]*prime[j];
mu[i*prime[j]]=0;
break;
}
phi[i*prime[j]]=phi[i]*(prime[j]-1);
mu[i*prime[j]]=-mu[i];
}
}
for(int i=2;i<=N;++i)
phi[i]+=phi[i-1],mu[i]+=mu[i-1];
}
unordered_map<int,ll>ans_mu,ans_phi;//map会T
inline ll f_mu(int n){
if(n<=N) return mu[n];
if(ans_mu[n]) return ans_mu[n];
ll res=1ll;//f*g=mu*I=e;
for(int l=2,r;l<=n&&r<Max;l=r+1)//开ll会T r<Max防止l=r+1,l爆int
r=n/(n/l),res-=(r-l+1)*f_mu(n/l);
return ans_mu[n]=res;
}
inline ll f_phi(int n){
if(n<=N) return phi[n];
if(ans_phi[n]) return ans_phi[n];
ll res=(ull)n*(n+1)/2;//f*g=phi*I=id;
for(int l=2,r;l<=n&&r<Max;l=r+1)
r=n/(n/l),res-=(r-l+1)*f_phi(n/l);
return ans_phi[n]=res;
}
int main(){
init();
int T;rd(T);
while(T--){
int n;rd(n);
printf("%lld %lld\n",f_phi(n),f_mu(n));
}
}
P4213(杜教筛模板)
最新推荐文章于 2022-11-11 12:42:19 发布