HDOJ1108最小公倍数

最小公倍数

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 61302    Accepted Submission(s): 33760

Problem Description

给定两个正整数，计算这两个数的最小公倍数。

 

Input

输入包含多组测试数据，每组只有一行，包括两个不大于1000的正整数.

 

Output

对于每个测试用例，给出这两个数的最小公倍数，每个实例输出一行。

 

Sample Input

10 14

 

Sample Output

70

 基础题

import java.util.Scanner;public class Main{private static Scanner scanner;public static void main(String[] args) {scanner = new Scanner(System.in);while (scanner.hasNext()) {int a = scanner.nextInt();int b = scanner.nextInt();System.out.println(min(a, b));}}private static int min(int a, int b) {if (a < b) {int t = a;a = b;b = t;}int i = 1;while (a * i % b != 0) {i++;}return a * i;}}