Codeforces div.2 D. Madoka and the Best School in Russia

题意：给定两个数，一个good数可以表示为d的倍数但是不能表示为d^2的倍数，要求x能否由两种以上的方式用至少一个good数表示出来

思路：数学表示x=a1+a2+a3+...+an其中ai为good数，很简单的想到分解约数，由于约数的最大个数也不超过1600个，于是想到用dp暴力求解

dp [id[factor[i]*factor[j]]]+=dpi+dpj(需满足x=factor[i]*factor[j]，且factor[i]%d==0&&factor[i]%(i*i)==0)

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string>
#include<bitset>
#include<cmath>
#include<array>
#include<atomic>
#include<sstream>
#include<stack>
#include<iomanip>
//#include<bits/stdc++.h>

//#define int ll
#define IOS std::ios::sync_with_stdio(false);std::cin.tie(0);
#define pb push_back
#define endl '\n'
#define x first
#define y second
#define Endl endl
#define pre(i,a,b) for(int i=a;i<=b;i++)
#define rep(i,b,a) for(int i=b;i>=a;i--)
#define si(x) scanf("%d", &x);
#define sl(x) scanf("%lld", &x);
#define ss(x) scanf("%s", x);
#define YES {puts("YES");return;}
#define NO {puts("NO"); return;}
#define all(x) x.begin(),x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, PII> PIII;
typedef pair<char, int> PCI;
typedef pair<int, char> PIC;
typedef pair<double, double> PDD;
typedef pair<ll, ll> PLL;
const int N = 200010, M = 2 * N, B = N, MOD = 998244353;
const double eps = 1e-7;
const int INF = 0x3f3f3f3f;
const ll LLINF = 0x3f3f3f3f3f3f3f3f;

//int dx[4] = { -1,0,1,0 }, dy[4] = { 0,1,0,-1 };
int n, m, k;
int prime[N], countNum;
bool st[N];
int factor[N], tot;
int id[N], gid[N];
int dp[N];

ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lowbit(ll x) { return x & -x; }
ll qmi(ll a, ll b, ll MOD) {
    ll res = 1;
    while (b) {
        if (b & 1) res = res * a % MOD;
        a = a * a % MOD;
        b >>= 1;
    }
    return res;
}

inline void init() {}

void slove()
{
    memset(dp, 0, sizeof dp);

    int x, d;
    cin >> x >> d;
    map<int, int> mapp;
    tot = 0;
    for (int i = 1; i <= x/i; i++)
    {
        if (x % i == 0)
        {
            if (i * i == x)factor[++tot] = i;
            else factor[++tot] = i, factor[++tot] = x / i;
        }
    }

    sort(factor + 1, factor + 1 + tot);

    for (int i = 1; i <= tot; i++)
    {
        if (factor[i] <= 1e5) id[factor[i]] = i;
        else gid[x / factor[i]] = i;
    }
    for (int i = 1; i <= tot; ++i) mapp[factor[i]] = i;

    dp[1] = 1;
    for (int i = 1; i <= tot; i++)
    {
        int f1 = factor[i];
        if (f1 % d == 0 && f1 % (d * d) != 0)
        {
            for (int j = 1; j <= tot; j++)
            {
                int f2 = factor[j];
                if ((x / f1) % f2 == 0)
                {
                    int fact = f1 * f2;
                    int y = (fact <= 1e5) ? id[fact] : gid[x / fact];
                    //int y = mapp[fact];
                    dp[y] = min(dp[y] + dp[j], 2);
                }
            }
        }
    }
    if(dp[tot]>=2)YES
    else NO
}

signed main()
{
    //IOS;
    int _ = 1;
    si(_);
    init();
    while (_--)
    {
        slove();
    }
    return 0;
}
/*
5 6
1 2 1 3
1 3 2 5
2 3
2 5
1 5 0 6
2 5

*/