| CF1023E |
E. Down or Right |
Codeforces |
— |
1000ms / 256MB |
| CF1023F |
F. Mobile Phone Network |
Codeforces |
— |
3000ms / 256MB |
| CF1023G |
G. Pisces |
Codeforces |
— |
5000ms / 512MB |
| CF10240B |
B. Xor Sums |
Codeforces |
— |
1000ms / 256MB |
| CF10240C |
C. Xor in Tree |
Codeforces |
— |
1000ms / 256MB |
| CF10240D |
D. Lottery Ticket |
Codeforces |
— |
5000ms / 256MB |
| CF10240E |
E. Googles wants to maximize |
Codeforces |
— |
8000ms / 256MB |
| CF10240F |
F. Ironical Solution 1 |
Codeforces |
— |
1000ms / 256MB |
| CF10240G |
G. Ironical Solution 2 |
Codeforces |
— |
3000ms / 256MB |
| CF10240H |
H. Maximizing Coins |
Codeforces |
— |
1000ms / 256MB |
| CF10240I |
I. Thanos's snap |
Codeforces |
— |
1000ms / 256MB |
| CF10240J |
J. Best division |
Codeforces |
— |
1000ms / 256MB |
| CF10240K |
K. Lending Woes |
Codeforces |
— |
1000ms / 256MB |
| CF10241A |
A. Palindrome |
Codeforces |
— |
1000ms / 256MB |
| CF10241B |
B. Efficient market |
Codeforces |
— |
1000ms / 256MB |
| CF10241C |
C. Quick coffee |
Codeforces |
— |
1000ms / 256MB |
| CF10241D |
D. Calculated risk |
Codeforces |
— |
1000ms / 256MB |
| CF10241E |
E. Space guardians |
Codeforces |
— |
1000ms / 256MB |
| CF10241F |
F. xor-sum |
Codeforces |
— |
1000ms / 256MB |
| CF10241G |
G. Large array |
Codeforces |
— |
3000ms / 256MB |
| CF10241H |
H. In-degree |
Codeforces |
— |
1000ms / 256MB |
| CF10241I |
I. Another Query Problem |
Codeforces |
— |
5000ms / 512MB |
| CF10241J |
J. Jaber The policeman |
Codeforces |
— |
1000ms / 256MB |
| CF10241K |
K. The Dragon and the Kingdom of Trees |
Codeforces |
— |
1000ms / 256MB |
| CF10241L |
L. Cheating detection. |
Codeforces |
— |
1000ms / 256MB |
| CF10242A |
A. Carryless Square Root |
Codeforces |
— |
1000ms / 512MB |
| CF10242B |
B. Computer Cache |
Codeforces |
— |
5000ms / 1024MB |
| CF10242C |
C. Elven Efficiency |
Codeforces |
— |
5000ms / 512MB |
| CF10242D |
D. Swap Free |
Codeforces |
— |
1000ms / 512MB |
| CF10242E |
E. Fixed Point Permutations |
Codeforces |
— |
1000ms / 512MB |
| CF10242F |
F. Interstellar Travel |
Codeforces |
— |
5000ms / 256MB |
| CF10242G |
G. Jumping Path |
Codeforces |
— |
10000ms / 512MB |
| CF10242H |
H. Levenshtein Distance |
Codeforces |
— |
1000ms / 512MB |
| CF10242I |
I. Maze Connect |
Codeforces |
— |
5000ms / 512MB |
| CF10242J |
J. One of Each |
Codeforces |
— |
2000ms / 512MB |
| CF10242K |
K. Windmill Pivot |
Codeforces |
— |
10000ms / 512MB |
| CF10243A |
A. Kick Start |
Codeforces |
— |
1000ms / 256MB |
| CF10243B |
B. Infimum of Paths |
Codeforces |
— |
8000ms / 256MB |
| CF10243C |
C. Mr. Panda and Typewriter |
Codeforces |
— |
15000ms / 1024MB |
| CF10243D |
D. Pulse Nova |
Codeforces |
— |
8000ms / 256MB |
| CF10243E |
E. Non-Maximum Suppression |
Codeforces |
— |
15000ms / 256MB |
| CF10243F |
F. Ferry |
Codeforces |
— |
2000ms / 256MB |
| CF10243G |
G. Game on the Tree |
Codeforces |
— |
5000ms / 256MB |
| CF10243H |
H. Mr. Panda and SAD |
Codeforces |
— |
1000ms / 512MB |
| CF10243I |
I. Mr. Panda and Blocks |
Codeforces |
— |
1000ms / 256MB |
| CF10243K |
K. Russian Dolls on the Christmas Tree |
Codeforces |
— |
3000ms / 1024MB |
| CF10243L |
L. Spiral Matrix |
Codeforces |
— |
1000ms / 256MB |
| CF10244A |
A. Accept or Reject |
Codeforces |
— |
1000ms / 256MB |
| CF10244B |
B. Beza's Hangover |
Codeforces |
— |
2000ms / 256MB |
| CF10244C |
C. Call from Mendes |
Codeforces |
— |
1000ms / 512MB |