- 【模板】二元一次不定方程 (exgcd)
exgcd模板
- @ 2026-8-5 9:28:15
ll exgcd(ll a, ll b, ll &x, ll &y) {
if (b == 0) {
x = 1, y = 0;
return a;
}
ll xx, yy;
ll g = exgcd(b, a % b, xx, yy);
x = yy, y = xx - a / b * yy;
return g;
}
void solve(){
// 3x + 2y = 1
ll x, y;
ll g = exgcd(3, 2, x, y);
cout << " g = " << g << " x = " << x << " y = " << y << '\n';
// 期望 g = 1,且 3*x + 2*y = 1
}
0 条评论
目前还没有评论...
信息
- ID
- 556
- 时间
- ms
- 内存
- MiB
- 难度
- 6
- 标签
- 递交数
- 29
- 已通过
- 11
- 上传者