题目:输入两个正整数m和n,求其最大公约数和最小公倍数。
代码如下:
public class gys{
public static void main(String ar[]) {
Scanner scanner = new Scanner(System.in);
System.out.print("input num1: ");
int n = scanner.nextInt();
System.out.print("input num2: ");
int m = scanner.nextInt();
int n1 = n;
int m1 = m;
int t;
// 交换m,n位置
if (m < n){
t = m;
m = n;
n = t;
}
t = m % n;
while (t != 0){
m = n;
n = t;
t = m % n;
}
System.out.println("最大公约数为:"+ n);
System.out.println("最大公约数为:"+ m1*n1/n);
}
}