最大公约数和最小公倍数

package com.baidu.zhidao;

import java.util.Scanner;

public class GCD_and_LCM {

private static int max, min, temp;

public static void main(String[] args) {

while (true) {

try {

int a, b, gcd, lcm;

System.out.println("Pleasy type in two number! Type in 0 to exit!");

Scanner scanner1 = new Scanner(System.in);

a = scanner1.nextInt();

a = a < 0 ? -a : a;

Scanner scanner2 = new Scanner(System.in);

b = scanner2.nextInt();

b = b < 0 ? -b : b;

if (a == 0 || b == 0){

System.out.println("Exit system success!");

break;

}

gcd = getGCD(a, b);

lcm = (a * b) / gcd;

System.out.println("The two number is: " + a + " and " + b + " ,\nThe greatest common divisor is: "

+ gcd + "\nThe lowest common multiple is: " + lcm);

} catch (Exception e) {

System.out.println("Please typy in a number!");

}

}

}

private static int getGCD(int m, int n) {

if (m > n) {

max = m;

min = n;

} else {

max = n;

min = m;

}

while (min != 0) {

if (max == min) {

return 1;

} else {

temp = max % min;

max = min;

min = temp;

}

}

return max;

}

}