{"problem":{"name":"B. Racetrack","description":{"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.  Today, after they finished playing, they noticed they had the","description_type":"Markdown"},"platform":"Codeforces","limit":{"time_limit":1000,"memory_limit":65536},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"CF10188B"},"statements":[{"statement_type":"Markdown","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## Input\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\n## Output\n\nYou should return the smallest possible number of points that Alice and Bob have, which should be an integer c. \n\n[samples]\n\n## Note\n\n#cf_span(class=[tex-font-style-underline], body=[Constraints]):1 ≤ a ≤ 10, 0001 ≤ b ≤ 10, 0001 ≤ c ≤ 100, 000, 000","is_translate":false,"language":"English"}],"meta":{"iden":"CF10188B","tags":[],"sample_group":[],"created_at":"2026-03-03 11:00:39"}}