| 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
|
| 1002-B2 |
Distinguish GHZ state and W state
|
*special
|
1600
|
| 1002-B1 |
Distinguish zero state and W state
|
*special
|
1300
|
| 1002-A4 |
Generate W state
|
*special
|
1900
|
| 1002-A3 |
Generate superposition of two basis states
|
*special
|
1500
|
| 1002-A2 |
Generate superposition of zero state and a basis state
|
*special
|
1300
|
| 1002-A1 |
Generate superposition of all basis states
|
*special
|
800
|
| 1001-I |
Deutsch-Jozsa algorithm
|
*special
|
1700
|
| 1001-H |
Oracle for f(x) = parity of the number of 1s in x
|
*special
|
1200
|
| 1001-G |
Oracle for f(x) = k-th element of x
|
*special
|
1400
|
| 1001-F |
Distinguish multi-qubit basis states
|
*special
|
1300
|
| 1001-E |
Distinguish Bell states
|
*special
|
1600
|
| 1001-D |
Distinguish plus state and minus state
|
*special
|
1400
|
| 1001-C |
Generate GHZ state
|
*special
|
1400
|
| 1001-B |
Generate Bell state
|
*special
|
1400
|
| 1001-A |
Generate plus state or minus state
|
*special
|
1100
|
| 1000-G |
Two-Paths
|
data structures
dp
trees
|
2700
|
| 1000-F |
One Occurrence
|
data structures
divide and conquer
|
2400
|
| 1000-E |
We Need More Bosses
|
dfs and similar
graphs
trees
|
2100
|
| 1000-D |
Yet Another Problem On a Subsequence
|
combinatorics
dp
|
1900
|
| 1000-C |
Covered Points Count
|
data structures
implementation
sortings
|
1700
|
| 1000-B |
Light It Up
|
greedy
|
1500
|
| 1000-A |
Codehorses T-shirts
|
greedy
implementation
|
1200
|
| 999-F |
Cards and Joy
|
dp
|
2000
|
| 999-E |
Reachability from the Capital
|
dfs and similar
graphs
greedy
|
2000
|
| 999-D |
Equalize the Remainders
|
data structures
greedy
implementation
|
1900
|
| 999-C |
Alphabetic Removals
|
implementation
|
1200
|
| 999-B |
Reversing Encryption
|
implementation
|
900
|
| 999-A |
Mishka and Contest
|
brute force
implementation
|
800
|
| 998-B |
Cutting
|
dp
greedy
sortings
|
1200
|
| 998-A |
Balloons
|
constructive algorithms
implementation
|
1000
|
| 997-E |
Good Subsegments
|
data structures
|
3000
|
| 997-D |
Cycles in product
|
combinatorics
divide and conquer
trees
|
2900
|
| 997-C |
Sky Full of Stars
|
combinatorics
math
|
2500
|
| 997-B |
Roman Digits
|
brute force
combinatorics
dp
+2
|
2000
|
| 997-A |
Convert to Ones
|
brute force
greedy
implementation
+1
|
1500
|
| 996-B |
World Cup
|
binary search
math
|
1300
|
| 996-A |
Hit the Lottery
|
dp
greedy
|
800
|