hdu 2669 Romantic

Romantic

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11458    Accepted Submission(s): 4825

Problem 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

#include<iostream>
#include<string.h>
#include<math.h>
#define max 0x3f3f3f3f
#define ll long long
#define mod 1000000007
using namespace std;
ll x,y;
ll gcd(ll a,ll b)
{
    return b==0?a:gcd(b,a%b);
}
void exgcd(ll a, ll b, ll &x, ll &y)    //拓展欧几里得
{
    if(!b) 
        x = 1, y = 0;
    else
    {
        exgcd(b, a % b, y, x);
        y -= x * (a / b);
    }
}


int main()
{
    ll a,b,r,s;
    while(~scanf("%lld%lld",&a,&b))
    {
        exgcd(a,b,x,y);
        r=gcd(a,b);
        s=b/r;
        x=x/r;
        x=(x%s+s)%s;
        y=(1-a*x)/b;
       if(r!=1)
           printf("sorry\n");
       else
           printf("%lld %lld\n",x,y);
    }
    return 0;
}