Problem 2669

　　　　　　　　　　　　　　　　Romantic

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

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

 

Author

yifenfei

 

Source

HDU女生专场公开赛——谁说女子不如男

 

Recommend

lcy

 

Statistic | Submit | Discuss | Note

Home | Top

Hangzhou Dianzi University Online Judge 3.0 Copyright © 2005-2017 HDU ACM Team. All Rights Reserved. Designer & Developer: Wang Rongtao LinLe GaoJie GanLu Total 0.000000(s) query 1, Server time : 2017-08-09 15:18:23, Gzip enabled

Administration

思路：

裸的拓展欧几里得求乘法逆元   好像不开long long会wa掉

代码：

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
long long t,a,b,x,y,gcd;
long long exgcd(long long a,long long b,long long &x,long long &y)
{
    )
    {
        x=,y=;
        return a;
    }
    long long r=exgcd(b,a%b,x,y),tmp;
    tmp=x,x=y,y=tmp-a/b*y;
    return r;
}
int main()
{
    while(~scanf("%lld%lld",&a,&b))
    {
        gcd=exgcd(a,b,x,y);x%=b;
        ) printf("sorry\n");
        ) x+=b/gcd;   y=(-a*x)/b; printf("%lld ",x);printf("%lld\n",y);}
    }
    ;
}