数据边界这里不保存完整题面、样例或题解。点击原题链接后在 Codeforces 页面完成训练。
1353F
Decreasing Heights
brute forcedp
2056D
Unique Median
binary searchbrute forcecombinatoricsdata structuresdivide and conquerdp
1389E
Calendar Ambiguity
mathnumber theory
1406D
Three Sequences
constructive algorithmsdata structuresgreedymath
1997E
Level Up
binary searchbrute forcedata structuresdivide and conquerimplementation
1503C
Travelling Salesman Problem
binary searchdata structuresdpgreedyshortest pathssortingstwo pointers
1656E
Equal Tree Sums
constructive algorithmsdfs and similarmathtrees
1437E
Make It Increasing
binary searchconstructive algorithmsdata structuresdpimplementation
551C
GukiZ hates Boxes
binary searchgreedy
1467D
Sum of Paths
combinatoricsdpmath
915D
Almost Acyclic Graph
dfs and similargraphs
1156E
Special Segments of Permutation
data structuresdivide and conquerdsutwo pointers
1336C
Kaavi and Magic Spell
dpstrings
1567E
Non-Decreasing Dilemma
data structuresdivide and conquermath
1470D
Strange Housing
constructive algorithmsdfs and similargraph matchingsgraphsgreedy
1854B
Earn or Unlock
bitmasksbrute forcedp
1428E
Carrots for Rabbits
binary searchdata structuresgreedymathsortings
1520G
To Go Or Not To Go?
brute forcedfs and similargraphsgreedyimplementationshortest paths
1474D
Cleaning
data structuresdpgreedymath
2013E
Prefix GCD
brute forcedpgreedymathnumber theory
282E
Sausage Maximization
bitmasksdata structurestrees
903D
Almost Difference
data structuresmath
1993D
Med-imize
binary searchdpgreedy
1515E
Phoenix and Computers
combinatoricsdpmath
1438D
Powerful Ksenia
bitmasksconstructive algorithmsmath
7D
Palindrome Degree
hashingstrings
1333F
Kate and imperfection
greedyimplementationmathnumber theorysortingstwo pointers
1175E
Minimal Segment Cover
data structuresdfs and similardivide and conquerdpgreedyimplementationtrees
1156D
0-1-Tree
dfs and similardivide and conquerdpdsutrees
1110E
Magic Stones
constructive algorithmsmathsortings
587C
Duff in the Army
data structurestrees
1967B2
Reverse Card (Hard Version)
brute forcemathnumber theory
280C
Game on Tree
implementationmathprobabilitiestrees
1485D
Multiples and Power Differences
constructive algorithmsgraphsmathnumber theory
1092D1
Great Vova Wall (Version 1)
greedyimplementationmath
1407D
Discrete Centrifugal Jumps
data structuresdpgraphs
1537E2
Erase and Extend (Hard Version)
binary searchdata structuresgreedyhashingstring suffix structuresstringstwo pointers
1400E
Clear the Multiset
data structuresdivide and conquerdpgreedy
11D
A Simple Task
bitmasksdpgraphs
833B
The Bakery
binary searchdata structuresdivide and conquerdptwo pointers
559C
Gerald and Giant Chess
combinatoricsdpmathnumber theory
570D
Tree Requests
binary searchbitmasksconstructive algorithmsdfs and similargraphstrees
165E
Compatible Numbers
bitmasksbrute forcedfs and similardp
617E
XOR and Favorite Number
data structures
52C
Circular RMQ
data structures
86D
Powerful array
data structuresimplementationmathtwo pointers