2018.7.13（莫比乌斯+博弈论）

莫比乌斯反演

基础没什么好讲的
就一个式子和一些证明和一些拓展的基础式子

bzoj1101

https://blog.csdn.net/a1035719430/article/details/81036966

bzoj2301

#include<bits/stdc++.h>
using namespace std;
const int maxn = 50100;
int prime[maxn] , miu[maxn] , cnt , sum_m[maxn];
bool flag[maxn];
long long ans;
#define ll long long
int a , b , c , d , k;
int read(){
    int sum = 0;;char c = getchar();
    while(c<'0'||c>'9') c = getchar(); 
    while(c>='0'&&c<='9') sum = sum * 10 + c - 48 , c = getchar();
    return sum;
}
void first(){
    miu[1] = 1;
    for(int i = 2;i <= maxn;++i){
        if(!flag[i])
         prime[++cnt] = i , miu[i] = -1;
        for(int j = 1;j <= cnt&& i * prime[j] <= maxn;++j){
            flag[i * prime[j]] = true;
            if(i % prime[j] == 0) break;
            miu[i * prime[j]] = -miu[i];
        }
    }
    for(int i = 1;i <= maxn;++i)
     miu[i] += miu[i - 1];
    return;
}
long long work(int n,int m){
    if( n > m)swap( n , m );
    long long sum = 0;
    int i = 1;
    while(i <= n / k){
        int j = min( n / ( n / (i*k) ) , m / ( m / (i*k ) ) ) / k;
        sum = sum + 1ll*(miu[j] - miu[i-1]) * (n/(i*k)) * (m/(i*k));
        i = j + 1;
    }
    return sum;
} 
void init(){
    int T = read();
    for(int i = 1;i <= T;++i){
        a = read();b = read();c = read();d = read();k = read();
        ans = work(a-1,c-1) + work(b,d) - work(a-1,d) - work (b,c-1);
        printf("%lld\n",ans);
    }
    return;
}
int main(){
    first();
    init(); 
    k = 1;
    return 0;
} 

bzoj2820

#include<bits/stdc++.h>
using namespace std;
#define ll long long 
const int maxn = 10001000;
int miu[maxn] , prime[maxn] , cnt , f[maxn];
bool flag[maxn];
int n , m;
int read(){
    int sum = 0;;char c = getchar();
    while(c<'0'||c>'9') c = getchar(); 
    while(c>='0'&&c<='9') sum = sum * 10 + c - 48 , c = getchar();
    return sum;
}
void first(){
    miu[1] = 1;
    for(int i = 2;i <= maxn;++i){
        if(!flag[i])
         prime[++cnt] = i , miu[i] = -1;
        for(int j = 1;j <= cnt&& i * prime[j] <= maxn;++j){
            flag[i * prime[j]] = true;
            if(i % prime[j] == 0) break;
            miu[i * prime[j]] = -miu[i];
        }
    }
    for(int i = 1;i <= cnt;++i)
     for(int j = 1;j <= maxn / prime[i];++j)
      f[ prime[i] * j ] += miu[j  ];
    for(int i = 1;i <= maxn;++i)
     f[i] += f[i - 1];
    return;
}
long long solve(){
    if(n > m) swap( n , m );
    long long ans = 0;
    int i = 1;
    while(i <= n){
        int j = min( n / ( n / i ) , m / ( m / i )  );
        ans += 1ll* ( f[j] - f[i - 1] ) * ( n / i ) * ( m / i );
        i = j + 1;
    }
    return ans; 
}
void work(){
    int T = read();
    for(int i = 1;i <= T;++i){
        n = read();m = read();
        printf("%lld\n",solve());
    }
    return;
}
int main(){
    first();
    work();
    return 0;
}

bzoj2440

https://blog.csdn.net/a1035719430/article/details/81037157

博弈论

一般情况博弈论也就考考SG函数什么的了

SG函数