两个数的最大公约数 向右看齐 2022-07-11 13:41 142阅读 0赞 package Third; import java.util.Scanner; public class Demo3 { /* * 两个数的最大公约数 */ public static void main(String[] args) { // TODO Auto-generated method stub Scanner input = new Scanner(System.in); System.out.println("Please enter first integer:"); int n1 = input.nextInt(); System.out.println("Please enter second integer:"); int n2 = input.nextInt(); int gcd = 1; int k = 2; while(k <= n1 && k <= n2){ if(n1 % k == 0 && n2 % k == 0) gcd = k; k++; } System.out.println("The greatest common divisor for " + n1 + " and " + n2 + " is " + gcd); } }
还没有评论,来说两句吧...