| 33-D |
Knights
|
geometry
graphs
shortest paths
+1
|
2000
|
| 33-C |
Wonderful Randomized Sum
|
greedy
|
1800
|
| 33-B |
String Problem
|
shortest paths
|
1800
|
| 33-A |
What is for dinner?
|
greedy
implementation
|
1200
|
| 32-E |
Hide-and-Seek
|
geometry
implementation
|
2400
|
| 32-D |
Constellation
|
implementation
|
1600
|
| 32-C |
Flea
|
math
|
1700
|
| 32-B |
Borze
|
expression parsing
implementation
|
800
|
| 32-A |
Reconnaissance
|
brute force
|
800
|
| 31-E |
TV Game
|
dp
|
2400
|
| 31-D |
Chocolate
|
dfs and similar
implementation
|
2000
|
| 31-C |
Schedule
|
implementation
|
1700
|
| 31-B |
Sysadmin Bob
|
greedy
implementation
strings
|
1500
|
| 31-A |
Worms Evolution
|
implementation
|
1200
|
| 30-E |
Tricky and Clever Password
|
binary search
constructive algorithms
data structures
+3
|
2800
|
| 30-D |
King's Problem?
|
geometry
greedy
|
2600
|
| 30-C |
Shooting Gallery
|
dp
probabilities
|
1800
|
| 30-B |
Codeforces World Finals
|
implementation
|
1700
|
| 30-A |
Accounting
|
brute force
math
|
1400
|
| 29-E |
Quarrel
|
graphs
shortest paths
|
2400
|
| 29-D |
Ant on the Tree
|
constructive algorithms
dfs and similar
trees
|
2000
|
| 29-C |
Mail Stamps
|
data structures
dfs and similar
graphs
+1
|
1700
|
| 29-B |
Traffic Lights
|
implementation
|
1500
|
| 29-A |
Spit Problem
|
brute force
|
1000
|
| 28-E |
DravDe saves the world
|
geometry
math
|
2800
|
| 28-D |
Don't fear, DravDe is kind
|
binary search
data structures
dp
+1
|
2400
|
| 28-C |
Bath Queue
|
combinatorics
dp
probabilities
|
2200
|
| 28-B |
pSort
|
dfs and similar
dsu
graphs
|
1600
|
| 28-A |
Bender Problem
|
implementation
|
1600
|
| 27-E |
Number With The Given Amount Of Divisors
|
brute force
dp
number theory
|
2000
|
| 27-D |
Ring Road 2
|
2-sat
dfs and similar
dsu
+1
|
2200
|
| 27-C |
Unordered Subsequence
|
constructive algorithms
greedy
|
1900
|
| 27-B |
Tournament
|
bitmasks
brute force
dfs and similar
+1
|
1300
|
| 27-A |
Next Test
|
implementation
sortings
|
1200
|
| 26-E |
Multithreading
|
constructive algorithms
|
2400
|
| 26-D |
Tickets
|
combinatorics
math
probabilities
|
2400
|
| 26-C |
Parquet
|
combinatorics
constructive algorithms
greedy
+1
|
2000
|
| 26-B |
Regular Bracket Sequence
|
greedy
|
1400
|
| 26-A |
Almost Prime
|
number theory
|
900
|
| 25-E |
Test
|
hashing
strings
|
2200
|
| 25-D |
Roads not only in Berland
|
dsu
graphs
trees
|
1900
|
| 25-C |
Roads in Berland
|
graphs
shortest paths
|
1900
|
| 25-B |
Phone numbers
|
implementation
|
1100
|
| 25-A |
IQ test
|
brute force
|
1300
|
| 24-E |
Berland collider
|
binary search
|
2300
|
| 24-D |
Broken robot
|
dp
math
probabilities
|
2400
|
| 24-C |
Sequence of points
|
geometry
implementation
math
|
1800
|
| 24-B |
F1 Champions
|
implementation
|
1500
|
| 24-A |
Ring road
|
graphs
|
1400
|
| 23-E |
Tree
|
dp
|
2500
|