[zerojudge] a024 最大公因數(GCD)

題目：https://zerojudge.tw/ShowProblem?problemid=a024
說明：數學問題，用輾轉相除法找出最大公因數，Python 中原來 function 後習慣空兩行。

Java 版

import java.util.Scanner;

public class A024 {

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

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNext()) {
            int a = in.nextInt();
            int b = in.nextInt();
            System.out.println(gcd(a, b));
        }
    }
}

Python 版 (2022.07)

def gcd(m, n):
    while n != 0:
        r = m % n
        m = n
        n = r
    return m


a, b = map(int, input().split(' '))
print(gcd(a, b))