此竞赛为外部竞赛 Codeforces Round 1118 (Div. 2) 更多信息,请访问 https://codeforces.com/contest/2258
Merhaba Codeforces!
We are proud to invite you to Codeforces Round 1118 (Div. 2), which will be held on Saturday, August 29, 2026 at 22:35UTC+8.
The round will be rated for participants whose rating is below 2100, but higher rated users are also welcome to participate out of competition. You will be given 6 problems, one of which will be divided into a subtask, and 2 hours to solve them. Also, there is at least one interactive problem, so you are recommended to read the guide to interactive problems if you have not encountered them before.
The problems were authored by me (ItsNotMeItsYou), carcinisation, mychecksdead and Seferoglu.
This round was prepared by some members of the 2025 and 2026 IOI team of Türkiye, and we hope you enjoy all our problems.
We would like to thank:
cadmiumky for his outstanding coordination of the round,
Um_nik for the preliminary review,
Alexdat2000 for Russian translations,
MikeMirzayanov and KAN for Codeforces and Polygon,
Our testers: destructive_criticism, tolbi, dinohaur, anpaio, kalimm, nifeshe, https, kafamcokkaristi, FatihCihan, LucaLucaM, PieArmy, int23_t, temporary1, robert9524, Kel_Mahmut, dead0ne, kawasaki, Synd209, elotelo, Anfeco,
anpaio for improving at least one problem,
destructive_criticism and dinohaur for at least one unused suggestion,
You for participating in the round.
Score distribution:
Good luck & have fun!
题目
| 题目 | 分数 | AC率 | 用户 |
|---|
评论