计算“两个整数的最大公约数”程序

package mypackage;

import java.io.*;
import java.util.*;

public class gcd {

public static void main(String[] args) throws Exception {
// TODO Auto-10generated method stub
Scanner cin=new Scanner(System.in);
System.out.print("Input the first number: ");
int n=cin.nextInt();
System.out.print("Input the second number: ");
int m=cin.nextInt();
int k=GCD(n,m);
System.out.print("The gcd("+n+","+m+") is :"+k);

}

public static int GCD(int a,int b){
while(true){
if((a=a%b)==0) return b;
if((b=b%a)==0) return a;
}
}

}