gcd & exgcd

gcd

int gcd(int a, int b)
{
    if (b == 0)
        return a;
    else
        return gcd(b, a%b);
}

ll gcd(ll a, ll b)
{
    return b == 0 ? a : gcd(b, a%b);
}

exgcd

int exgcd(int a, int b, int &x, int &y) {
	if(b == 0) {
		x = 1;
		y = 0;
		return a;
	}
	int d = exgcd(b, a % b, x, y);
	int t = x;
	x = y;
	y = t - a / b * x;
	return d;
}

例题

Luogu - P1082 [NOIP2012 提高组] 同余方程

//Luogu P1082 exgcd
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll a, b, x, y;
ll exgcd(ll a, ll b, ll &x, ll &y) {
	if(b == 0) {
		x = 1;
		y = 0;
		return a;
	}
	ll d = exgcd(b, a % b, x, y);
	ll t = x;
	x = y;
	y = t - a / b * x;
	return d;
}
int main() {
	cin >> a >> b;
	exgcd(a, b, x, y);
	cout << ((x % b) + b) % b << endl;
	return 0;
}

Luogu - P5656 【模板】二元一次不定方程 (exgcd)

//Luogu P5656 exgcd
#include<bits/stdc++.h>
#define ll long long
using namespace std;
int t;
ll a, b, c, x, y;
ll gcd(ll a, ll b)
{
    return b == 0 ? a : gcd(b, a%b);
}
ll exgcd(ll a, ll b, ll &x, ll &y) {
	if(b == 0) {
		x = 1;
		y = 0;
		return a;
	}
	ll d = exgcd(b, a % b, x, y);
	ll t = x;
	x = y;
	y = t - a / b * x;
	return d;
}
int main() {
	scanf("%d", &t);
	while(t--) {
		scanf("%lld%lld%lld", &a, &b, &c);
		ll d = gcd(a, b);
		if(c % d) {
			printf("-1\n");
			continue;
		}
		a /= d; b /= d; c /= d;
		exgcd(a, b, x, y);
		x *= c; y *= c;
		ll xmin = ((x % b) + b) % b;
		if(!xmin) xmin += b;
		ll ymax = (c - a * xmin) / b;
		ll ymin = ((y % a) + a) % a;
		if(!ymin) ymin += a;
		ll xmax = (c - b * ymin) / a;
		if(ymax <= 0) {
			printf("%lld %lld\n", xmin, ymin);
		} else {
			printf("%lld %lld %lld %lld %lld\n", (xmax - xmin) / b + 1, xmin, ymin, xmax, ymax);
		}
	}
	return 0;
}