[杜教筛模板] BZOJ 3944 Sum

最新推荐文章于 2022-06-30 11:20:19 发布

里阿奴摩西

最新推荐文章于 2022-06-30 11:20:19 发布

阅读量538

点赞数

分类专栏：莫比乌斯反演&杜教筛

本文链接：https://blog.csdn.net/u014609452/article/details/54747475

版权

莫比乌斯反演&杜教筛专栏收录该内容

38 篇文章 0 订阅

订阅专栏

就是把两道模板题生掰硬凑

骗骗访问量吧

[杜教筛模板] 51Nod 1244 莫比乌斯函数之和

[杜教筛模板] 51Nod 1239 欧拉函数之和

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<tr1/unordered_map>
typedef long long ll;
using namespace std;
using namespace std::tr1;

const int maxn=5000000;
int prime[1000000],num;
int vst[maxn+5]; ll phi[maxn+5]; int miu[maxn+5];
inline void Pre(){
  phi[1]=1; miu[1]=1;
  for (int i=2;i<=maxn;i++){
    if (!vst[i]) prime[++num]=i,phi[i]=i-1,miu[i]=-1;
    for (int j=1;j<=num && (ll)i*prime[j]<=maxn;j++){
      vst[i*prime[j]]=1;
      if (i%prime[j]==0){
	phi[i*prime[j]]=phi[i]*prime[j];
	miu[i*prime[j]]=0;
	break;
      }else{
	phi[i*prime[j]]=phi[i]*phi[prime[j]];
	miu[i*prime[j]]=miu[i]*miu[prime[j]];
      }
    }
  }
  for (int i=1;i<=maxn;i++) phi[i]+=phi[i-1],miu[i]+=miu[i-1];
}

namespace MIU{
  unordered_map<ll,int> S;
  inline int Sum(ll n){
    if (n<=maxn) return miu[n];
    if (S.find(n)!=S.end()) return S[n];
    int tem=1; ll l,r;
    for (l=2;l*l<=n;l++) tem-=Sum(n/l);
    for (ll t=n/l;l<=n;l=r+1,t--)
      r=n/t,tem-=(r-l+1)*Sum(t);
    return S[n]=tem;
  }
}

namespace PHI{
  unordered_map<ll,ll> S;
  inline ll Sum(ll n){
    if (n<=maxn) return phi[n];
    if (S.find(n)!=S.end()) return S[n];
    ll tem=n*(n+1)>>1; ll l,r;
    for (l=2;l*l<=n;l++) (tem-=Sum(n/l));
    for (ll t=n/l;l<=n;l=r+1,t--)
      r=n/t,(tem-=(r-l+1)*Sum(t));
    return S[n]=tem;
  }
}

int main(){
  int Q,n;
  freopen("t.in","r",stdin);
  freopen("t.out","w",stdout);
  Pre();
  scanf("%d",&Q);
  while (Q--){
    scanf("%d",&n);
    printf("%lld %d\n",PHI::Sum(n),MIU::Sum(n));
  }
  return 0;
}