| 1141-A |
Game 23
|
implementation
math
|
1000
|
| 1140-G |
Double Tree
|
data structures
divide and conquer
shortest paths
+1
|
2700
|
| 1140-F |
Extending Set of Points
|
data structures
divide and conquer
dsu
|
2600
|
| 1140-E |
Palindrome-less Arrays
|
combinatorics
divide and conquer
dp
|
2200
|
| 1140-D |
Minimum Triangulation
|
dp
greedy
math
|
1200
|
| 1140-C |
Playlist
|
brute force
data structures
sortings
|
1600
|
| 1140-B |
Good String
|
implementation
strings
|
1200
|
| 1140-A |
Detective Book
|
implementation
|
1000
|
| 1139-F |
Dish Shopping
|
data structures
divide and conquer
|
2500
|
| 1139-E |
Maximize Mex
|
flows
graph matchings
graphs
|
2400
|
| 1139-D |
Steps to One
|
dp
math
number theory
+1
|
2300
|
| 1139-C |
Edgy Trees
|
dfs and similar
dsu
graphs
+2
|
1500
|
| 1139-B |
Chocolates
|
greedy
implementation
|
1000
|
| 1139-A |
Even Substrings
|
implementation
strings
|
800
|
| 1138-B |
Circus
|
brute force
greedy
math
+1
|
1800
|
| 1138-A |
Sushi for Two
|
binary search
greedy
implementation
|
900
|
| 1137-F |
Matches Are Not a Child's Play
|
data structures
trees
|
3400
|
| 1137-E |
Train Car Selection
|
data structures
greedy
|
2700
|
| 1137-D |
Cooperative Game
|
constructive algorithms
interactive
number theory
|
2400
|
| 1137-C |
Museums Tour
|
dp
graphs
implementation
|
2500
|
| 1137-B |
Camp Schedule
|
greedy
hashing
strings
|
1600
|
| 1137-A |
Skyscrapers
|
implementation
sortings
|
1600
|
| 1136-E |
Nastya Hasn't Written a Legend
|
binary search
data structures
|
2200
|
| 1136-D |
Nastya Is Buying Lunch
|
greedy
|
1800
|
| 1136-C |
Nastya Is Transposing Matrices
|
constructive algorithms
sortings
|
1500
|
| 1136-B |
Nastya Is Playing Computer Games
|
constructive algorithms
math
|
1000
|
| 1136-A |
Nastya Is Reading a Book
|
implementation
|
800
|
| 1133-F2 |
Spanning Tree with One Fixed Degree
|
constructive algorithms
dfs and similar
dsu
+2
|
1900
|
| 1133-F1 |
Spanning Tree with Maximum Degree
|
graphs
|
1600
|
| 1133-E |
K Balanced Teams
|
dp
sortings
two pointers
|
1800
|
| 1133-D |
Zero Quantity Maximization
|
hashing
math
number theory
|
1500
|
| 1133-C |
Balanced Team
|
sortings
two pointers
|
1200
|
| 1133-B |
Preparation for International Women's Day
|
math
number theory
|
1200
|
| 1133-A |
Middle of the Contest
|
implementation
|
1000
|
| 1132-G |
Greedy Subsequences
|
data structures
dp
trees
|
2400
|
| 1132-F |
Clear the String
|
dp
|
2000
|
| 1132-E |
Knapsack
|
dfs and similar
dp
greedy
|
2300
|
| 1132-D |
Stressful Training
|
binary search
greedy
|
2300
|
| 1132-C |
Painting the Fence
|
brute force
|
1700
|
| 1132-B |
Discounts
|
greedy
sortings
|
900
|
| 1132-A |
Regular Bracket Sequence
|
greedy
implementation
|
1100
|
| 1131-G |
Most Dangerous Shark
|
data structures
dp
two pointers
|
2700
|
| 1131-F |
Asya And Kittens
|
constructive algorithms
dsu
|
1700
|
| 1131-E |
String Multiplication
|
dp
greedy
strings
|
2300
|
| 1131-D |
Gourmet choice
|
dfs and similar
dp
dsu
+2
|
2000
|
| 1131-C |
Birthday
|
binary search
greedy
sortings
|
1200
|
| 1131-B |
Draw!
|
greedy
implementation
|
1400
|
| 1131-A |
Sea Battle
|
math
|
800
|
| 1130-C |
Connect
|
brute force
dfs and similar
dsu
|
1400
|
| 1130-B |
Two Cakes
|
greedy
|
1200
|