关于莫比乌斯函数的塞 ： 莫比乌斯前n项和 ， 莫比乌斯函数绝对值的前n项和

https://ac.nowcoder.com/acm/contest/874#submit/{%22problemIdFilter%22%3A25455%2C%22statusTypeFilter%22%3A%225%22}

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<map>
using namespace std;
#define CLR(a,b) memset((a),(b),sizeof((a)))
typedef long long ll;
const int N = ;
bool check[N+];
int prime[N+],tot;
int mu[N+];
ll mu_sum[N+];
void Moblus(){
    CLR(check, false);
    mu[] = ;
     tot = ;
    for(int i = ; i <= N; i++){
        if( !check[i] ){
            prime[tot++] = i;
            mu[i] = -;
        }
        for(int j = ; j < tot && i*prime[j] <= N; j++){
            check[i * prime[j]] = true;
            if( i % prime[j] == ){
                mu[i * prime[j]] = ;
                break;
            }
            else
                mu[i * prime[j]] = -mu[i];
        }
    }
    mu_sum[]=;
    for(int i = ; i <= N; ++i){
        mu_sum[i] = mu_sum[i-] + mu[i];

    }

}
map<ll,ll> mp;
ll Mertens(ll n){
    if(n <= N) return mu_sum[n];
    if(mp.count(n)) return mp[n];
    ll ans = , ed;
    for(ll i = ; i <= n; i = ed+){
        ed = n/(n/i);
        ans -= (ed - i + )*Mertens(n/i);
    }
    return mp[n] = ans;
}

int main(){

    Moblus();
    for(int i= ; i<= ; i++)
        printf("%d ",mu[i]);
    int ncase;
    scanf("%d",&ncase);
    while(ncase--){

            mp.clear();
    ll a,k;
    scanf("%lld%lld", &a, &k);

    if(k==){
        printf("%lld\n",a);
        continue;
    }
    if(k%){
    printf("%lld\n", Mertens(a) );
    continue;

    }
    else{
          ll ans=;
          ll t=sqrt(a);
          for(int i= ; i<= t; i++)
          {
                ll T=a/i;
                T/=i;
                ans+=mu[i]*T;

          }
        printf("%lld\n",ans);
    }

    }
    return ;
}