HDU - 2669 Romantic（扩展欧几里得 / 同余方程）

最新推荐文章于 2020-01-11 22:24:58 发布

Error Man

最新推荐文章于 2020-01-11 22:24:58 发布

阅读量166

点赞数 1

分类专栏： # 基础

本文链接：https://blog.csdn.net/no_O_ac/article/details/96445413

版权

基础专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Romantic

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，使得aX+bY=1，若有多组解输出 x 最小的一组

思路：扩展欧几里得。

显然，若 gcd(a,b) != 1，无解。

否则通过扩展欧几里得求得一组特解。

若gcd(a, b) = 1，则方程ax ≡ c (mod b)在[0, b-1]上有唯一解。所以最后 x 只需要再对 b 取模，然后通过 x 求得 y 即可。

AC代码：

#include<bits/stdc++.h>
#define debug(x) cout << "[" << #x <<": " << (x) <<"]"<< endl
#define pii pair<int,int>
#define clr(a,b) memset((a),b,sizeof(a))
#define rep(i,a,b) for(int i = a;i < b;i ++)
#define pb push_back
#define MP make_pair
#define LL long long
#define ull unsigned LL
#define ls i << 1
#define rs (i << 1) + 1
#define INT(t) int t; scanf("%d",&t)

using namespace std;

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

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