Tags

BST 1
[CF] D. Broken BST - Educational Codeforces Round 19
DP 3
D. Med-imize - Codeforces Round 963 (Div. 2) [LeetCode] 1575. Count All Possible Routes [AtCoder] Beginner Contest 177 F - I hate Shortest Path Problem
log 1
E. Level Up - Educational Codeforces Round 168
Sqrt Trick 1
E. Array Queries - Educational Codeforces Round 19
二叉树 1
[CF] D. Broken BST - Educational Codeforces Round 19
分类讨论 1
[CF] C. Three Garlands - Educational Codeforces Round 35 (Rated for Div. 2)
前缀和 2
C. Light Switches - Codeforces Round 963 (Div. 2) [AtCoder] Beginner Contest 177
单调队列 1
E. Cashback - Codeforces Round 466 (Div. 2)
回文 1
A. Simple Palindrome - Codeforces Round 972 (Div. 2)
完全二叉树 1
D. Paths in a Complete Binary Tree - Educational Codeforces Round 18
幂平均不等式 1
A. Simple Palindrome - Codeforces Round 972 (Div. 2)
循环 1
C. Light Switches - Codeforces Round 963 (Div. 2)
数位dp 1
[CF] D. Magic Numbers - Educational Codeforces Round 8
数据结构 1
E. Level Up - Educational Codeforces Round 168
整除 3
[CF] B. New Skateboard - Educational Codeforces Round 8 C. Divide by Three - Educational Codeforces Round 18 [数学] 判断数字能否被 x 整除
杂题 1
[CF] B. Two Cakes - Educational Codeforces Round 35 (Rated for Div. 2)
栈 1
C. Minimal string - Educational Codeforces Round 19
树 3
[CF] D. Broken BST - Educational Codeforces Round 19 D. Maximize the Root - Educational Codeforces Round 168 E. Wooden Game - Codeforces Round 959 sponsored by NEAR (Div. 1 + Div. 2)
模拟 1
B. Counting-out Rhyme - Educational Codeforces Round 18
逆序数 1
[CF] D. Inversion Counting - Educational Codeforces Round 35 (Rated for Div. 2)