求N多特最大公约数和最小公倍数 //多个正整数的最大公约数和最小公倍数 int a,b,n; int c = 0; int[] m = new int[100]; Scanner cin = new Scanner(System.in); System.out.println("正整数N"); n = cin.nextInt(); System.out.println("输入数据"); for(int i=0;i<n;i++){ m[i] = cin.nextInt(); } b = m[0]; for(int k=1;k<n;k++){ a = m[k]; if(a<b){ c = a; a = b;b = c; } int r = a%b; while(r!=0){ a = b; b =r; r = a%b; } } for(int k=0;k<n;k++){ System.out.print(m[k]+","); } System.out.println("="+b); b = m[0]; for(int k=1;k<n;k++){ a = m[k]; if(a<b){ c = a;a = b;b = c; } for(c=a;c<=a*b;c=c+a) if(c%b==0)break; b = c; } for(int k=0;k<n;k++){ System.out.print(m[k]+","); } System.out.println("="+c); //两个正整数的最大公约数和最小公倍数 /*Scanner cin = new Scanner(System.in); int n = cin.nextInt(); int m = cin.nextInt(); if(a<b){ int c = n; n = m; m = c; } int r = n%m; while(r!=0){ n=m; m=r; r=n%m; } System.out.println(m);*/