Rayan Programming Contest 2024 - Selection (Codeforces Round 989, Div. 1 + Div. 2) 题解 (A~E)
A.KingKeykhosrow’sMystery上限是lcm(a,b)lcm(a,b)lcm(a,b),直接枚举即可#includevoidsolve(){inta,b;std::cin>>a>>b;intl=std::lcm(a,b);for(inti=std::min(a,b);i>t;while(t--)solve();return0;}B.Rakhsh’sRevival贪心,每次000的