| 1184-D2 |
Parallel Universes (Hard)
|
math
matrices
|
3100
|
| 1184-D1 |
Parallel Universes (Easy)
|
implementation
|
1600
|
| 1184-C3 |
Heidi and the Turing Test (Hard)
|
|
3200
|
| 1184-C2 |
Heidi and the Turing Test (Medium)
|
data structures
|
2200
|
| 1184-C1 |
Heidi and the Turing Test (Easy)
|
implementation
|
1600
|
| 1184-B3 |
The Doctor Meets Vader (Hard)
|
flows
shortest paths
|
2700
|
| 1184-B2 |
The Doctor Meets Vader (Medium)
|
flows
graph matchings
graphs
+2
|
2200
|
| 1184-B1 |
The Doctor Meets Vader (Easy)
|
binary search
sortings
|
1400
|
| 1184-A3 |
Heidi Learns Hashing (Hard)
|
fft
math
number theory
|
3100
|
| 1184-A2 |
Heidi Learns Hashing (Medium)
|
brute force
number theory
|
2100
|
| 1184-A1 |
Heidi Learns Hashing (Easy)
|
brute force
math
number theory
|
1200
|
| 1183-H |
Subsequences (hard version)
|
dp
strings
|
1900
|
| 1183-G |
Candy Box (hard version)
|
greedy
implementation
sortings
|
2000
|
| 1183-F |
Topforces Strikes Back
|
brute force
math
sortings
|
2100
|
| 1183-E |
Subsequences (easy version)
|
dp
graphs
implementation
+1
|
2000
|
| 1183-D |
Candy Box (easy version)
|
greedy
sortings
|
1400
|
| 1183-C |
Computer Game
|
binary search
math
|
1400
|
| 1183-B |
Equalize Prices
|
math
|
900
|
| 1183-A |
Nearest Interesting Number
|
implementation
|
800
|
| 1182-F |
Maximum Sine
|
binary search
data structures
number theory
|
2700
|
| 1182-E |
Product Oriented Recurrence
|
dp
math
matrices
+1
|
2300
|
| 1182-D |
Complete Mirror
|
constructive algorithms
dfs and similar
dp
+3
|
2400
|
| 1182-C |
Beautiful Lyrics
|
data structures
greedy
strings
|
1700
|
| 1182-B |
Plus from Picture
|
dfs and similar
implementation
strings
|
1300
|
| 1182-A |
Filling Shapes
|
dp
math
|
1000
|
| 1181-E2 |
A Story of One Country (Hard)
|
brute force
greedy
sortings
|
3000
|
| 1181-E1 |
A Story of One Country (Easy)
|
brute force
divide and conquer
sortings
|
2500
|
| 1181-D |
Irrigation
|
binary search
data structures
implementation
+3
|
2200
|
| 1181-C |
Flag
|
brute force
combinatorics
dp
+1
|
1900
|
| 1181-B |
Split a Number
|
greedy
implementation
strings
|
1500
|
| 1181-A |
Chunga-Changa
|
greedy
math
|
1000
|
| 1180-B |
Nick and Array
|
greedy
implementation
|
1500
|
| 1180-A |
Alex and a Rhombus
|
dp
implementation
math
|
800
|
| 1179-E |
Alesya and Discrete Math
|
divide and conquer
interactive
|
3200
|
| 1179-D |
Fedor Runs for President
|
data structures
dp
trees
|
2700
|
| 1179-C |
Serge and Dining Room
|
binary search
data structures
graph matchings
+4
|
2200
|
| 1179-B |
Tolik and His Uncle
|
constructive algorithms
|
1800
|
| 1179-A |
Valeriy and Deque
|
data structures
implementation
|
1500
|
| 1178-H |
Stock Exchange
|
binary search
flows
graphs
|
3500
|
| 1178-G |
The Awesomest Vertex
|
data structures
dfs and similar
|
3000
|
| 1178-F2 |
Long Colorful Strip
|
dp
|
2600
|
| 1178-F1 |
Short Colorful Strip
|
combinatorics
dfs and similar
dp
|
2200
|
| 1178-E |
Archaeology
|
brute force
constructive algorithms
greedy
+1
|
1900
|
| 1178-D |
Prime Graph
|
constructive algorithms
greedy
math
+1
|
1500
|
| 1178-C |
Tiles
|
combinatorics
greedy
math
|
1300
|
| 1178-B |
WOW Factor
|
dp
strings
|
1300
|
| 1178-A |
Prime Minister
|
greedy
|
800
|
| 1177-B |
Digits Sequence (Hard Edition)
|
binary search
divide and conquer
implementation
|
1800
|
| 1177-A |
Digits Sequence (Easy Edition)
|
implementation
|
1000
|
| 1176-F |
Destroy it!
|
dp
implementation
sortings
|
2100
|