| 1843-D |
Apple Tree
|
combinatorics
dfs and similar
dp
+2
|
1200
|
| 1843-C |
Sum in Binary Tree
|
bitmasks
combinatorics
math
+1
|
800
|
| 1843-B |
Long Long
|
greedy
math
two pointers
|
800
|
| 1843-A |
Sasha and Array Coloring
|
greedy
sortings
two pointers
|
800
|
| 1842-I |
Tenzing and Necklace
|
divide and conquer
dp
greedy
|
3500
|
| 1842-H |
Tenzing and Random Real Numbers
|
bitmasks
dp
graphs
+2
|
3000
|
| 1842-G |
Tenzing and Random Operations
|
combinatorics
dp
math
+1
|
2800
|
| 1842-F |
Tenzing and Tree
|
dfs and similar
greedy
shortest paths
+2
|
2500
|
| 1842-E |
Tenzing and Triangle
|
data structures
dp
geometry
+2
|
2300
|
| 1842-D |
Tenzing and His Animal Friends
|
constructive algorithms
graphs
greedy
|
1900
|
| 1842-C |
Tenzing and Balls
|
dp
|
1500
|
| 1842-B |
Tenzing and Books
|
bitmasks
greedy
math
|
1100
|
| 1842-A |
Tenzing and Tsondu
|
games
math
|
800
|
| 1841-F |
Monocarp and a Strategic Game
|
geometry
sortings
two pointers
|
2700
|
| 1841-E |
Fill the Matrix
|
data structures
greedy
math
|
2200
|
| 1841-D |
Pairs of Segments
|
data structures
greedy
sortings
+1
|
2000
|
| 1841-C |
Ranom Numbers
|
brute force
dp
greedy
+2
|
1800
|
| 1841-B |
Keep it Beautiful
|
implementation
|
1000
|
| 1841-A |
Game with Board
|
constructive algorithms
games
|
800
|
| 1840-G2 |
In Search of Truth (Hard Version)
|
constructive algorithms
interactive
math
+2
|
2500
|
| 1840-G1 |
In Search of Truth (Easy Version)
|
constructive algorithms
interactive
math
+2
|
2200
|
| 1840-F |
Railguns
|
brute force
dfs and similar
dp
+1
|
2200
|
| 1840-E |
Character Blocking
|
data structures
hashing
implementation
|
1600
|
| 1840-D |
Wooden Toy Festival
|
binary search
greedy
sortings
|
1400
|
| 1840-C |
Ski Resort
|
combinatorics
math
two pointers
|
1000
|
| 1840-B |
Binary Cafe
|
bitmasks
combinatorics
math
|
1100
|
| 1840-A |
Cipher Shifer
|
implementation
strings
two pointers
|
800
|
| 1839-E |
Decreasing Game
|
constructive algorithms
dfs and similar
dp
+2
|
2400
|
| 1839-D |
Ball Sorting
|
data structures
dp
sortings
|
2100
|
| 1839-C |
Insert Zero and Invert Prefix
|
constructive algorithms
|
1300
|
| 1839-B |
Lamps
|
greedy
sortings
|
1100
|
| 1839-A |
The Good Array
|
greedy
implementation
math
|
800
|
| 1838-F |
Stuck Conveyor
|
binary search
constructive algorithms
interactive
|
3000
|
| 1838-E |
Count Supersequences
|
combinatorics
dp
math
|
2500
|
| 1838-D |
Bracket Walk
|
data structures
greedy
strings
|
2100
|
| 1838-C |
No Prime Differences
|
constructive algorithms
math
number theory
|
1400
|
| 1838-B |
Minimize Permutation Subarrays
|
constructive algorithms
math
|
1100
|
| 1838-A |
Blackboard List
|
constructive algorithms
math
|
800
|
| 1837-F |
Editorial for Two
|
binary search
data structures
greedy
+1
|
2400
|
| 1837-E |
Playoff Fixing
|
combinatorics
trees
|
2200
|
| 1837-D |
Bracket Coloring
|
constructive algorithms
greedy
|
1400
|
| 1837-C |
Best Binary String
|
constructive algorithms
greedy
|
1000
|
| 1837-B |
Comparison String
|
greedy
|
900
|
| 1837-A |
Grasshopper on a Line
|
constructive algorithms
math
|
800
|
| 1836-B |
Astrophysicists
|
greedy
math
|
1100
|
| 1836-A |
Destroyer
|
implementation
sortings
|
800
|
| 1835-F |
Good Graph
|
bitmasks
dfs and similar
graph matchings
+2
|
3500
|
| 1835-E |
Old Mobile
|
combinatorics
dp
probabilities
|
3500
|
| 1835-D |
Doctor's Brown Hypothesis
|
dfs and similar
graphs
math
+1
|
2900
|
| 1835-C |
Twin Clusters
|
bitmasks
brute force
constructive algorithms
+2
|
2600
|