【HDU 1695 GCD】 懵逼钨丝繁衍

HDU 1695

其实和上一篇博客的题是一样的做法

上篇博客

但是要去重 去重就是把 (1,2),(2,1)去掉 那么你去掉 n和m小的那部分的答案的一半 就是把 (1,2) (2,1)变成一个

因为T只有3000 你暴力跑懵逼钨丝繁衍即可 不需要sqrt(n) + sqrt(m)的复杂度

这个做法的复杂度是 O(T*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 = 100025;
int prime[MAX_N],pcnt,mu[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);
    int t,Case = 0;
    scanf("%d",&t);
    while(t--)
    {
        int n,m,d,a,b;
        scanf("%d%d%d%d%d",&a,&n,&b,&m,&d);
        if(d==0)
        {
            printf("Case %d: 0\n",++Case);
            continue;
        }
        if(n>m) swap(n,m);
        n = n/d,m = m/d;
        ll ans = 0,ans_ = 0;
        for(int i = 1;i<=n;++i)
            ans+=1ll*mu[i]*(n/i)*(m/i);
        for(int i = 1;i<=n;++i)
            ans_+=1ll*mu[i]*(n/i)*(n/i);
        printf("Case %d: %lld\n",++Case,ans-ans_/2);
    }
    //fclose(stdin);
    //fclose(stdout);
    //cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
    return 0;
}