大数据不对，交上去还会RE

#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e6+5;
bool pri[N];
long long sp[N];
int T,n,cnt,mu[N],phi[N],sm[N],p[N];
map<int,long long>msp;
map<int,int>msm;
long long getsp(int x){
	if(x<2000000)return sp[x];
	if(msp[x])return msp[x];
	long long res=0;
	for(int l=2,r;r<=x;l=r+1){
		r=min(x,x/(x/l));
		res+=1ll*(r-l+1)*getsp(x/l);
	}
	return msp[x]=1ll*x*(x+1ll)/2ll-res;
}
int getsm(int x){
	if(x<2000000)return sm[x];
	if(msm[x])return msm[x];
	int res=0;
	for(int l=2,r;r<=x;l=r+1){
		r=min(x,x/(x/l));
		res+=1ll*(r-l+1)*getsm(x/l);
	}
	return msm[x]=1-res;
}
signed main(){
	phi[1]=mu[1]=1;
	for(int i=2;i<N;i++){
		if(!pri[i])phi[i]=i-1,mu[i]=-1,p[++cnt]=i;
		for(int j=1;j<=cnt&&i*p[j]<N;j++){
			pri[i*p[j]]=1;
			if(i%p[j]==0){
				phi[i*p[j]]=phi[i]*p[j]; 
				break;
			}
			else{
				phi[i*p[j]]=phi[i]*phi[p[j]];
				mu[i*p[j]]=-mu[i];
			}
		}
	}
	for(int i=1;i<N;i++){
		sp[i]=sp[i-1]+phi[i];
		sm[i]=sm[i-1]+mu[i];
	}
	for(cin>>T;T;T--){
		scanf("%lld",&n);
		printf("%lld %lld\n",getsp(n),getsm(n));
	}
	return 0;
}