01
CF1152C Neko does Maths
ProblemNeko has two integers and . His goal is to find a non-negative integer such that the least common multiple of and is the smallest possible. If there are multiple optimal integers , he needs to choose the smallest one. Given his mathematical talent, Neko had no trouble getting Wrong Answer on this problem. Can you help him solve it? 找 使 ,若有多个 ,取最小的。
2024—07—22515 / ≈ 2 MIN