a024. 最大公因數(GCD) | From: [124.218.214.55] | 發表日期 : 2023-06-19 16:20

#include<iostream>

#include<string>

using namespace std;

void gcd(int, int);

int main()

{

 

int a, b,big,small;

cin >> a >> b;

if (a > b)

big = a, small = b;

else

big = b, small = a;

gcd(big, small);

 

 

 

 

 

 

return 0;

}

void gcd(int big, int small)

{

int r;

 

r = big - small * (big / small);

if (r == 0)

{

cout << small;

 

}

else

{

big = small;

small = r;

gcd(big, small);

}

 

}