CT398

Cleo's Ledger of tokens

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

It is audit day at the rook towers of Chessfield. Cleo spreads the tokens records across the table and picks up a sharp pencil. Task: Read two positive integers a and b and print their least common multiple. Input format: One line with two space-separated integers a and b. Output format: Print lcm(a, b). Constraints: 1 <= a,b <= 1000000000 (the lcm fits a signed 64-bit integer).

Example 1:

Input: 551489 682306
Output: 376284253634

Example 2:

Input: 580032 103818
Output: 10036293696

Example 3:

Input: 130844 101193
Output: 13240496892

Constraints:

1 <= a,b <= 1000000000 (the lcm fits a signed 64-bit integer).

Loading...
Test Cases:No test cases
No test cases available.