| 22-D |
Segments
|
greedy
sortings
|
1900
|
| 22-C |
System Administrator
|
graphs
|
1700
|
| 22-B |
Bargaining Table
|
brute force
dp
|
1500
|
| 22-A |
Second Order Statistics
|
brute force
|
800
|
| 21-D |
Traveling Graph
|
bitmasks
graph matchings
graphs
|
2400
|
| 21-C |
Stripe 2
|
binary search
dp
sortings
|
2000
|
| 21-B |
Intersection
|
implementation
math
|
2000
|
| 21-A |
Jabber ID
|
implementation
strings
|
1900
|
| 20-C |
Dijkstra?
|
graphs
shortest paths
|
1900
|
| 20-B |
Equation
|
math
|
2000
|
| 20-A |
BerOS file system
|
implementation
|
1700
|
| 19-E |
Fairy
|
dfs and similar
divide and conquer
dsu
|
2900
|
| 19-D |
Points
|
data structures
|
2800
|
| 19-C |
Deletion of Repeats
|
greedy
hashing
string suffix structures
|
2200
|
| 19-B |
Checkout Assistant
|
dp
|
1900
|
| 19-A |
World Football Cup
|
implementation
|
1400
|
| 18-E |
Flag 2
|
dp
|
2000
|
| 18-D |
Seller Bob
|
brute force
dp
greedy
|
2000
|
| 18-C |
Stripe
|
data structures
implementation
|
1200
|
| 18-B |
Platforms
|
brute force
math
|
1700
|
| 18-A |
Triangle
|
brute force
geometry
|
1500
|
| 17-E |
Palisection
|
strings
|
2900
|
| 17-D |
Notepad
|
number theory
|
2400
|
| 17-C |
Balance
|
dp
|
2500
|
| 17-B |
Hierarchy
|
dfs and similar
dsu
greedy
+1
|
1500
|
| 17-A |
Noldbach problem
|
brute force
math
number theory
|
1000
|
| 16-E |
Fish
|
bitmasks
dp
probabilities
|
1900
|
| 16-D |
Logging
|
implementation
strings
|
1900
|
| 16-C |
Monitor
|
binary search
number theory
|
1800
|
| 16-B |
Burglar and Matches
|
greedy
implementation
sortings
|
900
|
| 16-A |
Flag
|
implementation
|
800
|
| 15-E |
Triangles
|
combinatorics
dp
|
2600
|
| 15-D |
Map
|
data structures
implementation
sortings
|
2500
|
| 15-C |
Industrial Nim
|
games
|
2000
|
| 15-B |
Laser
|
math
|
1800
|
| 15-A |
Cottage Village
|
implementation
sortings
|
1200
|
| 14-E |
Camels
|
dp
|
1900
|
| 14-D |
Two Paths
|
dfs and similar
dp
graphs
+3
|
1900
|
| 14-C |
Four Segments
|
brute force
constructive algorithms
geometry
+2
|
1700
|
| 14-B |
Young Photographer
|
implementation
|
1000
|
| 14-A |
Letter
|
implementation
|
800
|
| 13-E |
Holes
|
data structures
dsu
|
2700
|
| 13-D |
Triangles
|
dp
geometry
|
2600
|
| 13-C |
Sequence
|
dp
sortings
|
2200
|
| 13-B |
Letter A
|
geometry
implementation
|
2000
|
| 13-A |
Numbers
|
implementation
math
|
1000
|
| 12-E |
Start of the session
|
constructive algorithms
|
2100
|
| 12-D |
Ball
|
data structures
sortings
|
2400
|
| 12-C |
Fruits
|
greedy
implementation
sortings
|
1100
|
| 12-B |
Correct Solution?
|
implementation
sortings
|
1100
|