| CF1001I |
I. Deutsch-Jozsa algorithm |
Codeforces |
— |
1000ms / 256MB |
| CF10020A |
A. Ariel |
Codeforces |
— |
2000ms / 256MB |
| CF10020B |
B. Bracelets |
Codeforces |
— |
6000ms / 256MB |
| CF10020C |
C. Cow run |
Codeforces |
— |
2000ms / 64MB |
| CF10020D |
D. Different vectors |
Codeforces |
— |
1000ms / 64MB |
| CF10020E |
E. bits-Equalizer |
Codeforces |
— |
2000ms / 64MB |
| CF10020F |
F. Find the sequence |
Codeforces |
— |
1000ms / 64MB |
| CF10020G |
G. Good elements |
Codeforces |
— |
1000ms / 64MB |
| CF10020H |
H. Highways |
Codeforces |
— |
1000ms / 64MB |
| CF10020I |
I. I WIN |
Codeforces |
— |
2000ms / 256MB |
| CF10020J |
J. Journeys on the Moscow Underground |
Codeforces |
— |
2000ms / 256MB |
| CF10026A |
A. Крепость |
Codeforces |
— |
—ms / —MB |
| CF10026B |
B. Разбиения на множества |
Codeforces |
— |
—ms / —MB |
| CF10026C |
C. НОД на отрезке |
Codeforces |
— |
—ms / —MB |
| CF10028A |
A. Rasheda And The Zeriba |
Codeforces |
— |
2000ms / 256MB |
| CF10028B |
B. Egyptian Roads Construction |
Codeforces |
— |
10000ms / 256MB |
| CF10028C |
C. Tomb Raiders |
Codeforces |
— |
15000ms / 256MB |
| CF10028D |
D. Bakkar And The Algorithm Quiz |
Codeforces |
— |
2000ms / 256MB |
| CF10028E |
E. Ghanophobia |
Codeforces |
— |
2000ms / 256MB |
| CF10028F |
F. Bakkar In The Army |
Codeforces |
— |
2000ms / 256MB |
| CF10028G |
G. Jenga In The Military Unit |
Codeforces |
— |
2000ms / 256MB |
| CF10028H |
H. The Job Interview |
Codeforces |
— |
15000ms / 256MB |
| CF10028I |
I. Bakkar In Zanzibar |
Codeforces |
— |
4000ms / 256MB |
| CF10028J |
J. Anniversary Gift |
Codeforces |
— |
10000ms / 256MB |
| CF10028K |
K. Cubes Shuffling |
Codeforces |
— |
2000ms / 256MB |
| CF10028L |
L. Mahdi And The Teddy Bear |
Codeforces |
— |
8000ms / 256MB |
| CF10029A |
A. Atlantis |
Codeforces |
— |
7000ms / 512MB |
| CF10029B |
B. Demonstrations |
Codeforces |
— |
12000ms / 256MB |
| CF1002A1 |
A1. Generate superposition of all basis states |
Codeforces |
— |
1000ms / 256MB |
| CF1002A2 |
A2. Generate superposition of zero state and a basis state |
Codeforces |
— |
1000ms / 256MB |
| CF1002A3 |
A3. Generate superposition of two basis states |
Codeforces |
— |
1000ms / 256MB |
| CF1002A4 |
A4. Generate W state |
Codeforces |
— |
1000ms / 256MB |
| CF1002B1 |
B1. Distinguish zero state and W state |
Codeforces |
— |
1000ms / 256MB |
| CF1002B2 |
B2. Distinguish GHZ state and W state |
Codeforces |
— |
1000ms / 256MB |
| CF1002B3 |
B3. Distinguish four 2-qubit states |
Codeforces |
— |
1000ms / 256MB |
| CF1002B4 |
B4. Distinguish four 2-qubit states - 2 |
Codeforces |
— |
1000ms / 256MB |
| CF1002C1 |
C1. Distinguish zero state and plus state with minimum error |
Codeforces |
— |
2000ms / 256MB |
| CF1002C2 |
C2. Distinguish zero state and plus state without errors |
Codeforces |
— |
2000ms / 256MB |
| CF1002D1 |
D1. Oracle for f(x) = b * x mod 2 |
Codeforces |
— |
1000ms / 256MB |
| CF1002D2 |
D2. Oracle for f(x) = b * x + (1 - b) * (1 - x) mod 2 |
Codeforces |
— |
1000ms / 256MB |
| CF1002D3 |
D3. Oracle for majority function |
Codeforces |
— |
1000ms / 256MB |
| CF1002E1 |
E1. Bernstein-Vazirani algorithm |
Codeforces |
— |
2000ms / 256MB |
| CF1002E2 |
E2. Another array reconstruction algorithm |
Codeforces |
— |
2000ms / 256MB |
| CF10031B |
B. Booking |
Codeforces |
— |
3000ms / 512MB |
| CF10031E |
E. Ringworld |
Codeforces |
— |
3000ms / 128MB |
| CF1003A |
A. Polycarp's Pockets |
Codeforces |
— |
1000ms / 256MB |
| CF1003B |
B. Binary String Constructing |
Codeforces |
— |
1000ms / 256MB |
| CF1003C |
C. Intense Heat |
Codeforces |
— |
4000ms / 256MB |
| CF1003D |
D. Coins and Queries |
Codeforces |
— |
2000ms / 256MB |
| CF1003E |
E. Tree Constructing |
Codeforces |
— |
4000ms / 256MB |