| CF10283K |
K. Ragdoll |
Codeforces |
— |
2000ms / 512MB |
| CF10283L |
L. Coordinate Paper |
Codeforces |
— |
1000ms / 256MB |
| CF10286A |
A. Two Subsequences |
Codeforces |
— |
1000ms / 256MB |
| CF10286B |
B. Numbers on a Circle |
Codeforces |
— |
1000ms / 256MB |
| CF10286C |
C. Changing Game |
Codeforces |
— |
5000ms / 256MB |
| CF10286D |
D. Splitting Text |
Codeforces |
— |
1000ms / 256MB |
| CF10286E |
E. Ice Cream |
Codeforces |
— |
1000ms / 256MB |
| CF10286F |
F. Cell Borders |
Codeforces |
— |
1000ms / 256MB |
| CF10286G |
G. Strange Queries |
Codeforces |
— |
1000ms / 256MB |
| CF10286H |
H. Optimize DFS |
Codeforces |
— |
3000ms / 256MB |
| CF10286I |
I. Strange Mex |
Codeforces |
— |
2000ms / 256MB |
| CF10286J |
J. Mex Grid |
Codeforces |
— |
1000ms / 256MB |
| CF10286K |
K. Binary Sequence |
Codeforces |
— |
1000ms / 256MB |
| CF10286L |
L. Falling Boxes |
Codeforces |
— |
1000ms / 256MB |
| CF10286M |
M. Big Sum |
Codeforces |
— |
1000ms / 256MB |
| CF10287A |
A. Accordion Artist And Orz Pandas |
Codeforces |
— |
—ms / 256MB |
| CF10287B |
B. Bracelets of Orz Pandas |
Codeforces |
— |
3000ms / 256MB |
| CF10287C |
C. Closestools of Orz Pandas |
Codeforces |
— |
2000ms / 256MB |
| CF10287D |
D. Data Structure Master and Orz Pandas |
Codeforces |
— |
1000ms / 256MB |
| CF10287E |
E. Encryption of Orz Pandas |
Codeforces |
— |
5000ms / 512MB |
| CF10287F |
F. Flow of Orz Pandas |
Codeforces |
— |
1000ms / 256MB |
| CF10287G |
G. Gery's Problem and Orz Pandas |
Codeforces |
— |
1000ms / 512MB |
| CF10287H |
H. Hamming Code and Orz Pandas |
Codeforces |
— |
1000ms / 256MB |
| CF10287I |
I. Irregular Shape of Orz Pandas |
Codeforces |
— |
1000ms / 256MB |
| CF10287J |
J. Junction of Orz Pandas |
Codeforces |
— |
1000ms / 256MB |
| CF10287K |
K. Kanade Hates Recruitment |
Codeforces |
— |
1000ms / 1024MB |
| CF10287L |
L. Leave from CPC |
Codeforces |
— |
1000ms / 1024MB |
| CF10287M |
M. Camouflage |
Codeforces |
— |
1000ms / 256MB |
| CF10288A |
A. Officer Anany Collecting String Subsequences |
Codeforces |
— |
1000ms / 64MB |
| CF10288B |
B. Anany in the Army |
Codeforces |
— |
2000ms / 64MB |
| CF10288C |
C. Sort? |
Codeforces |
— |
1000ms / 256MB |
| CF10288D |
D. YSYS |
Codeforces |
— |
2000ms / 256MB |
| CF10288E |
E. Baby Ehab's X(OR) |
Codeforces |
— |
1000ms / 256MB |
| CF10288F |
F. Geometry? |
Codeforces |
— |
1000ms / 64MB |
| CF10288G |
G. Baby Ehab and a GCD Problem, Of Course |
Codeforces |
— |
1000ms / 256MB |
| CF10288H |
H. Shortest Array |
Codeforces |
— |
1000ms / 256MB |
| CF10288I |
I. Ehab The Baby Learned Graphs |
Codeforces |
— |
1000ms / 64MB |
| CF10288J |
J. ABC |
Codeforces |
— |
1000ms / 256MB |
| CF10288K |
K. Plants Watering |
Codeforces |
— |
1000ms / 256MB |
| CF10288L |
L. The Expected Square |
Codeforces |
— |
1000ms / 64MB |
| CF10288M |
M. Baby Ehab's Whining Chance |
Codeforces |
— |
1000ms / 256MB |
| CF10288N |
N. Baby !Ehab |
Codeforces |
— |
1000ms / 256MB |
| CF102891 |
1. Unique Elements |
Codeforces |
— |
1000ms / 256MB |
| CF102892 |
2. Egocentric Subarrays |
Codeforces |
— |
1000ms / 256MB |
| CF102893 |
3. Infectious Letters |
Codeforces |
— |
1000ms / 256MB |
| CF102894 |
4. Park Fountains |
Codeforces |
— |
1000ms / 256MB |
| CF102895 |
5. Channel Surfing |
Codeforces |
— |
1000ms / 256MB |
| CF102896 |
6. Birdwatching |
Codeforces |
— |
1000ms / 256MB |
| CF102897 |
7. Trailing Zeros |
Codeforces |
— |
1000ms / 256MB |
| CF102898 |
8. Maximum Donut |
Codeforces |
— |
1000ms / 256MB |