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 Java (OpenJDK 11.0.6) (judge verdict: Wrong Answer)

import java.util.Scanner;

/**
 * C - Snack
 * 高橋君はパーティを企画しています。
 * パーティーでは参加者に 1 人 1 個以上のお菓子を配る予定です。
 * 高橋君は参加者の人数が A 人か B 人のどちらかになるだろうという予想を立てました。
 * どちらの場合でも均等に配りきることができるようなお菓子の個数の最小値を求めてください。
 * ただし、 1 個のお菓子を分割して複数人で分けることはできないものとします。
 */
public class Main {

    public static void main( String[] args ) {

        Scanner sc = new Scanner( System.in );
        // 入力値
        int a = sc.nextInt();
        int b = sc.nextInt();

        System.out.println( lcm( a, b ) );

        sc.close();
    }

    /*
     *  最小公倍数lcm
     */
    static int lcm ( int a, int b ) {
        int temp;
        long c = a;
        c *= b;
        while( ( temp = a % b ) != 0 ) {
            a = b;
            b = temp;
        }
        return ( int ) ( c / b );
    }
}