| CF867A |
A. Between the Offices |
Codeforces |
— |
2000ms / 256MB |
| CF867B |
B. Save the problem! |
Codeforces |
— |
2000ms / 256MB |
| CF867C |
C. Ordering Pizza |
Codeforces |
— |
2000ms / 256MB |
| CF867D |
D. Gotta Go Fast |
Codeforces |
— |
2000ms / 256MB |
| CF867E |
E. Buy Low Sell High |
Codeforces |
— |
2000ms / 256MB |
| CF867F |
F. Hex Dyslexia |
Codeforces |
— |
3000ms / 256MB |
| CF868A |
A. Bark to Unlock |
Codeforces |
— |
2000ms / 256MB |
| CF868B |
B. Race Against Time |
Codeforces |
— |
2000ms / 256MB |
| CF868C |
C. Qualification Rounds |
Codeforces |
— |
2000ms / 256MB |
| CF868D |
D. Huge Strings |
Codeforces |
— |
2000ms / 256MB |
| CF868E |
E. Policeman and a Tree |
Codeforces |
— |
2000ms / 256MB |
| CF868F |
F. Yet Another Minimization Problem |
Codeforces |
— |
2000ms / 256MB |
| CF868G |
G. El Toll Caves |
Codeforces |
— |
2000ms / 256MB |
| CF869A |
A. The Artful Expedient |
Codeforces |
— |
1000ms / 256MB |
| CF869B |
B. The Eternal Immortality |
Codeforces |
— |
1000ms / 256MB |
| CF869C |
C. The Intriguing Obsession |
Codeforces |
— |
1000ms / 256MB |
| CF869D |
D. The Overdosing Ubiquity |
Codeforces |
— |
1000ms / 256MB |
| CF869E |
E. The Untended Antiquity |
Codeforces |
— |
2000ms / 512MB |
| CF86A |
A. Reflection |
Codeforces |
— |
2000ms / 256MB |
| CF86B |
B. Tetris revisited |
Codeforces |
— |
1000ms / 256MB |
| CF86C |
C. Genetic engineering |
Codeforces |
— |
2000ms / 256MB |
| CF86D |
D. Powerful array |
Codeforces |
— |
5000ms / 256MB |
| CF86E |
E. Long sequence |
Codeforces |
— |
2000ms / 256MB |
| CF870A |
A. Search for Pretty Integers |
Codeforces |
— |
1000ms / 256MB |
| CF870B |
B. Maximum of Maximums of Minimums |
Codeforces |
— |
1000ms / 256MB |
| CF870C |
C. Maximum splitting |
Codeforces |
— |
2000ms / 256MB |
| CF870D |
D. Something with XOR Queries |
Codeforces |
— |
2000ms / 256MB |
| CF870E |
E. Points, Lines and Ready-made Titles |
Codeforces |
— |
2000ms / 256MB |
| CF870F |
F. Paths |
Codeforces |
— |
4000ms / 512MB |
| CF871A |
A. Maximum splitting |
Codeforces |
— |
2000ms / 256MB |
| CF871B |
B. Something with XOR Queries |
Codeforces |
— |
2000ms / 256MB |
| CF871C |
C. Points, Lines and Ready-made Titles |
Codeforces |
— |
2000ms / 256MB |
| CF871D |
D. Paths |
Codeforces |
— |
4000ms / 512MB |
| CF871E |
E. Restore the Tree |
Codeforces |
— |
3000ms / 256MB |
| CF872A |
A. Search for Pretty Integers |
Codeforces |
— |
1000ms / 256MB |
| CF872B |
B. Maximum of Maximums of Minimums |
Codeforces |
— |
1000ms / 256MB |
| CF872C |
C. Maximum splitting |
Codeforces |
— |
2000ms / 256MB |
| CF872D |
D. Something with XOR Queries |
Codeforces |
— |
2000ms / 256MB |
| CF872E |
E. Points, Lines and Ready-made Titles |
Codeforces |
— |
2000ms / 256MB |
| CF873A |
A. Chores |
Codeforces |
— |
2000ms / 256MB |
| CF873B |
B. Balanced Substring |
Codeforces |
— |
1000ms / 256MB |
| CF873C |
C. Strange Game On Matrix |
Codeforces |
— |
1000ms / 256MB |
| CF873D |
D. Merge Sort |
Codeforces |
— |
2000ms / 256MB |
| CF873E |
E. Awards For Contestants |
Codeforces |
— |
1000ms / 256MB |
| CF873F |
F. Forbidden Indices |
Codeforces |
— |
2000ms / 256MB |
| CF875A |
A. Classroom Watch |
Codeforces |
— |
1000ms / 512MB |
| CF875B |
B. Sorting the Coins |
Codeforces |
— |
1000ms / 512MB |
| CF875C |
C. National Property |
Codeforces |
— |
1000ms / 512MB |
| CF875D |
D. High Cry |
Codeforces |
— |
1000ms / 512MB |
| CF875E |
E. Delivery Club |
Codeforces |
— |
2000ms / 512MB |