| 238-E |
Meeting Her
|
dp
graphs
shortest paths
|
2600
|
| 238-D |
Tape Programming
|
data structures
implementation
|
2900
|
| 238-C |
World Eater Brothers
|
dfs and similar
dp
greedy
+1
|
2100
|
| 238-B |
Boring Partition
|
constructive algorithms
|
1800
|
| 238-A |
Not Wool Sequences
|
constructive algorithms
math
|
1300
|
| 237-E |
Build String
|
flows
graphs
|
2000
|
| 237-D |
T-decomposition
|
dfs and similar
graphs
greedy
+1
|
2000
|
| 237-C |
Primes on Interval
|
binary search
number theory
two pointers
|
1600
|
| 237-B |
Young Table
|
implementation
sortings
|
1500
|
| 237-A |
Free Cash
|
implementation
|
1000
|
| 236-B |
Easy Number Challenge
|
implementation
number theory
|
1300
|
| 236-A |
Boy or Girl
|
brute force
implementation
strings
|
800
|
| 235-E |
Number Challenge
|
combinatorics
dp
implementation
+2
|
2600
|
| 235-D |
Graph Game
|
graphs
|
3000
|
| 235-C |
Cyclical Quest
|
data structures
string suffix structures
strings
|
2700
|
| 235-B |
Let's Play Osu!
|
dp
math
probabilities
|
2000
|
| 235-A |
LCM Challenge
|
number theory
|
1600
|
| 234-H |
Merging Two Decks
|
constructive algorithms
greedy
|
2000
|
| 234-G |
Practice
|
constructive algorithms
divide and conquer
implementation
|
1600
|
| 234-F |
Fence
|
dp
|
1800
|
| 234-E |
Champions' League
|
implementation
|
1600
|
| 234-D |
Cinema
|
implementation
|
1600
|
| 234-C |
Weather
|
dp
implementation
|
1300
|
| 234-B |
Reading
|
sortings
|
1000
|
| 234-A |
Lefthanders and Righthanders
|
implementation
|
1200
|
| 233-B |
Non-square Equation
|
binary search
brute force
math
|
1400
|
| 233-A |
Perfect Permutation
|
implementation
math
|
800
|
| 232-E |
Quick Tortoise
|
bitmasks
divide and conquer
dp
|
3000
|
| 232-D |
Fence
|
binary search
data structures
string suffix structures
|
2900
|
| 232-C |
Doe Graphs
|
constructive algorithms
divide and conquer
dp
+2
|
2600
|
| 232-B |
Table
|
bitmasks
combinatorics
dp
+1
|
1900
|
| 232-A |
Cycles
|
binary search
constructive algorithms
graphs
+1
|
1600
|
| 231-E |
Cactus
|
data structures
dfs and similar
dp
+2
|
2100
|
| 231-D |
Magic Box
|
brute force
geometry
|
1600
|
| 231-C |
To Add or Not to Add
|
binary search
sortings
two pointers
|
1600
|
| 231-B |
Magic, Wizardry and Wonders
|
constructive algorithms
greedy
|
1500
|
| 231-A |
Team
|
brute force
greedy
|
800
|
| 230-B |
T-primes
|
binary search
implementation
math
+1
|
1300
|
| 230-A |
Dragons
|
greedy
sortings
|
1000
|
| 229-E |
Gifts
|
combinatorics
dp
math
+1
|
2600
|
| 229-D |
Towers
|
dp
greedy
two pointers
|
2100
|
| 229-C |
Triangles
|
combinatorics
graphs
math
|
1900
|
| 229-B |
Planets
|
binary search
data structures
graphs
+1
|
1700
|
| 229-A |
Shifts
|
brute force
two pointers
|
1500
|
| 228-E |
The Road to Berland is Paved With Good Intentions
|
2-sat
dfs and similar
dsu
+1
|
1900
|
| 228-D |
Zigzag
|
data structures
|
2100
|
| 228-C |
Fractal Detector
|
dp
hashing
|
2000
|
| 228-B |
Two Tables
|
brute force
implementation
|
1400
|
| 228-A |
Is your horseshoe on the other hoof?
|
implementation
|
800
|
| 227-B |
Effective Approach
|
implementation
|
1100
|