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 C# (Mono 4.6.2.0) (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

class Program
{
    public static void Main()
    {
        string[] K = Console.ReadLine().Split(' ');
        double A = int.Parse(K[0]);
        double B = int.Parse(K[1]);

        double C = A;
        double D = B;
        while (true)
        {
           
            if (C > D)
            {
                C = C % D;
            }
            else if (D > C)
            {
                D = D % C;
            }

            if (C == 1|D==1)
            {

                break;
            }
            else if (C == 0 | D == 0)
            {
                break;
            }
        }
        double ans;
        if (C == 0)
        {
            ans = (A * B) / D;
        }
        else if (D == 0)
        {
            ans = (A * B) / C;
        }
        else
            ans = A * B;
        
        Console.WriteLine(ans);
    }
}