//輸入兩個正整數,求它們的最大公約數和最小公倍數
import java.util.Scanner;
public class Factorization {
public static void main(String[] args) {
Scanner sm = new Scanner(System.in);//輸入
System.out.print("Please enter m:");
int m = sm.nextInt();
Scanner sn = new Scanner(System.in);
System.out.print("Please enter n:");
int n = sn.nextInt();
System.out.printf("m is %d , n is %d .\n",m,n);
int i,temp = 1;//將i聲明於for函數之外退出循環時仍可繼續使用,局部變量temp必須初始化才能使用
for(i=1;i<=m && i<=n;i++) {
if (m%i==0 && n%i==0)
temp = i;
}
System.out.print("The greatest common divisor is :"+temp);
}
}