BZOJ 3944 Sum

题目在这里呀

前两题结合起来就是这题

（把一些memset都去掉就不T了？！

//Suplex
#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
#define N 2000000+500
#define ll long long
using namespace std;
const int mod=1000007;
const int P=1000000007;
int T,cnt1,cnt2,tot,prime[N],headx[mod+10],heady[mod+10],Nextx[500000],Nexty[1000000];
bool vis[N];
ll n,phi[N],mu[N],tx[1000000],ty[1000000],hashx[1000000],hashy[1000000];

inline void insert1(ll k,ll val){
	int key=k % mod;
	if(key<0) key+=mod;
	for(int i=headx[key];i;i=Nextx[i])
		if(hashx[i]==k) return;
	++cnt1;Nextx[cnt1]=headx[key];headx[key]=cnt1;
	hashx[cnt1]=k;tx[cnt1]=val;
}

inline ll find1(ll k){
	int key=k % mod;
	if(key<0) key+=mod;
	for(int i=headx[key];i;i=Nextx[i])
		if(hashx[i]==k) return tx[i];
	return -1;
}

inline void insert2(ll k,ll val){
	int key=k % mod;
	for(int i=heady[key];i;i=Nexty[i])
		if(hashy[i]==k) return;
	++cnt2;Nexty[cnt2]=heady[key];heady[key]=cnt2;
	hashy[cnt2]=k;ty[cnt2]=val;
}

inline ll find2(ll k){
	int key=k % mod;
	for(int i=heady[key];i;i=Nexty[i])
		if(hashy[i]==k) return ty[i];
	return -1;
}

void pre(){
	phi[1]=1;mu[1]=1;
	for(int i=2;i<N;i++){
		if(!vis[i]){
			prime[++tot]=i;
			phi[i]=i-1;
			mu[i]=-1;
		}
		for(int j=1;j<=tot && (ll)i*prime[j]<N;j++){
			vis[i*prime[j]]=1;
			if(i % prime[j]==0){
				phi[i*prime[j]]=phi[i]*prime[j];
				mu[i*prime[j]]=0;
				break;
			}else 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];
}

ll solve1(ll n){
	if(n<=N) return phi[n];
	ll k=find1(n);
	if(k != -1) return k;
	ll next,ans=n*(n+1)/2;
	for(ll i=2;i<=n;i=next+1){
		ll now=n/i;
		next=n/now;
		ans-=(ll)(next-i+1)*solve1(n/i);
	}
	insert1(n,ans);
	return ans;
}

ll solve2(ll n){
	if(n<=N) return mu[n];
	ll k=find2(n);
	if(k != -1) return k;
	ll next,ans=1;
	for(ll i=2;i<=n;i=next+1){
		ll now=n/i;
		next=n/now;
		ans-=(ll)(next-i+1)*solve2(n/i);
	}
	insert2(n,ans);
	return ans;
}

int main()
{
	pre();
	scanf("%d",&T);
	while(T--){
		cnt1=0;cnt2=0;
		scanf("%lld",&n);
		printf("%lld %lld\n",solve1(n),solve2(n));
	}
	return 0;
}