|
4474 |
P1000C
Covered Points Count
|
0 / 0 |
5 |
|
4473 |
P1000D
Yet Another Problem On a Subsequence
|
0 / 0 |
6 |
|
4472 |
P1000E
We Need More Bosses
|
0 / 0 |
7 |
|
4471 |
P1000F
One Occurrence
|
0 / 0 |
9 |
|
4470 |
P1000G
Two-Paths
|
0 / 0 |
10 |
|
4469 |
P1001A
Generate plus state or minus state
|
0 / 0 |
3 |
|
4468 |
P1001B
Generate Bell state
|
0 / 0 |
4 |
|
4467 |
P1001C
Generate GHZ state
|
0 / 0 |
4 |
|
4466 |
P1001D
Distinguish plus state and minus state
|
0 / 0 |
4 |
|
4465 |
P1001E
Distinguish Bell states
|
0 / 0 |
5 |
|
4464 |
P1001F
Distinguish multi-qubit basis states
|
0 / 0 |
4 |
|
4463 |
P1001G
Oracle for f(x) = k-th element of x
|
0 / 0 |
4 |
|
4462 |
P1001H
Oracle for f(x) = parity of the number of 1s in x
|
0 / 0 |
4 |
|
4461 |
P1001I
Deutsch-Jozsa algorithm
|
0 / 0 |
5 |
|
4460 |
P1002A1
Generate superposition of all basis states
|
0 / 0 |
3 |
|
4459 |
P1002A2
Generate superposition of zero state and a basis state
|
0 / 0 |
4 |
|
4458 |
P1002A3
Generate superposition of two basis states
|
0 / 0 |
5 |
|
4457 |
P1002A4
Generate W state
|
0 / 0 |
6 |
|
4456 |
P1002B1
Distinguish zero state and W state
|
0 / 0 |
4 |
|
4455 |
P1002B2
Distinguish GHZ state and W state
|
0 / 0 |
5 |
|
4454 |
P1002B3
Distinguish four 2-qubit states
|
0 / 0 |
5 |
|
4453 |
P1002B4
Distinguish four 2-qubit states - 2
|
0 / 0 |
5 |
|
4452 |
P1002C1
Distinguish zero state and plus state with minimum error
|
0 / 0 |
5 |
|
4451 |
P1002C2
Distinguish zero state and plus state without errors
|
0 / 0 |
6 |
|
4450 |
P1002D1
Oracle for f(x) = b * x mod 2
|
0 / 0 |
4 |
|
4449 |
P1002D2
Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2
|
0 / 0 |
4 |
|
4448 |
P1002D3
Oracle for majority function
|
0 / 0 |
5 |
|
4447 |
P1002E1
Bernstein-Vazirani algorithm
|
0 / 0 |
5 |
|
4446 |
P1002E2
Another array reconstruction algorithm
|
0 / 0 |
6 |
|
4445 |
P1003A
Polycarp's Pockets
|
0 / 0 |
3 |
|
4444 |
P1003B
Binary String Constructing
|
0 / 0 |
4 |
|
4443 |
P1003C
Intense Heat
|
0 / 0 |
4 |
|
4442 |
P1003D
Coins and Queries
|
0 / 0 |
5 |
|
4441 |
P1003E
Tree Constructing
|
0 / 0 |
7 |
|
4440 |
P1003F
Abbreviation
|
0 / 0 |
8 |
|
4439 |
P1004A
Sonya and Hotels
|
0 / 0 |
3 |
|
4438 |
P1004B
Sonya and Exhibition
|
0 / 0 |
4 |
|
4437 |
P1004C
Sonya and Robots
|
0 / 0 |
4 |
|
4436 |
P1004D
Sonya and Matrix
|
0 / 0 |
8 |
|
4435 |
P1004E
Sonya and Ice Cream
|
0 / 0 |
9 |
|
4434 |
P1004F
Sonya and Bitwise OR
|
0 / 0 |
10 |
|
4433 |
P1005A
Tanya and Stairways
|
0 / 0 |
3 |
|
4432 |
P1005B
Delete from the Left
|
0 / 0 |
3 |
|
4431 |
P1005C
Summarize to the Power of Two
|
0 / 0 |
4 |
|
4430 |
P1005D
Polycarp and Div 3
|
0 / 0 |
5 |
|
4429 |
P1005E1
Median on Segments (Permutations Edition)
|
0 / 0 |
6 |
|
4428 |
P1005E2
Median on Segments (General Case Edition)
|
0 / 0 |
9 |
|
4427 |
P1005F
Berland and the Shortest Paths
|
0 / 0 |
7 |
|
4426 |
P1006A
Adjacent Replacements
|
0 / 0 |
3 |
|
4425 |
P1006B
Polycarp's Practice
|
0 / 0 |
4 |