a024. 最大公因數(GCD)

ZeroJudge-a024

C語言參考解答

#include<stdio.h>

int main() {
    int p, q;
    scanf("%d %d", &p, &q);
    while (p != 0) {
        if (q > p) {
            int n = p;
            p = q;
            q = n;
        }
        p = p % q;
    }
    printf("%d\n", q);
}

C++參考解答

#include<bits/stdc++.h>
using namespace std;

int main() {
    int p, q;
    cin >> p >> q;
    while (p != 0) {
        if (q > p) {
            int n = p;
            p = q;
            q = n;
        }
        p = p % q;
    }
    cout << q;
}