洛谷P2257 YY的GCD 懵逼乌斯繁衍

P2257

题意T组 输入 n m 求1 - n之间 与 1 - m之间gcd为质数的数

我们知道gcd 有性质 d|(gcd(a,b)) 则 d|a d|b

第一道懵逼钨丝学的别人做法是这样推的

$$
f\left( gcd\left( a,b \right) \right) \,\,
\\
f\left( x \right) \,\,=\,\,\underset{d|gcd\left( a,b \right)}{\Sigma}g\left( d \right) \,\,=\,\,\underset{d|a,d|b}{\Sigma}g\left( d \right) 
\\
f\left( x \right) \,\,=\,\,\mid_{\text{0 }x\text{不是素数}}^{\text{1 }x\text{是素数}}
\\
f\,\,=\,\,\text{1*}g
\\
g\,\,=\,\,\mu \,\,* f
\\
g\left( x \right) \,\,=\,\,\underset{d|x}{\Sigma}\mu \left( \frac{x}{d} \right) \left[ d\text{是素数} \right] \,\,=\,\,\underset{p|x}{\Sigma}\mu \left( \frac{x}{p} \right) 
$$

然后可以这样求 g(x)

    for(int j = 0;j<pcnt;j++)
    {
        for(int p = prime[j],i = 1;i*p<MAX_N;i++)
            g[i*p] += mu[i];
    }

$$
\underset{i\,\,=\,\,1}{\overset{n}{\Sigma}}\underset{j=1}{\overset{m}{\Sigma}}\left[ gcd\left( i,j \right) \right] \,\,=\underset{i\,\,=\,\,1}{\overset{n}{\Sigma}}\underset{j=1}{\overset{m}{\Sigma}}\underset{d|i,d|j}{\Sigma}g\left( d \right) 
\\
=\underset{d=1}{\overset{\min \left( n,m \right)}{\Sigma}}g\left( d \right) \underset{i\,\,=\,\,1}{\overset{n}{\Sigma}}\underset{j=1}{\overset{m}{\Sigma}}\left[ d|i \right] \left[ d|j \right] \,\,
\\
=\underset{d=1}{\overset{\min \left( n,m \right)}{\Sigma}}g\left( d \right) *\lfloor \frac{n}{d} \rfloor *\lfloor \frac{m}{d} \rfloor 
$$



下面的可以用 O(sqrt(m)+sqrt(n)) 分块求出来 这题就出来了

/*
    if you can't see the repay
    Why not just work step by step
    rubbish is relaxed
    to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;

#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))

typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod =  (int)1e9+7;

ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
const int MAX_N = 10000025;
int pcnt,prime[MAX_N],mu[MAX_N],g[MAX_N];
ll sumg[MAX_N];
bool vis[MAX_N];
void sieve(int n)
{
    mu[1] = 1;
    for(int i = 2;i<n;++i)
    {
        if(!vis[i])
        {
            prime[pcnt++] = i;
            mu[i] = -1;
        }
        for(int j = 0;j<pcnt&&prime[j]*i<n;j++)
        {
            int k = i * prime[j];
            vis[k] = true;
            if(i%prime[j]==0)
            {
                mu[k] = 0;
                break;
            }
            mu[k] = -mu[i];
        }
    }
}


int main()
{
    //ios::sync_with_stdio(false);
    //freopen("a.txt","r",stdin);
    //freopen("b.txt","w",stdout);
    sieve(MAX_N);
    for(int j = 0;j<pcnt;j++)
    {
        for(int p = prime[j],i = 1;i*p<MAX_N;i++)
            g[i*p] += mu[i];
    }
    for(int i = 1;i<MAX_N;++i)
        sumg[i] = sumg[i-1] + 1ll*g[i];
    int t,n,m,minn;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d%d",&n,&m);
        if(n>m) swap(n,m);
        ll ans = 0;
        for(int l = 1,r;l<=n;l=r+1)
        {
            r = min(n/(n/l),m/(m/l));
            ans+=1ll*(n/l)*(m/l)*(sumg[r]-sumg[l-1]);
        }
        printf("%lld\n",ans);
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}