publicclassPractice{publicstaticvoidmain(String[] args){
Scanner sc =newScanner(System.in);
System.out.println("请输入两个数:");int n = sc.nextInt();int m = sc.nextInt();int max = n > m ? n : m;int min = n < m ? n : m;
System.out.println(max);
System.out.println(min);
System.out.println("最大公约数是:"+gy(max, min));
System.out.println("最小公倍数是:"+ max * min /gy(max, min));}publicstaticintgy(int max,int min){//辗转相除 求余数int yu =0;while(max % min !=0){
yu = max % min;
max = min;
min = yu;}return min;}}
输入两个正整数m和n,求其最大公约数和最小公倍数。(java)代码如下:public class Practice { public static void main(String[] args) { Scanner sc = new Scanner(System.in); int max = sc.nextInt(); int min = sc.nextInt(); max = max > min ? max : min;