2020牛客暑期多校训练营（第三场）F Two Matchings

2020牛客暑期多校训练营（第三场）F Two Matchings

题意

F Two Matchings
给出a，b，求c / d - e / f = a / b的一个可行解。且d, f < b

做法

如果gcd(a, b)> 1, 一定有解如下 c = a / gcd(a,b) + 1, d = f = b / gcd(a,b),e = 1。
如果b = 1或者为素数，则一定无解。
如果b 只含有一个素因数，比如27 = 3^3,也一定无解。
b 拆分成 d * f， 所以c * f - d * e = a，这里就可以用扩展欧几里得求解。

代码

#include<bits/stdc++.h>
#define ll long long
#define INF 0x3f3f3f3f
#define LLINF 0x3f3f3f3f3f3f3f3f
#define pii pair<int,int>
#define vi vector<int>
#define SZ(x) (int)x.size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
const int N = 2000005;
bool notp[N];
ll prime[N], pnum;
void sieve() {
    memset(notp, 0, sizeof(notp));
    notp[0] = notp[1] = 1;
    pnum = 0;
    for(int i = 2; i < N; i++) {
        if(!notp[i]) prime[++pnum] = i;
        for(int j = 1; j <= pnum && prime[j] * i < N; j++) {
            notp[i *prime[j]] = 1;
            if(i % prime[j] == 0) break;
        }
    }
}
void exgcd(ll a,ll b,ll &g,ll &x,ll &y) {//ax+by=gcd(a,b)=g
    if (b == 0) {
        g = a;
        x = 1;
        y = 0;
        return;
    }
    exgcd(b, a % b, g, y, x);
    y -= (a / b) * x;
}
int main() {
    sieve();
    int t;
    scanf("%d", &t);
    while(t--) {
        ll a, b, c, d, e, f;
        scanf("%lld%lld", &a, &b);
        if(__gcd(a,b) != 1) {
            ll gcd = __gcd(a,b);
            printf("%lld %lld %lld %lld\n", a / gcd + 1, b / gcd, 1, b / gcd);
            continue;
        }
        if(b == 1 || notp[b] == 0) {
            printf("-1 -1 -1 -1\n");
            continue;
        }
        ll tmp = b;
        d = 1;
        for(int i = 1; i <= pnum; i++) {
            if(tmp == 1) break;
            if(tmp % prime[i] == 0) {
                while(tmp % prime[i] == 0) {
                    tmp /= prime[i];
                    d *= prime[i];
                }
                break;
            }
        }
        f = tmp;
//      cout << f << " " << d << '\n';
        if(tmp == 1) { // x^n
            printf("-1 -1 -1 -1\n");
        }
        else {
            ll g;
            exgcd(f, d, g, c, e); // cf - de = a
            if(a % g) {
                printf("-1 -1 -1 -1\n");
                continue;
             }
            c *= (a / g);
            e *= (a / g);
            if (c < 0 && e > 0)
                printf("%lld %lld %lld %lld\n", e, f, -c, d);
            else
                printf("%lld %lld %lld %lld\n", c, d, -e, f);
        }
    }
}