| 1898-B |
Milena and Admirer
|
greedy
math
|
1500
|
| 1898-A |
Milica and String
|
brute force
implementation
strings
|
800
|
| 1896-H2 |
Cyclic Hamming (Hard Version)
|
brute force
dp
fft
+2
|
3500
|
| 1896-H1 |
Cyclic Hamming (Easy Version)
|
brute force
divide and conquer
dp
+3
|
3400
|
| 1896-G |
Pepe Racing
|
constructive algorithms
implementation
interactive
+1
|
3200
|
| 1896-F |
Bracket Xoring
|
constructive algorithms
greedy
implementation
+1
|
2600
|
| 1896-E |
Permutation Sorting
|
data structures
sortings
|
2100
|
| 1896-D |
Ones and Twos
|
binary search
data structures
divide and conquer
+2
|
1700
|
| 1896-C |
Matching Arrays
|
binary search
constructive algorithms
greedy
+1
|
1400
|
| 1896-B |
AB Flipping
|
greedy
strings
two pointers
|
900
|
| 1896-A |
Jagged Swaps
|
sortings
|
800
|
| 1895-G |
Two Characters, Two Colors
|
binary search
data structures
dp
+2
|
3100
|
| 1895-F |
Fancy Arrays
|
combinatorics
dp
math
+1
|
2600
|
| 1895-E |
Infinite Card Game
|
binary search
brute force
data structures
+8
|
2300
|
| 1895-D |
XOR Construction
|
bitmasks
constructive algorithms
data structures
+3
|
1900
|
| 1895-C |
Torn Lucky Ticket
|
brute force
dp
hashing
+2
|
1400
|
| 1895-B |
Points and Minimum Distance
|
greedy
math
sortings
|
800
|
| 1895-A |
Treasure Chest
|
math
|
800
|
| 1894-B |
Two Out of Three
|
constructive algorithms
|
1000
|
| 1894-A |
Secret Sport
|
implementation
strings
|
800
|
| 1893-E |
Cacti Symphony
|
combinatorics
dfs and similar
dp
+1
|
3500
|
| 1893-D |
Colorful Constructive
|
constructive algorithms
data structures
greedy
|
2600
|
| 1893-C |
Freedom of Choice
|
brute force
greedy
implementation
|
2000
|
| 1893-B |
Neutral Tonality
|
constructive algorithms
greedy
sortings
+1
|
1700
|
| 1893-A |
Anonymous Informant
|
brute force
dfs and similar
graphs
+1
|
1400
|
| 1891-F |
A Growing Tree
|
data structures
dfs and similar
trees
|
2000
|
| 1891-E |
Brukhovich and Exams
|
brute force
greedy
implementation
+2
|
2500
|
| 1891-D |
Suspicious logarithms
|
binary search
brute force
math
|
1900
|
| 1891-C |
Smilo and Monsters
|
binary search
constructive algorithms
greedy
+2
|
1500
|
| 1891-B |
Deja Vu
|
brute force
math
sortings
|
1100
|
| 1891-A |
Sorting with Twos
|
constructive algorithms
sortings
|
800
|
| 1890-B |
Qingshan Loves Strings
|
constructive algorithms
implementation
|
800
|
| 1890-A |
Doremy's Paint 3
|
constructive algorithms
|
800
|
| 1889-F |
Doremy's Average Tree
|
data structures
dp
greedy
+1
|
3500
|
| 1889-E |
Doremy's Swapping Trees
|
dfs and similar
graphs
trees
|
3500
|
| 1889-D |
Game of Stacks
|
brute force
dfs and similar
graphs
+2
|
3000
|
| 1889-C2 |
Doremy's Drying Plan (Hard Version)
|
data structures
dp
|
2600
|
| 1889-C1 |
Doremy's Drying Plan (Easy Version)
|
brute force
data structures
dp
+2
|
2000
|
| 1889-B |
Doremy's Connecting Plan
|
constructive algorithms
greedy
math
+1
|
1700
|
| 1889-A |
Qingshan Loves Strings 2
|
constructive algorithms
greedy
implementation
|
1300
|
| 1887-F |
Minimum Segments
|
constructive algorithms
|
3400
|
| 1887-E |
Good Colorings
|
binary search
constructive algorithms
graphs
+1
|
3100
|
| 1887-D |
Split
|
binary search
data structures
divide and conquer
+4
|
2700
|
| 1887-C |
Minimum Array
|
binary search
brute force
constructive algorithms
+4
|
2400
|
| 1887-B |
Time Travel
|
binary search
graphs
shortest paths
|
1900
|
| 1886-F |
Diamond Theft
|
data structures
greedy
|
3300
|
| 1886-E |
I Wanna be the Team Leader
|
bitmasks
constructive algorithms
dp
+4
|
2400
|
| 1886-D |
Monocarp and the Set
|
combinatorics
data structures
math
|
2100
|
| 1886-C |
Decreasing String
|
implementation
strings
|
1600
|
| 1886-B |
Fear of the Dark
|
binary search
geometry
math
|
1200
|