| 1360-C |
Similar Pairs
|
constructive algorithms
graph matchings
greedy
+1
|
1100
|
| 1360-B |
Honest Coach
|
greedy
sortings
|
800
|
| 1360-A |
Minimal Square
|
greedy
math
|
800
|
| 1359-F |
RC Kaboom Show
|
binary search
brute force
data structures
+2
|
2900
|
| 1359-E |
Modular Stability
|
combinatorics
math
number theory
|
2000
|
| 1359-D |
Yet Another Yet Another Task
|
data structures
dp
implementation
+1
|
2000
|
| 1359-C |
Mixing Water
|
binary search
math
|
1700
|
| 1359-B |
New Theatre Square
|
brute force
dp
greedy
+2
|
1000
|
| 1359-A |
Berland Poker
|
brute force
greedy
math
|
1000
|
| 1358-F |
Tasty Cookie
|
binary search
constructive algorithms
greedy
+1
|
2700
|
| 1358-E |
Are You Fired?
|
constructive algorithms
data structures
greedy
+1
|
2400
|
| 1358-D |
The Best Vacation
|
binary search
brute force
greedy
+2
|
1900
|
| 1358-C |
Celex Update
|
math
|
1600
|
| 1358-B |
Maria Breaks the Self-isolation
|
greedy
sortings
|
1000
|
| 1358-A |
Park Lighting
|
greedy
math
|
800
|
| 1357-E2 |
Root of quantum Fourier transform
|
*special
|
—
|
| 1357-E1 |
Power of quantum Fourier transform
|
*special
|
—
|
| 1357-D5 |
Quantum Classification - Dataset 7
|
*special
|
—
|
| 1357-D4 |
Quantum Classification - Dataset 6
|
*special
|
—
|
| 1357-D3 |
Quantum Classification - Dataset 5
|
*special
|
—
|
| 1357-D2 |
Quantum Classification - Dataset 4
|
*special
|
—
|
| 1357-D1 |
Quantum Classification - Dataset 3
|
*special
|
—
|
| 1357-C2 |
Prepare superposition of basis states with the same parity
|
*special
|
—
|
| 1357-C1 |
Prepare superposition of basis states with 0s
|
*special
|
—
|
| 1357-B2 |
"Is the number divisible by 3?" oracle
|
*special
|
—
|
| 1357-B1 |
"Is the bit string balanced?" oracle
|
*special
|
—
|
| 1357-A7 |
Distinguish Y, XZ, -Y and -XZ
|
*special
|
—
|
| 1357-A6 |
Distinguish four Pauli gates
|
*special
|
—
|
| 1357-A5 |
Distinguish Rz(θ) from Ry(θ)
|
*special
|
—
|
| 1357-A4 |
Distinguish Rz from R1
|
*special
|
—
|
| 1357-A3 |
Distinguish H from X
|
*special
|
—
|
| 1357-A2 |
Distinguish I, CNOTs and SWAP
|
*special
|
—
|
| 1357-A1 |
Figure out direction of CNOT
|
*special
|
—
|
| 1356-D2 |
Quantum Classification - 2
|
*special
|
—
|
| 1356-D1 |
Quantum Classification - 1
|
*special
|
—
|
| 1356-C |
Prepare state |01⟩ + |10⟩ + |11⟩
|
*special
|
—
|
| 1356-B2 |
Decrement
|
*special
|
—
|
| 1356-B1 |
Increment
|
*special
|
—
|
| 1356-A5 |
Distinguish Z from -Z
|
*special
|
—
|
| 1356-A4 |
Distinguish I ⊗ X from CNOT
|
*special
|
—
|
| 1356-A3 |
Distinguish Z from S
|
*special
|
—
|
| 1356-A2 |
Distinguish I from Z
|
*special
|
—
|
| 1356-A1 |
Distinguish I from X
|
*special
|
—
|
| 1355-F |
Guess Divisors Count
|
constructive algorithms
interactive
number theory
|
2600
|
| 1355-E |
Restorer Distance
|
binary search
greedy
math
+2
|
2100
|
| 1355-D |
Game With Array
|
constructive algorithms
math
|
1400
|
| 1355-C |
Count Triangles
|
binary search
implementation
math
+1
|
1800
|
| 1355-B |
Young Explorers
|
dp
greedy
sortings
|
1200
|
| 1355-A |
Sequence with Digits
|
brute force
implementation
math
|
1200
|
| 1354-G |
Find a Gift
|
binary search
interactive
probabilities
|
2600
|