输入两个正整数m和n，求其最大公约数和最小公倍数。

import java.util.Scanner;

public class Algorithm_Game_06 {
public static void main(String[] args) {
Scanner s = new Scanner(System.in);
int m = s.nextInt();
int n = s.nextInt();
System.out.println("最大公约数:"+f(m, n));
System.out.println("最小公倍数:"+m(m, n));
}
public static int f(int m,int n){
int c = m%n;
return c==0? n: f(n,c);
}
public static int m(int m,int n){
return (m*n/f(m,n));
}
}