求两个数之间的最大公约数
public class exer14 {
public static void main(String[] args) {
//方法 1
Scanner input=new Scanner(System.in);
System.out.println("Enter first integer : ");
int n1=input.nextInt();
System.out.println("Enter second integer: ");
int n2=input.nextInt();
int gcd=1;
int k=2;
while (k<=n1&&k<=n2)
{
if(n1%k==0&&n2%k==0){
gcd=k;
}
k++;
}
System.out.println("The greatest common divisor for "+n1+" and "+n2+" is "+gcd);
//方法 2
System.out.println("------------方法 2------------");
int d=(n1<n2?n1:n2);
while(true)
{
if(n1%d==0&&n2%d==0)
{
System.out.println("The greatest common divisor for "+n1+" and "+n2+" is "+d);
return;
}
d--;
}
}
}