| 301-A |
Yaroslav and Sequence
|
constructive algorithms
|
1800
|
| 300-E |
Empire Strikes Back
|
binary search
math
number theory
|
2300
|
| 300-D |
Painting Square
|
dp
fft
|
2300
|
| 300-C |
Beautiful Numbers
|
brute force
combinatorics
|
1800
|
| 300-B |
Coach
|
brute force
dfs and similar
graphs
|
1500
|
| 300-A |
Array
|
brute force
constructive algorithms
implementation
|
1100
|
| 299-B |
Ksusha the Squirrel
|
brute force
implementation
|
900
|
| 299-A |
Ksusha and Array
|
brute force
number theory
sortings
|
1000
|
| 298-B |
Sail
|
brute force
greedy
implementation
|
1200
|
| 298-A |
Snow Footprints
|
greedy
implementation
|
1300
|
| 297-E |
Mystic Carvings
|
data structures
|
3000
|
| 297-D |
Color the Carpet
|
constructive algorithms
|
2500
|
| 297-C |
Splitting the Uniqueness
|
constructive algorithms
|
2400
|
| 297-B |
Fish Weight
|
constructive algorithms
greedy
|
1600
|
| 297-A |
Parity Game
|
constructive algorithms
|
1700
|
| 296-B |
Yaroslav and Two Strings
|
combinatorics
dp
|
2000
|
| 296-A |
Yaroslav and Permutations
|
greedy
math
|
1100
|
| 295-E |
Yaroslav and Points
|
data structures
|
2500
|
| 295-D |
Greg and Caves
|
combinatorics
dp
|
2400
|
| 295-C |
Greg and Friends
|
combinatorics
dp
graphs
+1
|
2100
|
| 295-B |
Greg and Graph
|
dp
graphs
shortest paths
|
1700
|
| 295-A |
Greg and Array
|
data structures
implementation
|
1400
|
| 294-E |
Shaass the Great
|
dp
trees
|
2300
|
| 294-D |
Shaass and Painter Robot
|
brute force
implementation
number theory
|
2500
|
| 294-C |
Shaass and Lights
|
combinatorics
number theory
|
1900
|
| 294-B |
Shaass and Bookshelf
|
dp
greedy
|
1700
|
| 294-A |
Shaass and Oskols
|
implementation
math
|
800
|
| 293-E |
Close Vertices
|
data structures
divide and conquer
trees
|
2700
|
| 293-D |
Ksusha and Square
|
geometry
math
probabilities
+1
|
2700
|
| 293-C |
Cube Problem
|
brute force
math
number theory
|
2400
|
| 293-B |
Distinct Paths
|
brute force
combinatorics
|
2700
|
| 293-A |
Weird Game
|
games
greedy
|
1500
|
| 292-E |
Copying Data
|
data structures
|
1900
|
| 292-D |
Connected Components
|
data structures
dfs and similar
dp
+1
|
1900
|
| 292-C |
Beautiful IP Addresses
|
brute force
|
2000
|
| 292-B |
Network Topology
|
graphs
implementation
|
1200
|
| 292-A |
SMSC
|
implementation
|
1100
|
| 291-E |
Tree-String Problem
|
*special
dfs and similar
hashing
+1
|
2000
|
| 291-D |
Parallel Programming
|
*special
greedy
|
1600
|
| 291-C |
Network Mask
|
*special
bitmasks
brute force
+1
|
1600
|
| 291-B |
Command Line Arguments
|
*special
implementation
strings
|
1300
|
| 291-A |
Spyke Talks
|
*special
implementation
sortings
|
800
|
| 290-F |
Greedy Petya
|
*special
dfs and similar
graphs
+1
|
2800
|
| 290-E |
HQ
|
*special
constructive algorithms
|
2500
|
| 290-D |
Orange
|
*special
implementation
|
1400
|
| 290-C |
WTF?
|
*special
graph matchings
implementation
+1
|
1700
|
| 290-B |
QR code
|
*special
implementation
|
1500
|
| 290-A |
Mysterious strings
|
*special
implementation
|
1400
|
| 289-B |
Polo the Penguin and Matrix
|
brute force
dp
implementation
+2
|
1400
|
| 289-A |
Polo the Penguin and Segments
|
brute force
implementation
|
1100
|