| 2146-B |
Merging the Sets
|
greedy
implementation
|
1100
|
| 2146-A |
Equal Occurrences
|
brute force
greedy
implementation
|
800
|
| 2145-G |
Cost of Coloring
|
combinatorics
divide and conquer
dp
+2
|
2900
|
| 2145-F |
Long Journey
|
dfs and similar
divide and conquer
dp
+5
|
2500
|
| 2145-E |
Predicting Popularity
|
binary search
data structures
greedy
+1
|
2100
|
| 2145-D |
Inversion Value of a Permutation
|
constructive algorithms
dfs and similar
dp
|
1800
|
| 2145-C |
Monocarp's String
|
binary search
greedy
strings
|
1300
|
| 2145-B |
Deck of Cards
|
greedy
implementation
|
1000
|
| 2145-A |
Candies for Nephews
|
math
|
800
|
| 2144-F |
Bracket Groups
|
brute force
constructive algorithms
dp
+2
|
2700
|
| 2144-E2 |
Looking at Towers (difficult version)
|
combinatorics
data structures
dp
|
2500
|
| 2144-E1 |
Looking at Towers (easy version)
|
combinatorics
dp
|
2200
|
| 2144-D |
Price Tags
|
brute force
dp
math
|
1800
|
| 2144-C |
Non-Descending Arrays
|
combinatorics
dp
math
|
1300
|
| 2144-B |
Maximum Cost Permutation
|
constructive algorithms
greedy
|
1000
|
| 2144-A |
Cut the Array
|
brute force
constructive algorithms
math
+1
|
800
|
| 2143-F |
Increasing Xor
|
bitmasks
data structures
math
|
2700
|
| 2143-E |
Make Good
|
constructive algorithms
greedy
math
+1
|
2400
|
| 2143-D2 |
Inversion Graph Coloring (Hard Version)
|
binary search
combinatorics
data structures
+2
|
2200
|
| 2143-D1 |
Inversion Graph Coloring (Easy Version)
|
combinatorics
data structures
dp
+2
|
1800
|
| 2143-C |
Max Tree
|
constructive algorithms
dfs and similar
graphs
+1
|
1300
|
| 2143-B |
Discounts
|
greedy
sortings
two pointers
|
1000
|
| 2143-A |
All Lengths Subtraction
|
brute force
two pointers
|
800
|
| 2141-I |
Color the Tree
|
*special
|
3500
|
| 2141-H |
Merging Vertices in a Graph
|
*special
dfs and similar
dsu
+1
|
2700
|
| 2141-G |
Good Robot Paths
|
*special
data structures
geometry
+1
|
2800
|
| 2141-F |
Array Reduction
|
*special
greedy
|
2200
|
| 2141-E |
Perfect Cut
|
*special
dp
greedy
|
2100
|
| 2141-D |
Avoid Minimums
|
*special
greedy
math
|
1800
|
| 2141-C |
Minimum on Subarrays
|
*special
brute force
|
1800
|
| 2141-B |
Games
|
*special
greedy
|
1200
|
| 2141-A |
Furniture Store
|
*special
implementation
|
800
|
| 2140-F |
Sum Minimisation
|
number theory
|
2900
|
| 2140-E2 |
Prime Gaming (Hard Version)
|
bitmasks
combinatorics
dp
+1
|
2500
|
| 2140-E1 |
Prime Gaming (Easy Version)
|
bitmasks
combinatorics
dp
|
2200
|
| 2140-D |
A Cruel Segment's Thesis
|
data structures
greedy
sortings
|
2000
|
| 2140-C |
Ultimate Value
|
data structures
games
greedy
|
1500
|
| 2140-B |
Another Divisibility Problem
|
constructive algorithms
math
number theory
|
900
|
| 2140-A |
Shift Sort
|
greedy
sortings
|
800
|
| 2139-B |
Cake Collection
|
greedy
|
800
|
| 2139-A |
Maple and Multiplication
|
greedy
math
|
800
|
| 2138-F |
Ode to the Bridge Builder
|
constructive algorithms
geometry
|
3500
|
| 2138-E2 |
Determinant Construction (Hard Version)
|
brute force
constructive algorithms
math
+2
|
3100
|
| 2138-E1 |
Determinant Construction (Easy Version)
|
brute force
constructive algorithms
math
+2
|
3100
|
| 2138-D |
Antiamuny and Slider Movement
|
brute force
combinatorics
implementation
+2
|
2600
|
| 2138-C2 |
Maple and Tree Beauty (Hard Version)
|
bitmasks
brute force
dfs and similar
+3
|
2000
|
| 2138-C1 |
Maple and Tree Beauty (Easy Version)
|
brute force
dfs and similar
dp
+2
|
1800
|
| 2138-B |
Antiamuny Wants to Learn Swap
|
data structures
greedy
two pointers
|
1900
|
| 2138-A |
Cake Assignment
|
bitmasks
constructive algorithms
greedy
|
1100
|
| 2137-G |
Cry Me a River
|
dfs and similar
dp
games
+1
|
2200
|