V
主页
Codeforces Round #821 (Div. 2)
发布人
A: mod k = i 的最大值求和 B: x=0, y | (n-1),每 y 个换人 C: 先把奇偶性都变成一样的,再把所有数变成相等 D1: 分类讨论 D2: 若干相邻的用 x,剩下都用 y,dp E: 算每个位置经过的次数
打开封面
下载高清视频
观看高清视频
视频下载器
Educational Codeforces Round 124 丢人现场
Codeforces Round #772 (Div. 2), Rank 11
CodeTON Round 1, Rank 1
Codeforces Round #783 (Div. 1)
Codeforces Round #765 (Div. 2) Virtual Participation
Codeforces Round 894 (Div. 3)
Codeforces Round #775 (Div. 1), Rank 1
Educational Codeforces Round 149 (Rated for Div. 2)
Codeforces Round #843 (Div. 2)
Educational Codeforces Round 161 (Rated for Div. 2)
Codeforces Round 900 (Div. 3)
Codeforces Round #770 (Div. 2)
Codeforces Round 966 (Div. 3)
Codeforces Round #773 (Div. 1), Rank 6
Educational Codeforces Round 169 (Rated for Div. 2)
Codeforces Round 865 (Div. 1)
Codeforces Round 921 (Div. 1)
Codeforces Round 888 (Div. 3)
Codeforces Round #855 (Div. 3)
Codeforces Round #850 (Div. 1, based on VK Cup 2022 - Final Round)
Codeforces Round 874 (Div. 3)
Educational Codeforces Round 153 (Rated for Div. 2)
Codeforces Round 873 (Div. 1)
Educational Codeforces Round 140
Codeforces Round #854 by cybercats (Div. 1 + Div. 2)
Codeforces Round 904 (Div. 2)
2024“钉耙编程”中国大学生算法设计超级联赛(10)
Codeforces Round 892 (Div. 2)
Codeforces Round 864 (Div. 2)
AtCoder Grand Contest 067
Educational Codeforces Round 139
Educational Codeforces Round 146
Codeforces Round 942 (Div. 1)
Codeforces Round 934 (Div. 1)
Pinely Round 4 (Div. 1 + Div. 2)
Codeforces Round 896 (Div. 1)
Codeforces Round 872 (Div. 1)
think-cell Round 1
Codeforces Round 964 (Div. 4)
VP Codeforces Round 949 (Div. 2)