import java.util.Scanner;

public class GCD_LCM{
	public static void main( String args[]){
		Scanner s = new Scanner (System.in);
		System.out.println("========计算两个数的最小公倍数========");
		System.out.println("==============输入0 0结束=============");
		int i=1;
		while(true){
			System.out.println("Case "+i+":\n请输入两个整数:");
			int a = s.nextInt();
			int b = s.nextInt();
			if(a==0 && b==0) break;
			int m = gcd(a,b);
			int n = a*b/m;
			System.out.println("最小公倍数为:"+n+"\n");
			i++;
		}
		System.out.println("===============输入结束===============");
	}
	public static int gcd(int a, int b){
		if (b != 0) return gcd(b,a%b);
		else return a;
	}
}

  

相关文章:

  • 2021-12-25
  • 2022-12-23
  • 2021-11-27
  • 2021-04-04
  • 2022-12-23
猜你喜欢
  • 2021-11-04
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2021-12-29
  • 2022-12-23
  • 2022-12-23
相关资源
相似解决方案