| CF10200C |
C. Smart Thief |
Codeforces |
— |
1000ms / 256MB |
| CF10200D |
D. Icy Land |
Codeforces |
— |
1000ms / 256MB |
| CF10200E |
E. Artilleries and Defensive Walls |
Codeforces |
— |
1000ms / 256MB |
| CF10200F |
F. Popping Balloons |
Codeforces |
— |
1000ms / 256MB |
| CF10200G |
G. Go Make It Complete |
Codeforces |
— |
1000ms / 256MB |
| CF10200H |
H. Lexical Sign Sequence |
Codeforces |
— |
1000ms / 256MB |
| CF10200I |
I. Lie Detector |
Codeforces |
— |
1000ms / 256MB |
| CF10200J |
J. Future Generation |
Codeforces |
— |
1000ms / 256MB |
| CF10200K |
K. Boomerangs |
Codeforces |
— |
—ms / 256MB |
| CF10200L |
L. Binary String |
Codeforces |
— |
—ms / 256MB |
| CF10201A |
A. Rikka with Minimum Spanning Trees |
Codeforces |
— |
6000ms / 1024MB |
| CF10201B |
B. Rikka with Line Graphs |
Codeforces |
— |
12000ms / 1024MB |
| CF10201C |
C. Rikka with Consistency |
Codeforces |
— |
8000ms / 1024MB |
| CF10201D |
D. Rikka with Subsequences |
Codeforces |
— |
4000ms / 1024MB |
| CF10201E |
E. Rikka with Data Structures |
Codeforces |
— |
10000ms / 1024MB |
| CF10201F |
F. Rikka with Nice Counting Striking Back |
Codeforces |
— |
8000ms / 1024MB |
| CF10201G |
G. Rikka with Intersections of Paths |
Codeforces |
— |
6000ms / 1024MB |
| CF10201H |
H. Rikka with A Long Colour Palette |
Codeforces |
— |
6000ms / 1024MB |
| CF10201I |
I. Rikka with Sorting Networks |
Codeforces |
— |
4000ms / 1024MB |
| CF10201J |
J. Rikka with An Unnamed Temple |
Codeforces |
— |
14000ms / 1024MB |
| CF10201K |
K. Rikka with Ants |
Codeforces |
— |
4000ms / 1024MB |
| CF10201L |
L. Rikka with Grid Graphs |
Codeforces |
— |
8000ms / 1024MB |
| CF10201M |
M. Rikka with Illuminations |
Codeforces |
— |
8000ms / 1024MB |
| CF10202A |
A. Awesome Brother |
Codeforces |
— |
3000ms / 1024MB |
| CF10202B |
B. Beza-10 |
Codeforces |
— |
1000ms / 256MB |
| CF10202C |
C. Connected Components Strikes Again |
Codeforces |
— |
1000ms / 1024MB |
| CF10202D |
D. Dumb feature |
Codeforces |
— |
1000ms / 256MB |
| CF10202E |
E. Resistors in Parallel |
Codeforces |
— |
2000ms / 1024MB |
| CF10202F |
F. Fairy, the treacherous mailman |
Codeforces |
— |
1000ms / 256MB |
| CF10202G |
G. Gabrielmetry |
Codeforces |
— |
1000ms / 256MB |
| CF10202H |
H. Hyperpath |
Codeforces |
— |
2000ms / 256MB |
| CF10202I |
I. Illegal Towers |
Codeforces |
— |
1000ms / 256MB |
| CF10202J |
J. Joseph and Tests |
Codeforces |
— |
4000ms / 256MB |
| CF10202K |
K. K-pop |
Codeforces |
— |
2000ms / 256MB |
| CF10202L |
L. Looter of Fridges |
Codeforces |
— |
2000ms / 512MB |
| CF10202M |
M. Marvelous Necklace |
Codeforces |
— |
—ms / 256MB |
| CF10203A |
A. N integers |
Codeforces |
— |
1000ms / 256MB |
| CF10203B |
B. Mahmoud the Thief |
Codeforces |
— |
1000ms / 256MB |
| CF10203C |
C. Apple Shops |
Codeforces |
— |
1000ms / 256MB |
| CF10203D |
D. Coach Ayoub |
Codeforces |
— |
1000ms / 256MB |
| CF10203E |
E. New Max |
Codeforces |
— |
1000ms / 256MB |
| CF10203F |
F. Who has a better strategy ? |
Codeforces |
— |
2000ms / 256MB |
| CF10203G |
G. ABC |
Codeforces |
— |
2000ms / 256MB |
| CF10203H |
H. Zuhair and the Dag |
Codeforces |
— |
1000ms / 4MB |
| CF10203I |
I. Abu Tahun Mod problem |
Codeforces |
— |
1000ms / 256MB |
| CF10203J |
J. Negative effect |
Codeforces |
— |
1000ms / 256MB |
| CF10203K |
K. Scientest Ayoub (A) |
Codeforces |
— |
1000ms / 256MB |
| CF10203L |
L. Scientist Ayoub (B) |
Codeforces |
— |
1000ms / 256MB |
| CF10203M |
M. Ahmad Jaber Rectangles |
Codeforces |
— |
1000ms / 256MB |
| CF10205A |
A. Nate and Actual 3D Girls |
Codeforces |
— |
1000ms / 256MB |