歐幾裡得求最大公約數算法（輾轉相除）

/*輾轉相除*/
#include <iostream>
#include <cstdio>

using namespace std;

int Gcd(int a, int b)
{
    int r = a % b;
    while(r != 0){
        a = b;
        b = r;
        r = a%b;
    }
    return b;
}

int main()
{
    int num1, num2;
    scanf("%d%d", &num1, &num2);
    cout << "最大公約數：" << Gcd(num1, num2) << endl;
}