扩展欧几里得算法

扩展欧几里得算法

扩展欧几里得算法可以先看一下贝祖定理；算法核心是递归

#include <iostream>
using namespace std;
void fun(int a, int b, int* x, int* y);
int main()
{
	int x, y;
	fun(47, 30,&x, &y);
	cout << x << " " << y;
}

void fun(int a, int b, int* x, int* y)
{
	int x1, y1;
	if (a%b == 0)
	{
		*x = 0, *y = 1;
		return;
	}
	else
	fun(b, a%b, &x1, &y1);
	*x = y1;
	*y = x1 - a / b * (y1);
	return;
}