| 1619-C |
Wrong Addition
|
implementation
|
1200
|
| 1619-B |
Squares and Cubes
|
implementation
math
|
800
|
| 1619-A |
Square String?
|
implementation
strings
|
800
|
| 1618-G |
Trader Problem
|
data structures
dsu
greedy
+1
|
2200
|
| 1618-F |
Reverse
|
bitmasks
constructive algorithms
dfs and similar
+3
|
2000
|
| 1618-E |
Singers' Tour
|
constructive algorithms
math
|
1700
|
| 1618-D |
Array and Operations
|
dp
greedy
math
|
1300
|
| 1618-C |
Paint the Array
|
math
|
1100
|
| 1618-B |
Missing Bigram
|
implementation
|
800
|
| 1618-A |
Polycarp and Sums of Subsequences
|
math
sortings
|
800
|
| 1617-E |
Christmas Chocolates
|
dfs and similar
dp
games
+6
|
2700
|
| 1617-D2 |
Too Many Impostors (hard version)
|
constructive algorithms
implementation
interactive
+1
|
2400
|
| 1617-D1 |
Too Many Impostors (easy version)
|
constructive algorithms
implementation
interactive
|
1800
|
| 1617-C |
Paprika and Permutation
|
binary search
greedy
math
+1
|
1300
|
| 1617-B |
GCD Problem
|
brute force
constructive algorithms
math
+1
|
900
|
| 1617-A |
Forbidden Subsequence
|
constructive algorithms
greedy
sortings
+1
|
800
|
| 1616-H |
Keep XOR Low
|
bitmasks
combinatorics
data structures
+3
|
3000
|
| 1616-G |
Just Add an Edge
|
dfs and similar
dp
graphs
|
3500
|
| 1616-F |
Tricolor Triangles
|
brute force
graphs
math
+1
|
2900
|
| 1616-E |
Lexicographically Small Enough
|
brute force
data structures
greedy
+1
|
2200
|
| 1616-D |
Keep the Average High
|
dp
greedy
math
|
2000
|
| 1616-C |
Representative Edges
|
brute force
geometry
implementation
+1
|
1500
|
| 1616-B |
Mirror in the String
|
greedy
strings
|
1100
|
| 1616-A |
Integer Diversity
|
implementation
|
800
|
| 1615-H |
Reindeer Games
|
binary search
constructive algorithms
data structures
+4
|
3000
|
| 1615-G |
Maximum Adjacent Pairs
|
constructive algorithms
graph matchings
|
3300
|
| 1615-F |
LEGOndary Grandmaster
|
combinatorics
dp
math
|
2800
|
| 1615-E |
Purple Crayon
|
data structures
dfs and similar
games
+5
|
2400
|
| 1615-D |
X(or)-mas Tree
|
bitmasks
dfs and similar
dsu
+2
|
2200
|
| 1615-C |
Menorah
|
brute force
graphs
greedy
+1
|
1600
|
| 1615-B |
And It's Non-Zero
|
bitmasks
greedy
math
|
1300
|
| 1615-A |
Closing The Gap
|
greedy
math
|
800
|
| 1614-E |
Divan and a Cottage
|
binary search
data structures
|
2600
|
| 1614-D2 |
Divan and Kostomuksha (hard version)
|
dp
number theory
|
2300
|
| 1614-D1 |
Divan and Kostomuksha (easy version)
|
dp
number theory
|
2100
|
| 1614-C |
Divan and bitwise operations
|
bitmasks
combinatorics
constructive algorithms
+2
|
1500
|
| 1614-B |
Divan and a New Project
|
constructive algorithms
sortings
|
1000
|
| 1614-A |
Divan and a Store
|
brute force
constructive algorithms
greedy
|
800
|
| 1613-F |
Tree Coloring
|
combinatorics
divide and conquer
fft
|
2600
|
| 1613-E |
Crazy Robot
|
dfs and similar
graphs
|
2000
|
| 1613-D |
MEX Sequences
|
dp
math
|
1900
|
| 1613-C |
Poisoned Dagger
|
binary search
|
1200
|
| 1613-B |
Absent Remainder
|
greedy
implementation
sortings
|
1000
|
| 1613-A |
Long Comparison
|
implementation
math
|
900
|
| 1612-G |
Max Sum Array
|
combinatorics
constructive algorithms
greedy
+1
|
2500
|
| 1612-F |
Armor and Weapons
|
brute force
dp
greedy
+1
|
2800
|
| 1612-E |
Messages
|
brute force
dp
greedy
+2
|
2000
|
| 1612-D |
X-Magic Pair
|
math
number theory
|
1600
|
| 1612-C |
Chat Ban
|
binary search
math
|
1300
|
| 1612-B |
Special Permutation
|
constructive algorithms
greedy
|
900
|