| 1253-B |
Silly Mistake
|
greedy
implementation
|
1400
|
| 1253-A |
Single Push
|
implementation
|
1000
|
| 1252-L |
Road Construction
|
flows
graphs
|
2300
|
| 1252-K |
Addition Robot
|
data structures
math
matrices
|
2100
|
| 1252-J |
Tiling Terrace
|
brute force
dp
|
2300
|
| 1252-I |
Mission Possible
|
|
3000
|
| 1252-H |
Twin Buildings
|
greedy
implementation
|
1800
|
| 1252-G |
Performance Review
|
data structures
|
2100
|
| 1252-F |
Regular Forestation
|
hashing
trees
|
2400
|
| 1252-E |
Songwriter
|
greedy
two pointers
|
2200
|
| 1252-D |
Find String in a Grid
|
data structures
dp
strings
+1
|
3000
|
| 1252-C |
Even Path
|
data structures
implementation
|
1600
|
| 1252-B |
Cleaning Robots
|
dp
trees
|
2300
|
| 1252-A |
Copying Homework
|
|
1000
|
| 1251-F |
Red-White Fence
|
combinatorics
fft
|
2500
|
| 1251-E2 |
Voting (Hard Version)
|
binary search
data structures
greedy
|
2400
|
| 1251-E1 |
Voting (Easy Version)
|
data structures
dp
greedy
|
2300
|
| 1251-D |
Salary Changing
|
binary search
greedy
sortings
|
1900
|
| 1251-C |
Minimize The Integer
|
greedy
two pointers
|
1600
|
| 1251-B |
Binary Palindromes
|
greedy
strings
|
1400
|
| 1251-A |
Broken Keyboard
|
brute force
strings
two pointers
|
1000
|
| 1250-N |
Wires
|
dfs and similar
graphs
greedy
|
2000
|
| 1250-M |
SmartGarden
|
constructive algorithms
divide and conquer
|
2500
|
| 1250-L |
Divide The Students
|
binary search
greedy
math
|
1500
|
| 1250-K |
Projectors
|
flows
graphs
|
3100
|
| 1250-J |
The Parade
|
binary search
greedy
|
1800
|
| 1250-I |
Show Must Go On
|
binary search
brute force
greedy
+1
|
3100
|
| 1250-H |
Happy Birthday
|
math
|
1500
|
| 1250-G |
Discarding Game
|
dp
greedy
two pointers
|
2300
|
| 1250-F |
Data Center
|
brute force
implementation
|
800
|
| 1250-E |
The Coronation
|
graphs
implementation
|
2300
|
| 1250-D |
Conference Problem
|
dp
|
3000
|
| 1250-C |
Trip to Saint Petersburg
|
data structures
|
2100
|
| 1250-B |
The Feast and the Bus
|
brute force
constructive algorithms
greedy
+1
|
1800
|
| 1250-A |
Berstagram
|
implementation
|
1400
|
| 1249-F |
Maximum Weight Subset
|
dp
trees
|
2200
|
| 1249-E |
By Elevator or Stairs?
|
dp
shortest paths
|
1700
|
| 1249-D2 |
Too Many Segments (hard version)
|
data structures
greedy
sortings
|
1800
|
| 1249-D1 |
Too Many Segments (easy version)
|
greedy
|
1800
|
| 1249-C2 |
Good Numbers (hard version)
|
binary search
greedy
math
+1
|
1500
|
| 1249-C1 |
Good Numbers (easy version)
|
brute force
greedy
implementation
|
1300
|
| 1249-B2 |
Books Exchange (hard version)
|
dfs and similar
dsu
math
|
1300
|
| 1249-B1 |
Books Exchange (easy version)
|
dsu
math
|
1000
|
| 1249-A |
Yet Another Dividing into Teams
|
math
|
800
|
| 1248-D1 |
The World Is Just a Programming Task (Easy Version)
|
brute force
dp
greedy
+1
|
2000
|
| 1248-B |
Grow The Tree
|
greedy
math
sortings
|
900
|
| 1248-A |
Integer Points
|
geometry
math
|
1000
|
| 1246-F |
Cursor Distance
|
|
3500
|
| 1245-F |
Daniel and Spring Cleaning
|
bitmasks
brute force
combinatorics
+1
|
2300
|
| 1245-E |
Hyakugoku and Ladders
|
dp
probabilities
shortest paths
|
2300
|