V
主页
Codeforces Round 856 (Div. 2)
发布人
A. 长为 n-1 的前后缀互为翻转 B. 先把每个数变成 >=2,然后如果被前一个整除再 +1 C. a[i-x+1]>=x D. 选 n 个互不相同的素数,剩下是排列数,DP E. 哈希,sum x^i dis_i,换根 DP
打开封面
下载高清视频
观看高清视频
视频下载器
Codeforces Round 973 (Div. 2) [ A - F2 ] 窥视算法顶级选手的世界(F 好难)
Codeforces Round 873 (Div. 1)
Codeforces Round 961 (Div. 2)
Codeforces Round 900 (Div. 3)
Codeforces Round 946 (Div. 3)
Codeforces Round 892 (Div. 2)
Codeforces Round 937 (Div. 4)
CodeTON Round 1, Rank 1
Codeforces Round #765 (Div. 2) Virtual Participation
Codeforces Round 888 (Div. 3)
Codeforces Round 929 (Div. 3)
Educational Codeforces Round 148 (Rated for Div. 2)
Educational Codeforces Round 152 (Rated for Div. 2)
Codeforces Round 951 (Div. 2)
Codeforces Round 864 (Div. 2)
Codeforces Round 905 (Div. 1)
Codeforces Round 952 (Div. 4)
EPIC Institute of Technology Round August 2024 (Div. 1 + Div. 2)
Educational Codeforces Round 146
Educational Codeforces Round 161 (Rated for Div. 2)
Codeforces Round 964 (Div. 4)
Codeforces Round 860 (Div. 2)
Codeforces Round 891 (Div. 3)
Codeforces Round 874 (Div. 3)
Codeforces Round 872 (Div. 1)
Codeforces Round 933 (Div. 3)
Educational Codeforces Round 162 (Rated for Div. 2)
Codeforces Round #779 (Div. 2)
Codeforces Round 886 (Div. 4)
零基础少儿编程C++教程 第4课,不跟学吗? 信奧赛,蓝桥,ACM,ICPC
Codeforces Round 931 (Div. 2)
Pinely Round 2 (Div. 1 + Div. 2)
CodeTON Round 6 (Div. 1 + Div. 2, Rated, Prizes!)
Codeforces Round #849 (Div. 4)
Codeforces Round #847 (Div. 3)
Codeforces Round #843 (Div. 2)
Codeforces Round 923 (Div. 3)
Codeforces Round #826 (Div. 3)
Codeforces Round 921 (Div. 1)
Educational Codeforces Round 167 (Rated for Div. 2)