4.3-Greatest_Common_Divisor_Lab

程式碼:

#include <iostream>
using namespace std;
int gcd(int a, int b)
{
 while ((a %= b) != 0 && (b %= a) != 0);
 return a + b;
}
int main() {
 int a, b;
 while (cin >> a >> b)
 {
  cout << gcd(a, b) << endl;
 }
    return 0;
}