做法:
- 通过打表找规律,我们发现所有情况可以分为三类。我们把一个n 设为 n = p^k * x (p为质数),这里的x可能为质数也可能为合数
- 注:如果x与p互质,满足积性函数的性质,f[n] = f[p]*f[x]
- 筛法:
- 1.f[p] = 2 ,f[p^2] = 1
- 2.若i % p!=0,f[i * p] = f[i] * f[p] 积性函数
- 3.若i % (p * p) == 0,则i*p 中 p的幂>2,这时f[i * p] = 0
- 否则i % p == 0,则i*p中p的幂 = 2,我们设i = m*p 即 f[i * p] = f[m*p^2] = f[m]*f[p^2] = f[m] = f[i / p]
AC代码:
#include<bits/stdc++.h>
#define IO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define rep(i,s,t) for(int i = (int)(s); i <= (int)(t); i++)
#define rev(i,t,s) for(int i = (int)(t); i >= (int)(s); i--)
#define pb(x) push_back(x)
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x).size()
using namespace std;
typedef long long ll;
const int mod = 1e9+7;
const double PI = 4*atan(1.0);
const int maxm = 1e5+5;
const int maxn = 2e7+5;
const int INF = 0x3f3f3f3f;
int prime[maxn];
int f[maxn];
int sum[maxn];
bool vis[maxn];
int tot;
void table()
{
f[1] = 1;
for(int i=2;i<maxn;i++){
if(!vis[i]){
prime[tot++] = i;
f[i] = 2;
}
for(int j=0;j<tot && i*prime[j]<maxn;j++){
vis[i*prime[j]] = true;
int res = i*prime[j];
if(i%prime[j]) f[res] = f[prime[j]]*f[i]; //积性函数
else{
if(i%(prime[j]*prime[j]) == 0) f[i*prime[j]] = 0;
else f[res] = f[res/(prime[j]*prime[j])];
break;
}
}
}
for(int i=1;i<maxn;i++) sum[i] = sum[i-1]+f[i];
}
int main()
{
#ifdef LOCAL_FILE
freopen("in.txt","r",stdin);
#endif // LOCAL_FILE
int t;
table();
scanf("%d",&t);
while(t--)
{
int n;scanf("%d",&n);
printf("%d\n",sum[n]);
}
return 0;
}