https://ac.nowcoder.com/acm/contest/874/L
题解:
https://www.zybuluo.com/yang12138/note/1458963
分k==0,奇,偶讨论!~
总结:
(1)k==0就是n个1相加了;
(2)k为奇数就杜教筛例题了;
(3) 就是求mu的绝对值和;容斥;因为对与p^2的mu数值是0(定义)所以剔除掉0的就行,n/(i*i)就是存在多少个i*i的倍数,他们mu是0所以减掉而mu[i]就是-1所以乘上mu[i];因为mu[1]是1 n/1/1就是相当于ans=n,即全部是1;而对与36==2*2*3*3,就是6*6,而mu[6]==1,36在2*2和3*3时减掉了两次,所以在6时就加回来;有如2*2*3*3*5*5,在2*2,3*3,5*5,2*3*5减了4次,在2*3,2*5,3*5就加了3次,总的就是减一次了;所以就是容斥了;对于4,8,9那些含p^2的是不用算的,mu就是0,相乘相当与没计算了;在sqrt(n)之后的i就没i*i 的倍数了,就枚举到sqrt(n); ( 脑子不好使只能这样理解 :(
顺带总结一下杜教筛:
参考:https://www.cnblogs.com/peng-ym/p/9446555.html
难在构造h(x)和g(x);使得h(x)前n项和好求;其中h(x)=(f*g)
#include<algorithm>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstring>
#include<iostream>
#include<set>
#include<vector>
#include<queue>
#include<cmath>
#include<cstdio>
#include<map>
#include<stack>
#include<string>
#include<bits/stdc++.h>
using namespace std;
#define sfi(i) scanf("%d",&i)
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-16
#define PI acos(-1)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
const int maxn=1e7+9;
const int mod=1e9+7;
inline ll read()
{
ll f=1,x=0;
char ss=getchar();
while(ss<'0'||ss>'9')
{
if(ss=='-')f=-1;ss=getchar();
}
while(ss>='0'&&ss<='9')
{
x=x*10+ss-'0';ss=getchar();
} return f*x;
}
unordered_map<ll,ll>w;
bool check[maxn+10];
int prime[maxn/10];
int mu[maxn+10];
ll sum[maxn+10];
void Mobius(int N)
{
mem(check,0);
mu[1]=1;
int tot=0;
for(int i=2;i<=N;i++)
{
if(!check[i])
{
prime[tot++]=i;
mu[i]=-1;
}
for(int j=0;j<tot;j++)
{
if(i*prime[j]>N) break;
check[i*prime[j]]=true;
if(i%prime[j]==0)
{
mu[i*prime[j]]=0;
break;
}
else
{
mu[i*prime[j]]=-mu[i];
}
}
}
for(int i=1;i<=N;i++) sum[i]=sum[i-1]+mu[i];
}
ll djsmu(ll x)
{
if(x<=8000000) return sum[x];
if(w[x]) return w[x];
ll ans=1;//h(x)前n项和
for(ll l=2,r;l<=x;l=r+1)
{
r=x/(x/l);
ans-=(r-l+1)*djsmu(x/l);
}
w[x]=ans;
return ans;
}
ll n,k;
int main()
{
//FAST_IO;
Mobius(8000000);
int t;
cin>>t;
while(t--)
{
cin>>n>>k;
if(k==0)
{
cout<<n<<endl;
}
else if(k%2)
{
cout<<djsmu(n)<<endl;
}
else
{
ll ans=0;
for(ll i=1;i*i<=n;i++)
{
ans=ans+mu[i]*(n/i/i);
}
cout<<ans<<endl;
}
}
}