【数论】扩展欧几里得算法

#include<iostream>
#include<cstdio>
using namespace std;
inline void exgcd(int a,int b,int c,int &x,int &y,int &p){
if(b==0) {
if(c%a==0) {x=c/a;y=0;}
else p=-1;
}else{
int xx,yy;
exgcd(b,a%b,c,xx,yy,p);
if(p==-1) return;
x=yy;
y=xx-a/b*yy;
}
}
int main(){
int a,b,c;cin>>a>>b>>c;
int x,y,p;
exgcd(a,b,c,x,y,p);
cout<<x<<" "<<y;
}