Problem:
Score : 300 points

Problem Statement

Takahashi is organizing a party.

At the party, each guest will receive one or more snack pieces.

Takahashi predicts that the number of guests at this party will be A or B.

Find the minimum number of pieces that can be evenly distributed to the guests in both of the cases predicted.

We assume that a piece cannot be divided and distributed to multiple guests.

Constraints

1 \leq A, B \leq 10^5

A \neq B

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B

Output

Print the minimum number of pieces that can be evenly distributed to the guests in both of the cases with A guests and B guests.

Sample Input 1

2 3

Sample Output 1

6

When we have six snack pieces, each guest can take three pieces if we have two guests, and each guest can take two if we have three guests.

Sample Input 2

123 456

Sample Output 2

18696

Sample Input 3

100000 99999

Sample Output 3

9999900000

Solution in Java7 (OpenJDK 1.7.0) (judge verdict: Accepted)

import java.util.*;
public class Main {
	public static void main(String[] args){
        Scanner sc = new Scanner(System.in);

		// 整数の入力
        int a = sc.nextInt();
        int b = sc.nextInt();
        int big = Math.max(a, b);
        int aa = a;
        int bb = b;
        
        int i = 2;
        boolean divided = true;
        ArrayList<Integer> list = new ArrayList<>();
        list.add(1);
        while (divided) {
            i = 2;
            while (i <= big) {
                if (aa % i == 0 && bb % i == 0) {
                    aa = aa / i;
                    bb = bb / i;
                    list.add(i);
                    break;
                }
                i++;
            }
            if (i > big)
                divided = false;
        }
        long ans = 1;
        for (int ele : list) {
            ans *= ele;
        }
        ans = ans * aa * bb;

        System.out.println(ans);
	}
}