| 1292-D |
Chaotic V.
|
dp
graphs
greedy
+3
|
2700
|
| 1292-C |
Xenon's Attack on the Gangs
|
combinatorics
dfs and similar
dp
+2
|
2300
|
| 1292-B |
Aroma's Search
|
brute force
constructive algorithms
geometry
+2
|
1700
|
| 1292-A |
NEKO's Maze Game
|
data structures
dsu
implementation
|
1400
|
| 1291-F |
Coffee Varieties (easy version)
|
graphs
interactive
|
2800
|
| 1291-B |
Array Sharpening
|
greedy
implementation
|
1300
|
| 1291-A |
Even But Not Even
|
greedy
math
strings
|
900
|
| 1290-F |
Making Shapes
|
dp
|
3500
|
| 1290-E |
Cartesian Tree
|
data structures
|
3300
|
| 1290-D |
Coffee Varieties (hard version)
|
constructive algorithms
graphs
interactive
|
3000
|
| 1290-C |
Prefix Enlightenment
|
dfs and similar
dsu
graphs
|
2400
|
| 1290-B |
Irreducible Anagrams
|
binary search
constructive algorithms
data structures
+2
|
1800
|
| 1290-A |
Mind Control
|
brute force
data structures
implementation
|
1600
|
| 1288-F |
Red-Blue Graph
|
constructive algorithms
flows
|
2900
|
| 1288-E |
Messenger Simulator
|
data structures
|
2000
|
| 1288-D |
Minimax Problem
|
binary search
bitmasks
dp
|
2000
|
| 1288-C |
Two Arrays
|
combinatorics
dp
|
1600
|
| 1288-B |
Yet Another Meme Problem
|
math
|
1100
|
| 1288-A |
Deadline
|
binary search
brute force
math
+1
|
1100
|
| 1287-B |
Hyperset
|
brute force
data structures
implementation
|
1500
|
| 1287-A |
Angry Students
|
greedy
implementation
|
800
|
| 1286-F |
Harry The Potter
|
brute force
constructive algorithms
dp
+3
|
3100
|
| 1286-E |
Fedya the Potter Strikes Back
|
data structures
strings
|
3200
|
| 1286-D |
LCC
|
data structures
math
matrices
+1
|
3100
|
| 1286-C2 |
Madhouse (Hard version)
|
brute force
constructive algorithms
hashing
+2
|
2800
|
| 1286-C1 |
Madhouse (Easy version)
|
brute force
constructive algorithms
interactive
+1
|
2400
|
| 1286-B |
Numbers on Tree
|
constructive algorithms
data structures
dfs and similar
+3
|
1800
|
| 1286-A |
Garland
|
dp
greedy
sortings
|
1800
|
| 1285-F |
Classical?
|
binary search
combinatorics
number theory
|
2900
|
| 1285-E |
Delete a Segment
|
brute force
constructive algorithms
data structures
+5
|
2300
|
| 1285-D |
Dr. Evil Underscores
|
bitmasks
brute force
dfs and similar
+5
|
1900
|
| 1285-C |
Fadi and LCM
|
brute force
math
number theory
|
1400
|
| 1285-B |
Just Eat It!
|
dp
greedy
implementation
|
1300
|
| 1285-A |
Mezo Playing Zoma
|
math
|
800
|
| 1284-G |
Seollal
|
graphs
|
3300
|
| 1284-F |
New Year and Social Network
|
data structures
graph matchings
graphs
+2
|
3200
|
| 1284-E |
New Year and Castle Construction
|
combinatorics
geometry
math
+1
|
2500
|
| 1284-D |
New Year and Conference
|
binary search
data structures
hashing
+1
|
2100
|
| 1284-C |
New Year and Permutation
|
combinatorics
math
|
1600
|
| 1284-B |
New Year and Ascent Sequence
|
binary search
combinatorics
data structures
+3
|
1400
|
| 1284-A |
New Year and Naming
|
implementation
strings
|
800
|
| 1283-F |
DIY Garland
|
constructive algorithms
greedy
trees
|
2200
|
| 1283-E |
New Year Parties
|
dp
greedy
|
1800
|
| 1283-D |
Christmas Trees
|
graphs
greedy
shortest paths
|
1800
|
| 1283-C |
Friends and Gifts
|
constructive algorithms
data structures
math
|
1500
|
| 1283-B |
Candies Division
|
math
|
900
|
| 1283-A |
Minutes Before the New Year
|
math
|
800
|
| 1282-E |
The Cake Is a Lie
|
constructive algorithms
data structures
dfs and similar
+1
|
2400
|
| 1282-D |
Enchanted Artifact
|
constructive algorithms
interactive
strings
|
2300
|
| 1282-C |
Petya and Exam
|
greedy
sortings
two pointers
|
1800
|