Romantic——扩展欧几里得

Now tell you two nonnegative integer a and b. Find the nonnegative integer X and integer Y to satisfy X*a + Y*b = 1. If no such answer print "sorry" instead.

Input

The input contains multiple test cases.
Each case two nonnegative integer a,b (0<a, b<=2^31)

Output

output nonnegative integer X and integer Y, if there are more answers than the X smaller one will be choosed. If no answer put "sorry" instead.

Sample Input

77 51 10 44 34 79

Sample Output

2 -3 sorry 7 -3

 

模板 

注意递归调用的x和y是要传地址的！！！

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

ll gcd(ll a,ll b,ll &x,ll &y){
	if(b==0){
		x=1;y=0;
		return a;
	}
	ll r=gcd(b,a%b,x,y);
	ll tmp=x;
	x=y;
	y=tmp-a/b*y;
	return r;
}

int main()
{
    ll a,b,x,y;
    while(cin>>a>>b){
    	if(gcd(a,b,x,y)==1){
    		if(x<0) x+=b,y-=a;
    		cout << x <<" " << y <<endl;
		}else cout<< "sorry" <<endl;
	}
    return 0;
}