| 475-F |
Meta-universe
|
data structures
|
2900
|
| 475-E |
Strongly Connected City 2
|
dfs and similar
|
2700
|
| 475-D |
CGCDSSQ
|
brute force
data structures
math
|
2000
|
| 475-C |
Kamal-ol-molk's Painting
|
brute force
constructive algorithms
greedy
|
2100
|
| 475-B |
Strongly Connected City
|
brute force
dfs and similar
graphs
+1
|
1400
|
| 475-A |
Bayan Bus
|
implementation
|
1100
|
| 474-F |
Ant colony
|
data structures
math
number theory
|
2100
|
| 474-E |
Pillars
|
binary search
data structures
dp
+2
|
2000
|
| 474-D |
Flowers
|
dp
|
1700
|
| 474-C |
Captain Marmot
|
brute force
geometry
|
2000
|
| 474-B |
Worms
|
binary search
implementation
|
1200
|
| 474-A |
Keyboard
|
implementation
|
900
|
| 472-G |
Design Tutorial: Increase the Constraints
|
bitmasks
data structures
fft
|
2800
|
| 472-F |
Design Tutorial: Change the Goal
|
constructive algorithms
math
matrices
|
2700
|
| 472-E |
Design Tutorial: Learn from a Game
|
constructive algorithms
implementation
|
2800
|
| 472-D |
Design Tutorial: Inverse the Problem
|
dfs and similar
dsu
shortest paths
+1
|
1900
|
| 472-C |
Design Tutorial: Make It Nondeterministic
|
greedy
|
1400
|
| 472-B |
Design Tutorial: Learn from Life
|
|
1300
|
| 472-A |
Design Tutorial: Learn from Math
|
math
number theory
|
800
|
| 471-E |
MUH and Lots and Lots of Segments
|
data structures
dsu
|
2700
|
| 471-D |
MUH and Cube Walls
|
string suffix structures
strings
|
1800
|
| 471-C |
MUH and House of Cards
|
binary search
brute force
greedy
+1
|
1700
|
| 471-B |
MUH and Important Things
|
implementation
sortings
|
1300
|
| 471-A |
MUH and Sticks
|
implementation
|
1100
|
| 470-H |
Array Sorting
|
*special
|
2300
|
| 470-G |
Hamming Distance
|
*special
|
2300
|
| 470-F |
Pairwise Sums
|
*special
|
2300
|
| 470-E |
Chessboard
|
*special
|
1900
|
| 470-D |
Caesar Cipher
|
*special
|
1900
|
| 470-C |
Eval
|
*special
|
1900
|
| 470-B |
Hexakosioihexekontahexaphobia
|
*special
|
1800
|
| 470-A |
Crystal Ball Sequence
|
*special
implementation
|
1400
|
| 469-B |
Chat Online
|
implementation
|
1300
|
| 469-A |
I Wanna Be the Guy
|
greedy
implementation
|
800
|
| 468-E |
Permanent
|
dp
graph matchings
math
+1
|
3100
|
| 468-D |
Tree
|
graph matchings
|
3100
|
| 468-C |
Hack it!
|
binary search
constructive algorithms
math
|
2500
|
| 468-B |
Two Sets
|
2-sat
dfs and similar
dsu
+2
|
2000
|
| 468-A |
24 Game
|
constructive algorithms
greedy
math
|
1500
|
| 467-E |
Alex and Complicated Task
|
data structures
dp
greedy
|
2300
|
| 467-D |
Fedor and Essay
|
dfs and similar
dp
graphs
+2
|
2400
|
| 467-C |
George and Job
|
dp
implementation
|
1700
|
| 467-B |
Fedor and New Game
|
bitmasks
brute force
constructive algorithms
+1
|
1100
|
| 467-A |
George and Accommodation
|
implementation
|
800
|
| 466-E |
Information Graph
|
dfs and similar
dsu
graphs
+1
|
2100
|
| 466-D |
Increase Sequence
|
combinatorics
dp
|
2100
|
| 466-C |
Number of Ways
|
binary search
brute force
data structures
+2
|
1700
|
| 466-B |
Wonder Room
|
brute force
math
|
2000
|
| 466-A |
Cheap Travel
|
implementation
|
1200
|
| 465-B |
Inbox (100500)
|
implementation
|
1000
|