C++ 实现gcd，拓展欧几里得算法，和最小公倍数

里面的核心公式是由数学公式推导来的，具体可自行查阅

#include <iostream>
#include <stdio.h>
using namespace std;
int exgcd(int a, int b, int &x, int &y)
{
	if (b == 0)
	{            //1的情况
		x = 1;
		y = 0;
		return a;
	}
	int r = exgcd(b, a%b, x, y);
	int t = y;
	y = x - (a / b)*y;     //2的情况。这是由公式简化来的
	x = t;
	return r;
}
int gcd(int a, int b) {
	if (b == 0)
		return a;
	else
		return gcd(b, a%b);
}
int multiple(int a, int b) {
	return a * b / gcd(a, b);//这是求最小公倍数的公式
}
int main()
{
	int x, y,i,k=0;
	cout << "intput first number" << endl;
	cin >> i;
	cout << "intput second number" << endl;
	cin >> k;
	exgcd(i, k, x, y);
	cout << "x=" << x << " " << "y=" << y << " " << endl;
	cout << "The maximum common factor is: " <<gcd(i, k)<<endl;
	cout << "The least common multiple is: " <<multiple(i, k);
}