Hello, Codeforces! We're glad to invite you to take part in Codeforces Round 1064 (Div. 1) and Codeforces Round 1064 (Div. 2), which will start on Nov/16/2025 17:35 (Moscow time). You will be given 6 problems and 2 hours to solve them in both divisions.
The problems were authored and prepared by le0n and me.
We would like to thank:
- Sugar_fan for his coordination;
- Alexdat2000 for Russian translation;
- liqingyang, ZhouYuHang for providing problems that were ultimately not used;
- Tobo, _istil, zhoukangyang, wenhao801, baka24, zhaohaikun, xcyle, _RedWine_, Bossusuprem, mzen, phir., dXqwq, songhongyi, SubgraphCounting, Seg_Tree_, Brooksx, A2_Chaos, jhgfds, Crystally, Um_nik, Friedrich, qbf, sunzihang, EvenImage, Arpa, Adam_GS for testing;
- TheScrasse, Error_Yuan and others who were invited but unable to test for reasons;
- MikeMirzayanov for creating Codeforces and Polygon.
Score distribution:
- Div. 1: $$$500-1000-1500-2500-3000-4000$$$
- Div. 2: $$$500-750-1000-1500-2000-3000$$$
We hope you'll enjoy the problems!
UPD: Congratulations to top $$$5$$$ in Div. 1 and Div. 2.
Div. 1:
- maroonrk, achieving perfect score at an astonishing 01:18:30!
- JDScript0117, with an outstanding comeback at 01:55:46!
- Benq
- ksun48
- Nachia
Div. 2:
- __lucailie, with a final solve at 01:59:15!
- weertyu
- su_da
- Axiom_
- WangYuanyi
First solves:
Div. 1:
A: ksun48
B: Benq
C: OrangeEye
D: Benq
E: Benq
F: maroonrk
Div. 2:
A: f___off
B: Animesh--__--
C: lemmec0de
D: Doraemon-_-
E: Shakhzod_Toshpulatov
F: kyUUKoU
UPD: Editorial is out!
