| 1202Contest_a |
DEGwer's Doctoral Dissertation |
AtCoder |
— |
2000ms / 256MB |
| 1202Contest_b |
vs. DEGwer |
AtCoder |
— |
5000ms / 256MB |
| 1202Contest_c |
binarydigit |
AtCoder |
— |
10000ms / 256MB |
| 1202Contest_d |
Coincidence |
AtCoder |
— |
2000ms / 256MB |
| 1202Contest_e |
Half Palindromes |
AtCoder |
— |
3000ms / 256MB |
| 1202Contest_f |
K-Medians Clustering |
AtCoder |
— |
3000ms / 256MB |
| 1202Contest_g |
Net of Net |
AtCoder |
— |
10000ms / 256MB |
| 1202Contest_h |
Incomplete Notes |
AtCoder |
— |
3000ms / 256MB |
| 1202Contest_i |
Convex Dombination |
AtCoder |
— |
2000ms / 256MB |
| 1202Contest_j |
Hated Number |
AtCoder |
— |
2000ms / 256MB |
| 1202Contest_k |
± Beam |
AtCoder |
— |
2000ms / 256MB |
| CF1 |
1. Nuclear Reactor |
Codeforces |
— |
1000ms / 256MB |
| CF1000A |
A. Codehorses T-shirts |
Codeforces |
— |
2000ms / 256MB |
| CF1000B |
B. Light It Up |
Codeforces |
— |
1000ms / 256MB |
| CF1000C |
C. Covered Points Count |
Codeforces |
— |
3000ms / 256MB |
| CF1000D |
D. Yet Another Problem On a Subsequence |
Codeforces |
— |
2000ms / 256MB |
| CF1000E |
E. We Need More Bosses |
Codeforces |
— |
2000ms / 256MB |
| CF1000F |
F. One Occurrence |
Codeforces |
— |
3000ms / 768MB |
| CF1000G |
G. Two-Paths |
Codeforces |
— |
3000ms / 256MB |
| CF10015A |
A. The New President |
Codeforces |
— |
1000ms / 256MB |
| CF10015B |
B. No Name |
Codeforces |
— |
4000ms / 256MB |
| CF10015C |
C. Encrypted Password |
Codeforces |
— |
1000ms / 256MB |
| CF10015D |
D. Kids Love Candies |
Codeforces |
— |
1000ms / 256MB |
| CF10015E |
E. The Swapping Game |
Codeforces |
— |
1000ms / 256MB |
| CF10015F |
F. Lock Pattern |
Codeforces |
— |
1000ms / 256MB |
| CF10015G |
G. Archery |
Codeforces |
— |
1000ms / 256MB |
| CF10015H |
H. Connecting Islands |
Codeforces |
— |
1000ms / 256MB |
| CF10015I |
I. Contest Hall Preparation |
Codeforces |
— |
1000ms / 256MB |
| CF10015J |
J. Math Homework |
Codeforces |
— |
1000ms / 256MB |
| CF10018A |
A. Potion of Immortality |
Codeforces |
— |
2000ms / 256MB |
| CF10018B |
B. A Lot of Joy |
Codeforces |
— |
2000ms / 256MB |
| CF10018C |
C. Very Spacious Office |
Codeforces |
— |
2000ms / 256MB |
| CF10018D |
D. Holidays |
Codeforces |
— |
2000ms / 256MB |
| CF10018E |
E. Two Labyrinths |
Codeforces |
— |
2000ms / 256MB |
| CF10018F |
F. Doomsday |
Codeforces |
— |
2000ms / 256MB |
| CF10018G |
G. Image Processing |
Codeforces |
— |
2000ms / 256MB |
| CF10018H |
H. Mysterious Photos |
Codeforces |
— |
2000ms / 256MB |
| CF10018I |
I. Derivative of Array |
Codeforces |
— |
2000ms / 256MB |
| CF10018J |
J. Deck Shuffling |
Codeforces |
— |
2000ms / 256MB |
| CF10018K |
K. Perpetuum Mobile |
Codeforces |
— |
2000ms / 256MB |
| CF10018L |
L. Ministry of Truth |
Codeforces |
— |
2000ms / 256MB |
| CF10018M |
M. Heaviside Function |
Codeforces |
— |
2000ms / 256MB |
| CF1001A |
A. Generate plus state or minus state |
Codeforces |
— |
1000ms / 256MB |
| CF1001B |
B. Generate Bell state |
Codeforces |
— |
1000ms / 256MB |
| CF1001C |
C. Generate GHZ state |
Codeforces |
— |
1000ms / 256MB |
| CF1001D |
D. Distinguish plus state and minus state |
Codeforces |
— |
1000ms / 256MB |
| CF1001E |
E. Distinguish Bell states |
Codeforces |
— |
1000ms / 256MB |
| CF1001F |
F. Distinguish multi-qubit basis states |
Codeforces |
— |
1000ms / 256MB |
| CF1001G |
G. Oracle for f(x) = k-th element of x |
Codeforces |
— |
1000ms / 256MB |
| CF1001H |
H. Oracle for f(x) = parity of the number of 1s in x |
Codeforces |
— |
1000ms / 256MB |