Square-free integers SPOJ - SQFREE
普通题解
分块优化版(针对于n/(i*i)的分块)(i连续)
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const LL mod=1e9+7;
const LL maxn=1e7+10;
LL prime[maxn],tot,vis[maxn];
LL mu[maxn];
LL n;
void init()
{
tot=0;
mu[1]=1;
for(LL i=2;i<=maxn-5;i++){
if(!vis[i]){
prime[++tot]=i;mu[i]=-1;
}
for(LL j=1;j<=tot&&i*prime[j]<=maxn-5;j++){
vis[i*prime[j]]=1;
mu[i*prime[j]]=-mu[i];
if(i%prime[j]==0){
mu[i*prime[j]]=0;
break;
}
}
}
for(LL i=1;i<=maxn-5;i++){
mu[i]=mu[i-1]+mu[i];
}
}
int main()
{
init();
/*for(LL i=1;i<=10;i++){
printf("%lld ",mu[i]);
}*/
int T;
scanf("%d",&T);
while(T--){
scanf("%lld",&n);
LL res=0;
LL r;
for(LL l=1;l*l<=n;l=r+1){
r=sqrt(n/(n/(l*l)));
res+=((mu[r]-mu[l-1])*(n/(l*l)));
}
printf("%lld\n",res);
}
return 0;
}