#CF1800
2 entries01
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? 找 使 ，若有多个 ，取最小的。
02
CF contest 1935 Round 932 (Div. 2) A-D题解
Codeforces Round 932 (Div. 2) A-D题解Codeforces Round 932 (Div. 2) 绪言很菜，AB速度慢，卡在C，想DP，但是时间优化不下来，说服自己 能过 ，D稍微简单，但是没看D，遂掉分。