Euclid Problem/곽세환

~cpp 
#include <iostream>
using namespace std;
#include <climits>
#include <cmath>

long gcd(long p, long q, long *x, long *y)
{
	long x1, y1;
	long g;
	if (q > p)
		return gcd(q, p, y, x);
	if (q == 0)
	{
		*x = 1;
		*y = 0;
		return p;
	}
	g = gcd(q, p % q, &x1, &y1);
	*x = y1;
	*y = (x1 - floor(p / q) * y1);
	return g;
}

int main()
{
	int a, b;
	while (cin >> a >> b)
	{
		/*int u = a, v = b;
		while (v != 0)
		{
			int temp = u % v;
			u = v;
			v = temp;
		}
		int gcd = u;

		int i, j;
		int x = 0, y = 0;

		int a2 = a / gcd;
		int b2 = b / gcd;

		int minsum = INT_MAX - 1;
		
		// ��머���를 ������������ ���떻��� ���보������ ������
		/*while (!(a2 == 1 && b2 == 1))
		{
			int temp1, temp2;
			temp1 = (a2 - 1) / b2;
			y += temp1;
			//x *= temp1;
			a2 = a2 - temp1 * b2;
			temp2 = (b2 - 1) / a2;
			x += temp2;
			y *= temp2;
			b2 = b2 - temp2 * a2;
		}
		//y += 1;

		int min, max;
		if (a2 < b2)
		{
			min = a2;
			max = b2;
		}
		else
		{
			min = b2;
			max = a2;
		}

		// 1������ ��는 배���를 ��������� but �����������
		for (i = 1; ; i++)
		{
			if ((max * i - 1) % min == 0)
			{
				x = -1 * ((max * i - 1) / min);
				y = i;
				break;
			}
			else if ((max * i + 1) % min == 0)
			{
				x = (max * i + 1) / min;
				y = -1 * i;
				break;
			}
		}

		if (a2 == min)	
			cout << x << " " << y << " " << gcd << endl;
		else*/

		// ������ ������ ���는 방��
		long x, y;
		int g = gcd(a, b, &x, &y);

		cout << x << " " << y << " " << g << endl;
	}

	return 0;
}