|
|
31107 |
codeforces#P1349B
Orac and Medians
|
0 / 0 |
7 |
|
|
31108 |
codeforces#P1349C
Orac and Game of Life
|
0 / 0 |
7 |
|
|
31109 |
codeforces#P1349D
Slime and Biscuits
|
0 / 0 |
10 |
|
|
31110 |
codeforces#P1349E
Slime and Hats
|
0 / 0 |
10 |
|
|
31111 |
codeforces#P1349F1
Slime and Sequences (Easy Version)
|
0 / 0 |
10 |
|
|
31112 |
codeforces#P1349F2
Slime and Sequences (Hard Version)
|
0 / 0 |
10 |
|
|
31113 |
codeforces#P1350A
Orac and Factors
|
1 / 1 |
3 |
|
|
31114 |
codeforces#P1350B
Orac and Models
|
0 / 0 |
4 |
|
|
31115 |
codeforces#P1351A
A+B (Trial Problem)
|
2 / 9 |
3 |
|
|
31116 |
codeforces#P1351B
Square?
|
0 / 0 |
3 |
|
|
31117 |
codeforces#P1351C
Skier
|
0 / 0 |
4 |
|
|
31118 |
codeforces#P1352A
Sum of Round Numbers
|
1 / 2 |
3 |
|
|
31119 |
codeforces#P1352B
Same Parity Summands
|
0 / 0 |
4 |
|
|
31120 |
codeforces#P1352C
K-th Not Divisible by n
|
0 / 0 |
4 |
|
|
31121 |
codeforces#P1352D
Alice, Bob and Candies
|
0 / 0 |
4 |
|
|
31122 |
codeforces#P1352E
Special Elements
|
0 / 0 |
5 |
|
|
31123 |
codeforces#P1352F
Binary String Reconstruction
|
0 / 0 |
5 |
|
|
31124 |
codeforces#P1352G
Special Permutation
|
0 / 0 |
5 |
|
|
31125 |
codeforces#P1353A
Most Unstable Array
|
1 / 1 |
3 |
|
|
31126 |
codeforces#P1353B
Two Arrays And Swaps
|
0 / 0 |
3 |
|
|
31127 |
codeforces#P1353C
Board Moves
|
0 / 0 |
3 |
|
|
31128 |
codeforces#P1353D
Constructing the Array
|
0 / 0 |
5 |
|
|
31129 |
codeforces#P1353E
K-periodic Garland
|
0 / 0 |
6 |
|
|
31130 |
codeforces#P1353F
Decreasing Heights
|
0 / 0 |
8 |
|
|
31131 |
codeforces#P1354A
Alarm Clock
|
1 / 1 |
3 |
|
|
31132 |
codeforces#P1354B
Ternary String
|
0 / 0 |
4 |
|
|
31133 |
codeforces#P1354C1
Simple Polygon Embedding
|
0 / 0 |
4 |
|
|
31134 |
codeforces#P1354C2
Not So Simple Polygon Embedding
|
0 / 0 |
7 |
|
|
31135 |
codeforces#P1354D
Multiset
|
0 / 0 |
6 |
|
|
31136 |
codeforces#P1354E
Graph Coloring
|
0 / 0 |
7 |
|
|
31137 |
codeforces#P1354F
Summoning Minions
|
0 / 0 |
9 |
|
|
31138 |
codeforces#P1354G
Find a Gift
|
0 / 0 |
10 |
|
|
31139 |
codeforces#P1355A
Sequence with Digits
|
0 / 0 |
4 |
|
|
31140 |
codeforces#P1355B
Young Explorers
|
0 / 0 |
4 |
|
|
31141 |
codeforces#P1355C
Count Triangles
|
0 / 0 |
6 |
|
|
31142 |
codeforces#P1355D
Game With Array
|
0 / 0 |
4 |
|
|
31143 |
codeforces#P1355E
Restorer Distance
|
0 / 0 |
7 |
|
|
31144 |
codeforces#P1355F
Guess Divisors Count
|
0 / 1 |
10 |
|
|
31145 |
codeforces#P1356A1
Distinguish I from X
|
0 / 0 |
(无) |
|
|
31146 |
codeforces#P1356A2
Distinguish I from Z
|
0 / 0 |
(无) |
|
|
31147 |
codeforces#P1356A3
Distinguish Z from S
|
0 / 0 |
(无) |
|
|
31148 |
codeforces#P1356A4
Distinguish I ⊗ X from CNOT
|
0 / 0 |
(无) |
|
|
31149 |
codeforces#P1356A4
Distinguish I ⊗ X from CNOT
|
0 / 0 |
(无) |
|
|
31150 |
codeforces#P1356A5
Distinguish Z from -Z
|
0 / 0 |
(无) |
|
|
31151 |
codeforces#P1356B1
Increment
|
0 / 0 |
(无) |
|
|
31152 |
codeforces#P1356B2
Decrement
|
0 / 0 |
(无) |
|
|
31153 |
codeforces#P1356C
Prepare state |01⟩ + |10⟩ + |11⟩
|
0 / 0 |
(无) |
|
|
31154 |
codeforces#P1356D1
Quantum Classification - 1
|
0 / 0 |
(无) |
|
|
31155 |
codeforces#P1356D2
Quantum Classification - 2
|
0 / 0 |
(无) |
|
|
31156 |
codeforces#P1357A1
Figure out direction of CNOT
|
0 / 0 |
(无) |
