HDU 2669 Romantic Extended Euclidean

HDU 2669 Romantic Extended Euclidean
Click Open Link
RomanticTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission (s): 2958 Accepted Submission (s): 1160


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
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 5110 4434 79

Sample Output

2 -3sorry7 -3

Author yifenfei
Source HDU female session Open-who said women are not as good as men?
If all the solutions of x and y are required after x and y are obtained by extending the Euclidean algorithm, the general formula is obtained: (x + k * gx, y-k * gy) gx = B/gcd (a, B), gy = a/gcd (a, B), k is any integer

//15MS228K#include
 
  #include
  
   #include#include
   
    #include
    
     #include
     
      #define M 10007#define inf 0x3f3f3f3f#define ll long longusing namespace std;long long extended_euclidean(long long n, long long m, long long &x, long long &y){    if (m == 0)    {        x = 1;        y = 0;        return n;    }    long long g = extended_euclidean(m, n % m, x, y);    long long t = x - n / m * y;    x = y;    y = t;    return g;}int main(){    ll a,b,x,y;    while(scanf("%I64d%I64d",&a,&b)!=EOF)    {        ll d=extended_euclidean(a,b,x,y);        if(1%d)printf("sorry\n");        else        {            while(x<0){x+=b;y-=a;}            printf("%I64d %I64d\n",x,y);        }    }    return 0;}