HDU 2669 Romantic [扩展欧几里得]

Description

The Sky is Sprite. 
The Birds is Fly in the Sky. 
The Wind is Wonderful. 
Blew Throw the Trees 
Trees are Shaking, Leaves are Falling. 
Lovers Walk passing, and so are You. 
................................Write in English class by yifenfei 

 

Girls are clever and bright. In HDU every girl like math. Every girl like to solve math problem! 
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

题目大意：给出a b ， 让你找出非负x 和 y（y可负数） ， 让 a*x + b*y = 1 ; 

题解：记得要判断x 和 y ， 

AC代码：

#include <iostream>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long

using namespace std ;
long long  gcd (ll a , ll b )
{
    if(a%b==0) return b ;
    else return gcd(b,a%b);
}
void extend_gcd(ll a , ll b , ll &x , ll &y)
{
    if(b==0)
    {
        x = 1 ;
        y = 0 ;
        return ;
    }

    extend_gcd(b,a%b,x,y);
    int r = x;
    x = y ;
    y = r - (a/b)*y;
}
int main()
{
    ll a , b , n , t ;
    while(cin>>a>>b)
    {
        ll x , y ;
        extend_gcd(a,b,x,y);
        if(x*a+y*b == 1)
        {
            while(x<0)
            {
                x+=b;
                y-=a;
            }
            cout<<x<<" "<<y<<endl;
        }
        else cout<<"sorry"<<endl;
    }
    return 0 ;
}