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 Rust (1.15.1) (judge verdict: Accepted)

use std::io::Read;

fn main() {
    let mut buf = String::new();
    std::io::stdin().read_to_string(&mut buf).unwrap();

    let answer = solve(&buf);

    println!("{}", answer);
}

fn solve(input: &str) -> String {
    let mut iterator = input.split_whitespace();

    let a: usize = iterator.next().unwrap().parse().unwrap();
    let b: usize = iterator.next().unwrap().parse().unwrap();

    let mut i_a: usize = 1;
    let mut i_b: usize = 1;

    loop {
        let mul_a = a * i_a;
        let mul_b = b * i_b;
        if mul_a == mul_b {
            return mul_a.to_string();
        } else if mul_a > mul_b {
            i_b += 1;
        } else {
            i_a += 1;
        }
    }
}

#[test]
fn test() {
    assert_eq!(
        solve(
            r"2 3"
        ),
        "6"
    );
    assert_eq!(
        solve(
            r"123 456"
        ),
        "18696"
    );
    assert_eq!(
        solve(
            r"100000 99999"
        ),
        "9999900000"
    );
}