877. 扩展欧几里得算法
题目链接https://www.acwing.com/problem/content/description/879/
题目:
拓展资料:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int exgcd(int a,int b,int & x,int &y){
if(!b){
x=1,y=0;
return a;
}
int d=exgcd(b,a%b,y,x);
y-=a/b*x;
return d;
}
int main(){
int n;
int a,b;
cin>>n;
while(n--){
scanf("%d%d",&a,&b);
int x,y;
int d= exgcd(a,b,x,y);
printf("%d %d\n",x,y);
}
return 0;
}
拓展:
大佬的三种讲解https://www.acwing.com/solution/content/1393/