Title: enter two positive integers m and N to find their maximum common divisor and minimum common multiple

public class Demo1 {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println(" Please enter the first positive integer ：");
        int i1 = sc.nextInt();
        System.out.println(" Please enter the second positive integer ：");
        int i2 = sc.nextInt();
        // Find the greatest common divisor 
        int min=i1>i2?i2:i1;

        for (int i=min;i>=1;i--){
            if ((i1%i == 0) && (i2%i ==0)){
                System.out.println(" The greatest common divisor is ："+i);
                break;
            }
        }
        // Minimum common multiple 
        int max=i1>i2?i1:i2;
        for (int i=max;i<=i1*i2;i++){
            if (i%i1==0 && i%i2==0){
                System.out.println(" The minimum common multiple is ："+i);
                break;
            }
        }

    }
}