| 1010-B |
Rocket
|
binary search
interactive
|
1800
|
| 1010-A |
Fly
|
binary search
math
|
1500
|
| 1009-G |
Allowed Letters
|
bitmasks
flows
graph matchings
+2
|
2400
|
| 1009-F |
Dominant Indices
|
data structures
dsu
trees
|
2300
|
| 1009-E |
Intercity Travelling
|
combinatorics
math
probabilities
|
2000
|
| 1009-D |
Relatively Prime Graph
|
brute force
constructive algorithms
graphs
+2
|
1700
|
| 1009-C |
Annoying Present
|
greedy
math
|
1700
|
| 1009-B |
Minimum Ternary String
|
greedy
implementation
|
1400
|
| 1009-A |
Game Shopping
|
implementation
|
800
|
| 1008-B |
Turn the Rectangles
|
greedy
sortings
|
1000
|
| 1008-A |
Romaji
|
implementation
strings
|
900
|
| 1007-E |
Mini Metro
|
dp
|
3400
|
| 1007-D |
Ants
|
2-sat
data structures
trees
|
3200
|
| 1007-C |
Guess two numbers
|
binary search
interactive
|
3000
|
| 1007-B |
Pave the Parallelepiped
|
bitmasks
brute force
combinatorics
+2
|
2400
|
| 1007-A |
Reorder the Array
|
combinatorics
data structures
math
+2
|
1300
|
| 1006-F |
Xor-Paths
|
bitmasks
brute force
dp
+1
|
2100
|
| 1006-E |
Military Problem
|
dfs and similar
graphs
trees
|
1600
|
| 1006-D |
Two Strings Swaps
|
implementation
|
1700
|
| 1006-C |
Three Parts of the Array
|
binary search
data structures
two pointers
|
1200
|
| 1006-B |
Polycarp's Practice
|
greedy
implementation
sortings
|
1200
|
| 1006-A |
Adjacent Replacements
|
implementation
|
800
|
| 1005-F |
Berland and the Shortest Paths
|
brute force
dfs and similar
graphs
+1
|
2100
|
| 1005-E2 |
Median on Segments (General Case Edition)
|
sortings
|
2400
|
| 1005-E1 |
Median on Segments (Permutations Edition)
|
sortings
|
1800
|
| 1005-D |
Polycarp and Div 3
|
dp
greedy
number theory
|
1500
|
| 1005-C |
Summarize to the Power of Two
|
brute force
greedy
implementation
|
1300
|
| 1005-B |
Delete from the Left
|
brute force
implementation
strings
|
900
|
| 1005-A |
Tanya and Stairways
|
implementation
|
800
|
| 1004-F |
Sonya and Bitwise OR
|
bitmasks
data structures
divide and conquer
|
2600
|
| 1004-E |
Sonya and Ice Cream
|
binary search
data structures
dp
+3
|
2400
|
| 1004-D |
Sonya and Matrix
|
brute force
constructive algorithms
implementation
|
2300
|
| 1004-C |
Sonya and Robots
|
constructive algorithms
implementation
|
1400
|
| 1004-B |
Sonya and Exhibition
|
constructive algorithms
greedy
implementation
+1
|
1300
|
| 1004-A |
Sonya and Hotels
|
implementation
|
900
|
| 1003-F |
Abbreviation
|
dp
hashing
strings
|
2200
|
| 1003-E |
Tree Constructing
|
constructive algorithms
graphs
|
2100
|
| 1003-D |
Coins and Queries
|
greedy
|
1600
|
| 1003-C |
Intense Heat
|
brute force
implementation
math
|
1300
|
| 1003-B |
Binary String Constructing
|
constructive algorithms
|
1300
|
| 1003-A |
Polycarp's Pockets
|
implementation
|
800
|
| 1002-E2 |
Another array reconstruction algorithm
|
*special
|
1900
|
| 1002-E1 |
Bernstein-Vazirani algorithm
|
*special
|
1500
|
| 1002-D3 |
Oracle for majority function
|
*special
|
1600
|
| 1002-D2 |
Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2
|
*special
|
1300
|
| 1002-D1 |
Oracle for f(x) = b * x mod 2
|
*special
|
1200
|
| 1002-C2 |
Distinguish zero state and plus state without errors
|
*special
|
1800
|
| 1002-C1 |
Distinguish zero state and plus state with minimum error
|
*special
|
1700
|
| 1002-B4 |
Distinguish four 2-qubit states - 2
|
*special
|
1700
|
| 1002-B3 |
Distinguish four 2-qubit states
|
*special
|
1600
|