传统题 1000ms 256MiB

C - Snack

该比赛已结束,您无法在比赛模式下递交该题目。您可以点击“在题库中打开”以普通模式查看和递交本题。

C - Snack

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:

AA BB

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.


2 3
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.


123 456
18696

100000 99999
9999900000

2024暑假入门组刷题营第三期(九)

未参加
状态
已结束
规则
IOI
题目
8
开始于
2024-7-17 13:00
结束于
2024-7-17 15:00
持续时间
2 小时
主持人
参赛人数
8