| 状态 |
题号
|
标题 |
显示知识点 |
难度
|
通过率
|
操作 |
|
未提交
|
CF1000A
|
Codehorses T-shirts
|
0星
|
85/587 |
|
|
未提交
|
CF1000B
|
Light It Up
|
0星
|
27/117 |
|
|
未提交
|
CF1000C
|
Covered Points Count
|
0星
|
10/61 |
|
|
未提交
|
CF1000D
|
Yet Another Problem On a Subsequence
|
0星
|
3/13 |
|
|
未提交
|
CF1000E
|
We Need More Bosses
|
0星
|
2/7 |
|
|
未提交
|
CF1000F
|
One Occurrence
|
0星
|
3/14 |
|
|
未提交
|
CF1000G
|
Two-Paths
|
0星
|
0/0 |
|
|
未提交
|
CF1001A
|
Generate plus state or minus state
|
0星
|
0/0 |
|
|
未提交
|
CF1001B
|
Generate Bell state
|
0星
|
0/1 |
|
|
未提交
|
CF1001C
|
Generate GHZ state
|
0星
|
0/0 |
|
|
未提交
|
CF1001D
|
Distinguish plus state and minus state
|
0星
|
0/0 |
|
|
未提交
|
CF1001E
|
Distinguish Bell states
|
0星
|
0/1 |
|
|
未提交
|
CF1001F
|
Distinguish multi-qubit basis states
|
0星
|
0/0 |
|
|
未提交
|
CF1001G
|
Oracle for f(x) = k-th element of x
|
0星
|
0/0 |
|
|
未提交
|
CF1001H
|
Oracle for f(x) = parity of the number of 1s in x
|
0星
|
0/0 |
|
|
未提交
|
CF1001I
|
Deutsch-Jozsa algorithm
|
0星
|
0/0 |
|
|
未提交
|
CF1002A1
|
Generate superposition of all basis states
|
0星
|
0/0 |
|
|
未提交
|
CF1002A2
|
Generate superposition of zero state and a basis state
|
0星
|
0/0 |
|
|
未提交
|
CF1002A3
|
Generate superposition of two basis states
|
0星
|
0/0 |
|
|
未提交
|
CF1002A4
|
Generate W state
|
0星
|
0/0 |
|
|
未提交
|
CF1002B1
|
Distinguish zero state and W state
|
0星
|
0/0 |
|
|
未提交
|
CF1002B2
|
Distinguish GHZ state and W state
|
0星
|
0/0 |
|
|
未提交
|
CF1002B3
|
Distinguish four 2-qubit states
|
0星
|
0/0 |
|
|
未提交
|
CF1002B4
|
Distinguish four 2-qubit states - 2
|
0星
|
0/0 |
|
|
未提交
|
CF1002C1
|
Distinguish zero state and plus state with minimum error
|
0星
|
0/1 |
|
|
未提交
|
CF1002C2
|
Distinguish zero state and plus state without errors
|
0星
|
0/0 |
|
|
未提交
|
CF1002D1
|
Oracle for f(x) = b * x mod 2
|
0星
|
0/0 |
|
|
未提交
|
CF1002D2
|
Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2
|
0星
|
0/1 |
|
|
未提交
|
CF1002D3
|
Oracle for majority function
|
0星
|
0/1 |
|
|
未提交
|
CF1002E1
|
Bernstein-Vazirani algorithm
|
0星
|
0/0 |
|
|
未提交
|
CF1002E2
|
Another array reconstruction algorithm
|
0星
|
0/0 |
|
|
未提交
|
CF1003A
|
Polycarp's Pockets
|
0星
|
15/32 |
|
|
未提交
|
CF1003B
|
Binary String Constructing
|
0星
|
7/25 |
|
|
未提交
|
CF1003C
|
Intense Heat
|
0星
|
4/16 |
|
|
未提交
|
CF1003D
|
Coins and Queries
|
0星
|
4/15 |
|
|
未提交
|
CF1003E
|
Tree Constructing
|
0星
|
0/0 |
|
|
未提交
|
CF1003F
|
Abbreviation
|
0星
|
0/1 |
|
|
未提交
|
CF1004A
|
Sonya and Hotels
|
0星
|
2/11 |
|
|
未提交
|
CF1004B
|
Sonya and Exhibition
|
0星
|
3/6 |
|
|
未提交
|
CF1004C
|
Sonya and Robots
|
0星
|
2/7 |
|
|
未提交
|
CF1004D
|
Sonya and Matrix
|
0星
|
3/27 |
|
|
未提交
|
CF1004E
|
Sonya and Ice Cream
|
0星
|
0/1 |
|
|
未提交
|
CF1004F
|
Sonya and Bitwise OR
|
0星
|
0/0 |
|
|
未提交
|
CF1005A
|
Tanya and Stairways
|
0星
|
20/62 |
|
|
未提交
|
CF1005B
|
Delete from the Left
|
0星
|
22/71 |
|
|
未提交
|
CF1005C
|
Summarize to the Power of Two
|
0星
|
4/6 |
|
|
未提交
|
CF1005D
|
Polycarp and Div 3
|
0星
|
0/0 |
|
|
未提交
|
CF1005E1
|
Median on Segments (Permutations Edition)
|
0星
|
0/0 |
|
|
未提交
|
CF1005E2
|
Median on Segments (General Case Edition)
|
0星
|
0/0 |
|
|
未提交
|
CF1005F
|
Berland and the Shortest Paths
|
0星
|
0/0 |
|
京公网安备 11010502036488号
