{"raw_statement":[{"iden":"statement","content":"Alice and Bob play different games. When Alice plays, she always wins exactly a points. When Bob plays, he always wins exactly b points. \n\nToday, after they finished playing, they noticed they had the same number of points. What is the smallest number this could be?\n\nThe first line contains two integers, a and b, separated by spaces, where a is the number of points Alice wins in one game and b is the number of points Bob wins in one game. \n\nYou should return the smallest possible number of points that Alice and Bob have, which should be an integer c. \n\n#cf_span(class=[tex-font-style-underline], body=[Constraints]):\n\n1 ≤ a ≤ 10, 000\n\n1 ≤ b ≤ 10, 000\n\n1 ≤ c ≤ 100, 000, 000\n\n"},{"iden":"input","content":"The first line contains two integers, a and b, separated by spaces, where a is the number of points Alice wins in one game and b is the number of points Bob wins in one game. "},{"iden":"output","content":"You should return the smallest possible number of points that Alice and Bob have, which should be an integer c. "},{"iden":"examples","content":"Input2 3Output6Input4 6Output12"},{"iden":"note","content":"#cf_span(class=[tex-font-style-underline], body=[Constraints]):1 ≤ a ≤ 10, 0001 ≤ b ≤ 10, 0001 ≤ c ≤ 100, 000, 000"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ a, b \\in \\mathbb{Z}^+ $ denote the points Alice and Bob win per game, respectively.\n\n**Constraints**  \n$ 1 \\leq a \\leq 10{,}000 $  \n$ 1 \\leq b \\leq 10{,}000 $\n\n**Objective**  \nFind the smallest positive integer $ c $ such that $ c $ is a common multiple of $ a $ and $ b $:  \n$$\nc = \\mathrm{lcm}(a, b)\n$$","simple_statement":"Find the smallest number that is a multiple of both a and b.","has_page_source":false}