HDU2669 Romantic 扩展欧几里得原理

Romantic

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

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 Xa + Yb = 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，找出符合a×X+b×Y=1的最小非负整数X，以及对应的Y值并输出。

问题分析

显然利用扩展欧几里得原理。
因为a×X+b×Y=k×gcd(a,b),是方程有解的充要条件，所以对于本题，有k取1，gcd(a,b)也要等于1.
所以通过扩展欧几里得算法，可以找到gcd(a,b)，判断是否为1，如果不为1则不可能有答案；否则，一定有。但是题目要求输出最小的非负整数X，通过这种方法，有时得到的X可能是负数，所以还要再处理一下。
每次对X+=b,相应的Y-=a，直到X>=0，这样就解决了。

c++程序如下

#include<iostream>
#include<cstdio>
using namespace std;
int ex_gcd(int a, int b, int &x, int &y)
{
	if (b == 0)
	{
		x = 1;
		y = 0;
		return a;
	}
	int x2, y2, v;
	v=ex_gcd(b, a%b, x2, y2);
	x = y2;
	y = x2 - (a / b)*y2;
	return v;
}
int main()
{
	int a, b;
	while (scanf_s("%d %d", &a, &b) != EOF)
	{
		int x, y, v;
		v = ex_gcd(a, b, x, y);
		if (v != 1) printf("sorry\n");
		else
		{
			while (x < 0)
			{
				x += b;
				y -= a;
			}
			printf("%d %d\n", x, y);
		}
	}
	return 0;
}