【BZOJ 1101 Zap】 懵逼钨丝繁衍

BZOJ 1101

$$
\text{答案其实就是求区间内}\underset{i=1}{\overset{n}{\Sigma}}\underset{j=1}{\overset{m}{\Sigma}}\left[ gcd\left( i,j \right) \,\,=\,\,d \right] 
\\
\text{上一篇博文介绍了}\left[ gcd\left( i,j \right) \,\,=\,\,1 \right] \text{的懵逼钨丝如何繁衍}
\\
\text{我们只要同时让}i,j\text{除以一个}d\,\,
\\
\text{式子就变成}\underset{i=1}{\overset{\lfloor \frac{n}{d} \rfloor}{\Sigma}}\underset{j=1}{\overset{\lfloor \frac{m}{d} \rfloor}{\Sigma}}\left[ gcd\left( i,j \right) \,\,=\,\,1 \right] 
\\
\underset{k\,\,=\,\,1}{\overset{\min \left( \lfloor \frac{n}{d} \rfloor ,\lfloor \frac{m}{d} \rfloor \right)}{\Sigma}}\mu \left( k \right) \underset{i=1}{\overset{\lfloor \frac{n}{d} \rfloor}{\Sigma}}\underset{j=1}{\overset{\lfloor \frac{m}{d} \rfloor}{\Sigma}}\left[ k|i \right] \left[ k|j \right] 
\\
\underset{k\,\,=\,\,1}{\overset{\min \left( \lfloor \frac{n}{d} \rfloor ,\lfloor \frac{m}{d} \rfloor \right)}{\Sigma}}\mu \left( k \right) *\lfloor \frac{n}{kd} \rfloor *\lfloor \frac{m}{kd} \rfloor 
\\
\text{继续}\sqrt{n}+\sqrt{m}\text{跑分块求后面的就可以了}
\\
\text{复杂度也是}\left( \sqrt{n}+\sqrt{m} \right) 
$$
 

/*
    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 = 50025;
int prime[MAX_N],pcnt,mu[MAX_N],summ[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&&i*prime[j]<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 i = 1;i<MAX_N;++i)
        summ[i] = summ[i-1] + mu[i];
    int t;
    scanf("%d",&t);
    while(t--)
    {
        int n,m,d;
        scanf("%d%d%d",&n,&m,&d);
        if(n>m) swap(n,m);
        n = n/d,m = m/d;
        ll ans = 0;
        for(int l = 1,r;l<=n;l = r+1)
        {
            r = min(n/(n/l),m/(m/l));
            ans += (summ[r] - summ[l-1])*1ll*(n/l)*1ll*(m/l);
        }
        printf("%lld\n",ans);
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}