查找两个数的最大公约数——欧几里得算法

import java.util.Scanner;

public class Main 
{
    public static void main(String[] args)
    {
        //这里输入的a,b均是大于0的。
        Scanner cin = new Scanner(System.in);
        while(cin.hasNext())
        {
            int a = cin.nextInt();
            int b = cin.nextInt();
            int c = Math.min(a, b);
            a = Math.max(a, b);
            b = c;
            while(b != 0)
            {
                c = a%b;
                a = b;
                b = c;
            }
            System.out.println(a);
        }
    }
}