You can use several words in query to find by all of them at the same time. In addition, if you are lucky search understands word forms and some synonyms. It supports search by title and author. Examples:

  • 305 — search for 305, most probably it will find blogs about the Round 305
  • andrew stankevich contests — search for words "andrew", "stankevich" and "contests" at the same time
  • user:mikemirzayanov title:testlib — search containing "testlib" in title by MikeMirzayanov
  • "vk cup" — use quotes to find phrase as is
  • title:educational — search in title

Results

1.
Codeforces: серия обновлений (рейтинг, раунды)
By MikeMirzayanov, 9 years ago, translation, In English
Codeforces: серия обновлений (рейтинг, раунды) <img src="/predownloaded/21/a3/21a33b497ee8a34a678befc3f79745eb69a9cf07.png" style="float:right; margin: 0 1em 1em 1em;"/> Привет, Codeforces! Настало время новостей. Надеюсь, вам понравится! * Мы немного опускаем границу рейтинга для оранжевых участников. Таким образом, теперь оранжевый рейтинг (и звание _мастер_) будет начинаться от 2100 единиц рейтинга. * Нижняя граница рейтинга для _легендарных гроссмейстеров_ увеличена до 3000 единиц рейтинга. Таким образом, прямо сейчас в сообществе 14 участников соответствуют этому требованию. Настоящие легенды! * Для раундов серии «только для Div. 2» увеличена верхняя граница рейтинга для официального участия. Теперь все, чей рейтинг менее 2100 (то есть до _кандидатов в мастера_ включительно) смогут зарегистрироваться на такие раунды для участия в конкурсе, их рейтинг будет обновлён по результатам раунда. Мы не планируем повышать сложность Div. 2 раундов. Практика показывает, что задачи таких раундов и сейчас интересны и полезны ...
increased. Now everyone whose rating is less than 2100 (i.e., before _masters_) will be able to register, title) will start from 2100 rating units., рейтинг (и звание _мастер_) будет начинаться от 2100 единиц рейтинга., ) will start from 2100 rating units. * The lower bound of the rating for _legendary grandmasters_ is, . Теперь все, чей рейтинг менее 2100 (то есть до _кандидатов в мастера_ включительно) смогут

Full text and comments »

  • Vote: I like it
  • +1973
  • Vote: I do not like it

2.
Codeforces Round #648 (Div. 2)
By Ashishgup, 6 years ago, In English
Codeforces Round #648 (Div. 2) Hi everyone! I would like to invite you to my fifth Codeforces Round, that I set with my friends [user:FastestFinger,2020-06-05], [user:Vivek1998299,2020-06-05] and [user:ridbit10,2020-06-05]. We are excited to bring another contest within a week :D With that said, I bring to your attention our new [contest:1365] that will take place on [contest_time:1365]. If your rating is less than **2100**, this round will be rated for you; otherwise, you can participate out of competition. I would really like to thank: - [user:FastestFinger,2020-06-05], [user:Vivek1998299,2020-06-05] and [user:ridbit10,2020-06-05] for helping with preparing problems and giving new ideas. - [user:300iq,2020-06-05] for coordinating our round. - [user:Um_nik,2020-06-06], [user:antontrygubO_o,2020-06-05], [user:ksun48,2020-06-05], [user:Jeel_Vaishnav,2020-06-05], [user:aryanc403,2020-06-05], [user:FlowerOfSorrow,2020-06-05], [user:KonaeAkira,2020-06-05], [user:_Aaryan_,2020-06-05], [user:Ari,2020-06-...
**2100**, this round will be rated for you; otherwise, you can participate out of competition. I, [contest_time:1365]. If your rating is less than **2100**, this round will be rated for you; otherwise, you

Full text and comments »

  • Vote: I like it
  • +2104
  • Vote: I do not like it

3.
Codeforces Round #646 (Div. 2)
By Ashishgup, 6 years ago, In English
Codeforces Round #646 (Div. 2) Hi everyone! I would like to invite you to my fourth Codeforces Round, which I have made with my friends [user:FastestFinger,2020-05-29] and [user:TheOneYouWant,2020-05-29]. In terms of problems, it is my favorite among all my rounds. With that said, I bring to your attention our new [contest:1363] that will take place on [contest_time:1363]. If your rating is less than **2100**, this round will be rated for you; otherwise, you can participate out of competition. I would really like to thank: - [user:FastestFinger,2020-05-29] and [user:TheOneYouWant,2020-05-29] for helping with preparing problems and giving new ideas. - [user:antontrygubO_o,2020-05-29] for coordinating our round - [user:300iq,2020-05-29], [user:Jeel_Vaishnav,2020-05-29], [user:Ari,2020-05-29], [user:aryanc403,2020-05-29], [user:mahmoudbadawy,2020-05-29], [user:Vivek1998299,2020-05-29], [user:Uzumaki_Narutoo,2020-05-30], [user:Bakry_,2020-05-31], [user:smartnj,2020-05-30] and [user:Nikhil_Medam,2020-05-29]...
[contest_time:1363]. If your rating is less than **2100**, this round will be rated for you; otherwise, you, :1363] that will take place on [contest_time:1363]. If your rating is less than **2100**, this round

Full text and comments »

  • Vote: I like it
  • +2050
  • Vote: I do not like it

4.
Codeforces Round 1121 (Div. 2)
By qwexd, 2 months ago, In English
Codeforces Round 1121 (Div. 2) <div class="problem-statement" style="border:0 !important; padding:0 !important; margin:0.5em !important; box-shadow:none !important;"> <div class="header"> <div class="title">1121. Another Round</div> <div class="time-limit"><div class="property-title">time limit per participant</div> 2 hours</div> <div class="memory-limit"><div class="property-title">memory limit per participant</div> 1 brain</div> </div> <div class="legend"> <p> <i>This is <s>an interactive problem</s> a contest with an <b>unusual start time</b>.</i> </p> <p> You are given a Codeforces account and $n = 6$ problems, authored and prepared by [user:qwexd,2026-09-12] and [user:jeroenodb,2026-09-12]. </p> <p> In one operation, you may choose a problem $i$ ($1 \le i \le n$) and submit a program intended to solve it. </p> <p> The maximum scores are given below. Problem E is divided into two subtasks. </p> <div style="overflow-x:auto; margin:0.5em 0 1em;"> <table style="border-collapse:co...
The round is rated for participants with a rating below 2100. Participants with a , >below 2100. Participants with a rating of 2100 or higher are welcome to participate out of

Full text and comments »

  • Vote: I like it
  • +1304
  • Vote: I do not like it

5.
Codeforces Round #651 (Div. 2)
By Ashishgup, 6 years ago, In English
Codeforces Round #651 (Div. 2) Hi everyone! I would like to invite you to another one of our rounds, that I set with my friends [user:FastestFinger,2020-06-05], [user:smartnj,2020-06-19], [user:the_hyp0cr1t3,2020-06-19] and [user:ridbit10,2020-06-05]. The round [contest:1370] will take place on [contest_time:1370]. If your rating is less than **2100**, this round will be rated for you; otherwise, you can participate out of competition. I would really like to thank my co-setters and: - [user:isaf27,2020-06-05] for coordinating our round. - [user:cerberus97,2020-06-19], [user:Devil,2020-06-19], [user:Taran_1407,2020-06-19], [user:Alireza_Keshavarz,2020-06-19], [user:Vivek1998299,2020-06-19], [user:KonaeAkira,2020-06-19], [user:demoralizer,2020-06-19], [user:Dragnoid99,2020-06-19], [user:agtxdy,2020-06-19], [user:Rajdeep,2020-06-19], [user:aryanc403,2020-06-19], [user:lavish315,2020-06-19], [user:DeadlyCritic,2020-06-19], [user:Utkarsh.25dec,2020-06-19], [user:AmShZ,2020-06-19], [user:_Aaryan_,2020-06-19]...
your rating is less than **2100**, this round will be rated for you; otherwise, you can participate out, The round [contest:1370] will take place on [contest_time:1370]. If your rating is less than **2100

Full text and comments »

  • Vote: I like it
  • +1654
  • Vote: I do not like it

6.
Educational Codeforces Round 121 [Rated for Div. 2]
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 121 [Rated for Div. 2] Hello Codeforces! On [contest_time:1626] [contest:1626] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2022-01-15] Dalabaev, Vladimir [user:vovuh,2022-01-15] Petrov, Ivan [user:BledDest,2022-01-15] Androsov, Mak...
will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC, участников с рейтингом менее 2100**. Соревнование будет проводиться по немного расширенным правилам, This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +1670
  • Vote: I do not like it

7.
Codeforces Round #663 (Div. 2)
By shashwatchan, history, 6 years ago, In English
Codeforces Round #663 (Div. 2) Henlo Codeforces! ^_^ I invite you to participate in [Codeforces Round #663 (Div.2)](https://codeforces.me/contests/1391) taking place on [contest_time:1391]. The round is rated for users rated less than 2100, while other users can participate non-competitively. The round features five problems, and you have 2 hours to solve them. There may, or may not, be an interactive problem; regardless, you should [know](https://codeforces.me/blog/entry/45307) how to deal with them. I would, now, like to thank– - [user:antontrygubO_o,2020-07-31] for coordination <s>and manipulation</s>. - [user:AwakeAnay,2020-07-31], [user:AsleepAdhyyan,2020-07-31], and [user:RestingRajarshi,2020-07-31] for always listening to my problem ideas. - [user:BRCode,2020-08-03] for making [3b1b-style](https://www.youtube.com/watch?v=LYrtRnz35sU) video editorials of the problems! - [user:Aggu_01000101,2020-08-07], [user:Devil,2020-07-31], [user:Dragnoid99,2020-07-31], [user:NOOBxCODER,2020-07-31], [use...
less than 2100, while other users can participate non-competitively. The round features five, ) taking place on [contest_time:1391]. The round is rated for users rated less than2100, while

Full text and comments »

  • Vote: I like it
  • +1305
  • Vote: I do not like it

8.
Как провести Div 1 или Div 2 раунд на Codeforces
By KAN, 6 years ago, In English
Как провести Div 1 или Div 2 раунд на Codeforces Как вы наверняка знаете, большинство раундов на Codeforces созданы активными участниками нашего сообщества. Мы очень благодарны талантливым авторам со всего мира за то, что они знакомят десятки тысяч участников наших соревнований со своими идеями, предоставляя возможность учиться и получать удовольствие от решения задач как новичкам, так и лучшим в мире спортивным программистам. Этот пост расскажет, как стать автором задач и провести раунд на Codeforces. ## Кто может стать автором Обычно авторами наиболее интересных и качественных задач являются опытные участники. Так как наши ресурсы по обработке предложений задач ограничены, то с 1-го января 2021, для предложения своих задач вы должны удовлетворять следующим условиям: - рейтинг &mdash; 2100 или выше, или - уже был автором. В будущем ограничения могут быть изменены, пост будет обновлен. Если вы уже открыли ваш раунд для ревью, то он будет рассмотрен независимо от действующих ограничений, не волнуйтесь. Если вы не подхо...
requirements for problem authors will be applied: - rating: 2100 or above, or - was a writer in, должны удовлетворять следующим условиям: - рейтинг — 2100 или выше, или - уже был автором, - rating: 2100 or above, or - was a writer in the past., - рейтинг — 2100 или выше, или - уже был автором.

Full text and comments »

  • Vote: I like it
  • +932
  • Vote: I do not like it

9.
Codeforces Round #685 (Div. 2)
By Ashishgup, 6 years ago, In English
Codeforces Round #685 (Div. 2) Hi everyone! I would like to invite you to another one of our rounds, that I set with my friends [user:Jeel_Vaishnav,2020-11-19], [user:FastestFinger,2020-11-19], [user:Utkarsh.25Dec,2020-11-19], [user:the_hyp0cr1t3,2020-11-19] and [user:ridbit10,2020-11-19] We had two approved contests, but decided to merge it into one with more logical thinking ^_^ The round [contest:1451] that will take place on [contest_time:1451]. If your rating is less than **2100**, this round will be rated for you; otherwise, you can participate out of competition. I would really like to thank my co-setters and: - [user:300iq,2020-06-05] for coordinating our round and always replying quickly. - [user:jtnydv25,2020-11-19], [user:antontrygubO_o,2020-11-20], [user:Monogon,2020-11-19], [user:Vivek1998299,2020-11-19], [user:tejas10p,2020-11-19], [user:smit_mandavia,2020-11-19], [user:T1duS,2020-11-20], [user:kshitij_sodani,2020-11-20], [user:ayushsinghiitr,2020-11-19], [user:Ajax,2020-11-19], [user:...
**2100**, this round will be rated for you; otherwise, you can participate out of competition., take place on [contest_time:1451]. If your rating is less than **2100**, this round will be rated for

Full text and comments »

  • Vote: I like it
  • +1117
  • Vote: I do not like it

10.
Mike, alts and unfriendly comments
By dXqwq, 2 years ago, In English
Mike, alts and unfriendly comments I know that the following content might not be welcomed and I will lose lots of contribution, but I should write something about such a bunch of chaotic comments under there. I may delete this tomorrow if I find my words useless. ### What happened Several months ago, Mike posted a blog about banning [user:orzdevinwang,2024-10-07]'s alt, [user:zh0ukangyang,2024-10-07], and more alts. Lots of participants, including myself, were angry because [user:zh0ukangyang,2024-10-07] is such a talented coder and codeforces didn't treat the rule of single account seriously at that time. Then more and more alt accounts with high rating are reported, including mine. After that I didn't use alts anymore, and most of high-rated Chinese participants(100% in my friends) discarded their alts and followed the rules. We might think that the rules are not that perfect, but rules are rules. I believe that no one will say "Banning [user:zh0ukangyang,2024-10-07] is unacceptable". But I know what y...
alt accounts with 2100~2400 could be much more annoying. But detecting them is as hard as detecting, with 2100~2400 could be much more annoying. But detecting them is as hard as detecting cheaters! So

Full text and comments »

  • Vote: I like it
  • +1016
  • Vote: I do not like it

11.
Codeforces Round #742 (Div. 2)
By ScarletS, 5 years ago, In English
Codeforces Round #742 (Div. 2) Hey there Codeforces! [user:flamestorm,2021-09-01] and I are glad to invite you to our first-ever Codeforces round, [contest:1567], which will be held on [contest_time:1567]. **This round will be rated for participants with rating lower than 2100**. Special shoutouts to: - [user:adedalic,2021-09-01], for his fantastic coordination and translation of the round! - [user:MikeMirzayanov,2021-09-01], for creating the amazing Codeforces and Polygon platforms! - [user:dorijanlendvaj,2021-09-01], [user:awoo,2021-09-01], [user:YouKn0wWho,2021-09-01], [user:PurpleCrayon,2021-09-01], [user:shxgun,2021-09-01], [user:ijxjdjd,2021-09-01], [user:stefdasca,2021-09-01], [user:epicxtroll,2021-09-01], [user:Aaeria,2021-09-01], [user:Eyed,2021-09-01], [user:rkm62,2021-09-01], [user:Shinchan01,2021-09-02], [user:BRCode,2021-09-02], [user:namanbansal013,2021-09-05], [user:Urvuk3,2021-09-01], [user:1_2_oatmeal,2021-09-01], [user:richy6,2021-09-01], and [user:tdpencil,2021-09-01] for testing th...
with rating lower than 2100**.

Full text and comments »

  • Vote: I like it
  • +967
  • Vote: I do not like it

12.
Codeforces Round 860 (Div. 2)
By sevlll777, 4 years ago, translation, In English
Codeforces Round 860 (Div. 2) Hello Codeforces! Невероятно рад пригласить вас на [contest:1798], который пройдёт в [contest_time:1798]. Раунд будет **рейтинговым для всех участников, чей рейтинг ниже 2100**. Участники с бóльшим рейтингом приглашены принять участие в раунде вне конкурса. Вам будет дано **6 задач** и **120 минут** на их решение. Все задачи раунда придуманы и подготовлены мной. Традиционный список благодарностей всем, кто принял участие в создании раунда: &#129332; [user:DishonoredRighteous,2023-03-19] за координирование раунда &#128030; [user:gyh20,2023-03-19] за чёрно-красное тестирование раунда &#128520; [user:feecIe6418,2023-03-19], [user:iakovlev.zakhar,2023-03-19], [user:Dart-Xeyter,2023-03-19], [user:Adam_GS,2023-03-19], [user:felys,2023-03-19], [user:golikovnik,2023-03-19], [user:Gary2005,2023-03-19] за красное тестирование раунда &#128043; [user:NemanjaSo2005,2023-03-19], [user:Alexdat2000,2023-03-19], [user:Kon567889,2023-03-19], [user:tem_shett,2023-03-19] за оранже...
[contest_time:1798]. This round will be **rated for participants with rating lower than2100**. Participants, [contest_time:1798]. Раунд будет **рейтинговым для всех участников, чей рейтинг ниже2100**. Участники с, This round will be **rated for participants with rating lower than 2100**. Participants with a, Раунд будет **рейтинговым для всех участников, чей рейтинг ниже 2100**. Участники с бóльшим

Full text and comments »

  • Vote: I like it
  • +822
  • Vote: I do not like it

13.
Codeforces Round #932 (Div. 2)
By artew, 3 years ago, translation, In English
Codeforces Round #932 (Div. 2) <img alt=" " src="https://i.imgur.com/EFlomVE.png" style="float: right;max-width: 100.0%;max-height: 100.0%;width:30%;height:30%"> <h2>Привет, Codeforces! &#128519;</h2> ------------------ Мы рады пригласить вас поучавствовать в [contest:1935], который состоится во [contest_time:1935] &#128293; &#128561; &#129321; Раунд был полностью подготовлен учениками ШЦПМ &#128147; (Школы Центра Педагогического Мастерства): [user:IzhtskiyTimofey,2024-02-25], [user:AndreyPavlov,2024-02-25] и мной. Тематикой всех задач послужит наша любимая школа &#128520; Этот раунд будет **рейтинговым** для участников, чей рейтинг ниже **2100** &#128522; Участники с более высоким рейтингом могут принять участие вне конкурса &#128523; Мы хотели бы поблагодарить &#128149;: - Нашего замечательного координатора [user:Artyom123,2024-02-25] за помощь в подготовке задач и ценные советы! &#128525; - Учеников ШЦПМ [user:azureglow,2024-02-25] и [user:max0000561,2024-02-25] за предложенные задачи &#1285...
участников, чей рейтинг ниже **2100** 😊 Участники с более высоким рейтингом могут принять, This round will be **rated** for participants with a rating below **2100** 😊 Participants, Этот раунд будет **рейтинговым** для участников, чей рейтинг ниже **2100** 😊 Участники с

Full text and comments »

  • Vote: I like it
  • +911
  • Vote: I do not like it

14.
Codeforces Round #655 (Div. 2)
By gotexans, 6 years ago, In English
Codeforces Round #655 (Div. 2) Hey everybody! We ([user:MagentaCobra,2020-07-05], [user:Tlatoani,2020-07-05], [user:golions,2020-07-05], [user:qlf9,2020-07-05]) are super excited to invite you to take part in [contest:1372], which will happen on [contest_time:1372]. _Please note the unusual start time_. The round is rated for users with rating strictly less than **2100**, although higher rated users are more than welcome to take part out of competition. Huge thanks to those who helped make this round possible: - [user:Tlatoani,2020-07-06], [user:golions,2020-07-06], [user:qlf9,2020-07-06] for creating problems and preparation - [user:antontrygubO_o,2020-07-05] for r̶e̶j̶e̶c̶t̶i̶n̶g̶ ̶m̶o̶s̶t̶ ̶o̶f̶ ̶o̶u̶r̶ ̶p̶r̶o̶b̶l̶e̶m̶s̶ coordinating our round - [user:gamegame,2020-07-05], [user:dorijanlendvaj,2020-07-05], [user:thenymphsofdelphi,2020-07-05], [user:aryanc403,2020-07-05], [user:Ari,2020-07-05], [user:alireza_kaviani,2020-07-05], [user:KonaeAkira,2020-07-05], [user:Mn619,2020-07-05], [user:AmShZ,2020-07...
strictly less than **2100**, although higher rated users are more than welcome to take part out of, users with rating strictly less than **2100**, although higher rated users are more than welcome to

Full text and comments »

  • Vote: I like it
  • +1346
  • Vote: I do not like it

15.
Codeforces Round #672 (Div. 2)
By Wind_Eagle, 6 years ago, translation, In English
Codeforces Round #672 (Div. 2) Привет, Codeforces! Я очень рад пригласить вас на [Codeforces Round #672 (Div. 2)](https://codeforces.me/contest/1420), который пройдет в [contest_time:1420]. <b>Этот раунд будет рейтинговым для участников, чей рейтинг ниже 2100.</b> Все задачи придумал я, но с двумя последними задачами очень помог [user:gepardo,2020-09-22], без него этих задач могло бы и не быть. Мои благодарности: - [user:antontrygubO_o,2020-09-22] за координацию раунда. Именно благодаря такой отличной координации в соревновании остались только хорошие задачи. Спасибо! - [user:gepardo,2020-09-22] сделал много чего, без него этого соревнования просто не было бы! Он не только помог с двумя последними задачами, но и помогал мне разбираться, как правильно делать задачи на Codeforces. Спасибо! - [user:EIK,2020-09-22] это тот человек, без которого я бы вообще не попал в спортивное программирование — мой учитель информатики. Спасибо! - [user:programmer228,2020-09-22], [user:Hacktafly,2020-09-22], [user...
participants with rating lower than 2100., ниже 2100.

Full text and comments »

  • Vote: I like it
  • +929
  • Vote: I do not like it

16.
Codeforces Round #703 (Div. 2)
By okwedook, 6 years ago, In English
Codeforces Round #703 (Div. 2) Привет, Codeforces! Наконец-то я могу что-то вернуть этому прекрасному сообществу, поэтому я рад пригласить вас принять участие в [Codeforces Round #703 (Div. 2)](https://codeforces.me/contest/1486), который состоится в [contest_time:1486]. Раунд будет **рейтинговым для участников с рейтингом менее 2100**. Участники из первого дивизиона могут принять участие в раунде вне конкурса. Вам будет предложено **6 задач** и **2 часа 15 минут** чтобы их решить. Все задачи раунда придуманы и подготовлены мной. Одна из задач будет интерактивной, пожалуйста ознакомьтесь с [гайдом для интерактивных задач](https://codeforces.me/blog/entry/45307) перед контестом. Я также хочу поблагодарить: <ul> <li> [user:antontrygubO_o,2021-02-16] за отличную координацию! </li> <li> [user:1-gon,2021-02-16], [user:3EVEHAR_KOAVA,2021-02-16], [user:Akulyat,2021-02-16], [user:Aleks5d,2021-02-16], [user:BRCode,2021-02-16], [user:Osama_Alkhodairy,2021-02-16], [user:PO3OBAR_Bblnb,2021-02-16], [user:arzhant...
[contest_time:1486]. The round will be **rated for the participants with rating lower than2100, lower than 2100**. Participants from the first division are also welcomed to take part out of, в [contest_time:1486]. Раунд будет **рейтинговым для участников с рейтингом менее2100**. Участники, менее 2100**. Участники из первого дивизиона могут принять участие в раунде вне конкурса. Вам

Full text and comments »

  • Vote: I like it
  • +908
  • Vote: I do not like it

17.
Codeforces Round #652 (Div. 2)
By DeadlyCritic, history, 6 years ago, In English
Codeforces Round #652 (Div. 2) $$~-\text{In the name of God}~-$$ Hi community, I'm glad to invite you to my first contest, [contest:1369] which will be held at [contest_time:1369] ($\text{notice the unusual time}$). The problems are mainly prepared and invented by me. The round is rated for participants with rating strictly less than $2100$, others are able to take part in the round out of competition. You will be given $2$ $\text{hours}$ to solve $6$ $\text{problems}$. Firstly I'd like to thank [user:adedalic,2020-06-15] for coordinating and reviewing the round, as well as helping with many different things. I'd like to thank [user:antontrygubO_o,2020-06-21], [user:physics0523,2020-06-21], [user:McDic,2020-06-21], [user:Ashishgup,2020-06-21], [user:dannyboy20031204,2020-06-21], [user:Kuzey,2020-06-21], [user:Return_0,2020-06-21], [user:FieryPhoenix,2020-06-21], [user:ma_da_fa_ka,2020-06-21], [user:ITDOI,2020-06-21], [user:AM_I_Learning,2020-06-21], [user:pikmike,2020-06-21], [user:lynmisakura,2020-06-...
is rated for participants with rating strictly less than $2100$, others are able to take part in, strictly less than $2100$, others are able to take part in the round out of competition. You will be

Full text and comments »

  • Vote: I like it
  • +1239
  • Vote: I do not like it

18.
Codeforces Round #746 (Div. 2)
By Hemose, history, 5 years ago, In English
Codeforces Round #746 (Div. 2) صباحو (Good Morning), Codeforces! I'm glad to invite you to [contest:1592], which will be held on [contest_time:1592]. This round is rated for the participants with rating lower than 2100. You will be given **6 problems** and **2 hours** to solve them. All problems were prepared by me and [user:Bakry_,2021-10-01]. One of the problems will be interactive. So, it is recommended to read the [guide on interactive problems](https://codeforces.me/blog/entry/45307) before the round. I would like to thank: - [user:antontrygubO_o,2021-10-01], for a lot of things (awesome coordination, suggestion for one of the tasks, helping in preparation, rejecting only not interesting tasks, a lot of useful discussions). - [user:KostasKostil,2021-10-01] for one of the tasks and [user:antontrygubO_o,2021-10-01] for preparing it. - [user:YahiaSherif,2021-10-01], [user:ZeyadKhattab,2021-10-01], [user:mahmoudbadawy,2021-10-01], [user:Uzumaki_Narutoo,2021-10-01], [user:_zaher_,2021-10-01]...
on [contest_time:1592]. This round is rated for the participants with rating lower than2100, This round is rated for the participants with rating lower than 2100.

Full text and comments »

  • Vote: I like it
  • +806
  • Vote: I do not like it

19.
Codeforces Round #761 (Div. 2)
By snowysecret, 5 years ago, In English
Codeforces Round #761 (Div. 2) Hello, Codeforces! I am happy to invite you to [contest:1617], which will take place on [contest_time:1617]. The round will be rated for participants with rating lower than 2100. **Notice the unusual starting time.** All the problems were authored and prepared by me. The round wouldn’t be possible without these people: - [user:Artyom123,2021-12-14] for excellent coordination and translation of statements. - [user:KAN,2021-12-14] for help with round preparation. - [user:arvindf232,2021-12-14], [user:physics0523,2021-12-14], [user:SecondThread,2021-12-15], [user:Igorbunov,2021-12-14], [user:kevinxiehk,2021-12-14], [user:generic_placeholder_name,2021-12-14], [user:Kotehok3,2021-12-14], [user:minhcool,2021-12-14], [user:anthony123,2021-12-14], [user:Elison,2021-12-14], [user:shishin,2021-12-14], [user:I_Love_YrNameCouldBeHere,2021-12-14], [user:Absyarka,2021-12-14], [user:erniepsycholone,2021-12-14], [user:dbsbs,2021-12-14], [user:lomienyeet,2021-12-14] for testing and valuabl...
[contest_time:1617]. The round will be rated for participants with rating lower than2100. **Notice the, will be rated for participants with rating lower than 2100. **Notice the unusual starting time.**

Full text and comments »

  • Vote: I like it
  • +773
  • Vote: I do not like it

20.
Codeforces Round #688 (Div. 2)
By djm03178, history, 6 years ago, In English
Codeforces Round #688 (Div. 2) **오랜만이에요, 코드포스!** (Long time no see, Codeforces!) I'd like to welcome all of you to [contest:1453]! The contest will start at [contest_time:1453], and it is **rated** for all participants with ratings under 2100. **Note the semi-unusual start time**. You will be given **6 problems** and **2 hours and 15 minutes** to solve them. The score distribution will be announced soon. All problems are prepared by me, with a lot of help from the testers <s>making me realize that my solutions are dumb</s>. Thanks to [user:Green55,2020-11-30], [user:JooDdae,2020-11-30], [user:cs71107,2020-11-30], [user:CodePlatina,2020-11-30], [user:FlowerOfSorrow,2020-11-30], [user:jh05013,2020-11-30], [user:Anus1373,2020-11-30], [user:39dll,2020-11-30], [user:alswhp,2020-11-30], [user:Ku_Top,2020-11-30], [user:sonjaewon,2020-11-30], [user:slah007,2020-11-30], [user:jooncco,2020-11-30], and [user:__rkm__,2020-11-30] for testing the round, and especially [user:xiaowuc1,2020-11-30] for helping polish Engl...
ratings under 2100. **Note the semi-unusual start time**. You will be given **6 problems** and **2, ], and it is **rated** for all participants with ratings under 2100. **Note the semi-unusual start time**.

Full text and comments »

  • Vote: I like it
  • +757
  • Vote: I do not like it

21.
Codeforces Round 973 (Div. 2)
By soullless, 2 years ago, translation, In English
Codeforces Round 973 (Div. 2) Good Day Codeforces! Me, [user:Wansur,2024-09-16] and [user:Chalishkan,2024-09-16] are happy to invite you to take part in [contest:2013], which starts on [contest_time:2013]. You will be given 6 problems and 2 hours to solve them. One problem is divided into two subtasks. The round will be rated for all participants with a rating lower than 2100. The problems were authored by me, [user:Wansur,2024-09-16] and [user:Chalishkan,2024-09-16] to solve and alter them. We would like to thank: - [user:FairyWinx,2024-09-16] for wonderful coordination. - [user:triple__a,2024-09-16], [user:sevlll777,2024-09-16], [user:bashkort,2024-09-20], [user:sstrong,2024-09-16] for red testing. - [user:Tima,2024-09-16], [user:exhausted,2024-09-16], [user:Kihihihi,2024-09-16], [user:Aldk,2024-09-16], [user:lebowski998,2024-09-16], [user:Issa,2024-09-16], [user:shenfe1,2024-09-16], [user:Nuris,2024-09-16], [user:MnTm,2024-09-16] for orange testing. - [user:NewLul,2024-09-16], [user:vsinitsyna...
rated for all participants with a rating lower than 2100. The problems were authored by me, The round will be rated for all participants with a rating lower than 2100.

Full text and comments »

  • Vote: I like it
  • +627
  • Vote: I do not like it

22.
Codeforces Round #777 (Div. 2)
By FairyWinx, 5 years ago, translation, In English
Codeforces Round #777 (Div. 2) Привки, Кодефорсес (ﾉ◕ヮ◕)ﾉ*:･ﾟ✧ ------------------ <img src="/predownloaded/b1/4a/b14a9b0bf490c91e37290a3dca53f53b9f6680b0.jpg" style="float: right;margin: 0 1.0em 1.0em 1.0em;max-width: 100.0%;max-height: 100.0%;"> [user:Igorbunov,2022-03-10] и я рады пригласить вас поучаствовать в [contest:1647] _(шутка про казино)_, все задачи которого будут про маленькую девочку Мадоку. Он состоится в [contest_time:1647]. Раунд будет **рейтинговым** для всех участников с рейтингом строго меньшим **2100**. И у вас будет **2 часа**, чтобы решить **6 задач**. Также хочется выразить благодарность следующим лицам: - Нашему милому координатору [user:Artyom123,2022-03-10]. - Милым тестерам за милый фидбек по милым задачам: [user:FelixDzerzhinsky,2020-09-14], [user:lesssia,2022-03-09], [user:eyakm1,2022-03-09], [user:_Vanilla_,2022-03-09], [user:morzer,2022-03-09], [user: welleyth,2022-03-09], [user:TeaTime,2022-03-09], [user:Dart-Xeyter,2022-03-09], [user:Kon567889,2022-03-09], [user:Rened...
**2100**. И у вас будет **2 часа**, чтобы решить **6 задач**. Также хочется выразить благодарность, participants with rating strictly lower than **2100**. You will have **2 hours** to solve **6 problems, ]. The round will be **rated** for all participants with rating strictly lower than **2100**. You will, ]. Раунд будет **рейтинговым** для всех участников с рейтингом строго меньшим ** 2100**. И у вас будет **2

Full text and comments »

  • Vote: I like it
  • +808
  • Vote: I do not like it

23.
Codeforces Round #770 (Div. 2)
By Alexdat2000, 5 years ago, translation, In English
Codeforces Round #770 (Div. 2) Greetings to all humans and robots on this site! [user:sevlll,2022-01-23], [user:crazyilian,2022-02-03], [user:Mangooste,2022-02-03], [user:imachug,2022-02-03] and me ([user:Alexdat2000,2022-02-03]) invite everyone to participate in the [Codeforces Round #770 (Div. 2)](https://codeforces.me/contests/1634), which will take place this [contest_time:1634]. **This round will be rated for all participants with a rating of strictly less than 2100.** You will have **2 hours and 30 minutes** to solve 6 problems. There will be an interactive problem in the round, so we recommend all new participants to read [Interactive Problems Guide](https://codeforces.me/blog/entry/45307). The traditional thank-you list: - Thanks to [user:antontrygubO_o,2022-02-03] for coordinating us for a very long time and helping to improve one of the tasks - Thanks to [user:alexxela12345,2022-02-03] for tasks that did not survive till the final version of the round - Thanks to [user:Pechalka,2022-02-03], [u...
[contest_time:1634]. **This round will be rated for all participants with a rating of strictly less than2100, participants with a rating of strictly less than 2100.** You will have **2 hours and 30 minutes** to, меньше 2100.** У вас будет **2 часа 30 минут** на то, чтобы решить 6 задач. В раунде будет интерактивная, рейтинговым для всех участников с рейтингом строго меньше 2100.** У вас будет **2 часа 30 минут** на то

Full text and comments »

  • Vote: I like it
  • +957
  • Vote: I do not like it

24.
Codeforces Round 939 (Div. 2)
By 0doO, history, 3 years ago, In English
Codeforces Round 939 (Div. 2) ### Ciallo, codeforces～(∠・ω< )⌒☆ We are pleased to invite you to participate in [contest:1956], which will start on [contest_time:1956]. The problems are from [user:Otomachi_Una,2024-04-11] and me. This round will be rated for participants whose rating is below 2100. Participants with higher ratings may participate out of the competition. You will be given 6 problems and 2 hours to solve them. We hope you find them interesting. We would like to thank: - [user:DaiRuiChen007,2024-04-11] and [user:lichenghan,2024-04-11] for helping prepare this contest. - [user:IgorI,2024-04-11] and [user:irkstepanov,2024-04-12] for coordinating the round. - [user:A_G,2024-04-11], [user:NemanjaSo2005,2024-04-11], [user:yeminghan,2024-04-11], [user:lunchbox,2024-04-11], [user:Andreasyan,2024-04-11], [user:lsantire,2024-04-11], [user:RabbieWjy,2024-04-11], [user:yurongyi0504,2024-04-11], [user:KKT_89,2024-04-11], [user:MinaRagy06,2024-04-11], [user:carnation13,2024-04-11], [user:Romakole...
me. This round will be rated for participants whose rating is below 2100. Participants with, This round will be rated for participants whose rating is below 2100. Participants with higher

Full text and comments »

  • Vote: I like it
  • +652
  • Vote: I do not like it

25.
Codeforces Round 1044 (Div. 2)
By sammyuri, 15 months ago, In English
Codeforces Round 1044 (Div. 2) Hello, Codeforces! I'm thrilled to invite you to take part in [contest:2133], which starts on [contest_time:2133]. You will help Steve solve $6$ of his most dastardly problems in $2$ hours. The score distribution is as follows: <p style="text-align:center"> <img src="/predownloaded/07/57/0757452a070cd6b25d62fdcacfb781235241620f.png" width="4%"> $\,\,\,\,$ <img src="/predownloaded/40/b3/40b3439f782304be4b4c62054c6af9bbf991bf65.png" width="4%"> $\,\,\,\,$ <img src="/predownloaded/7b/6a/7b6a2b83683ab53ea95a40cfa4210cf4650da214.png" width="4%"> $\,\,\,\,$ <img src="/predownloaded/b7/14/b7143b79f660a73dbc5f5a0ff70cf213bb2f90f5.png" width="4%"> $\,\,\,\,$ <img src="/predownloaded/61/2b/612bf35ad4c6bb16c71a229e619a0399a1718951.png" width="4%"> $\,\,\,\,$ <img src="/predownloaded/70/3b/703b6ba7b857221cb8198c51a0fd0c2960493782.png" width="4%"> </p> $$\,500\,-1000-1750-2250-2750-3250$$ One of the problems may be interactive, so make sure to read the [guide for interactive problems](h...
The round will be **rated** for participants whose rating is **below 2100**. Participants with

Full text and comments »

  • Vote: I like it
  • +618
  • Vote: I do not like it

26.
Codeforces Round #754 (Div. 2)
By JeevanJyot, 5 years ago, In English
Codeforces Round #754 (Div. 2) Henlo Codeforces! We are very glad to invite you to the [contest:1605], which will be held on [contest_time:1605]. This round will be rated for participants with a rating less than $2100$. For higher rated participants, we challenge you to solve problem F ;) All the problems were authored and prepared by [user:Ashishgup,2021-11-08], [user:the_hyp0cr1t3,2021-11-08], [user:ExplodingFreeze,2021-11-08] and me. We have tried our best to create an interesting problemset with clear statements. Hope you enjoy the round :D You will be given $6$ problems and $2$ hours to solve them. We would like to thank: - [user:antontrygubo_O,2021-11-08] for his amazing coordination and help in improving our problems. - Our army of testers: [user:Um_nik,2021-11-08], [user:kefaa2,2021-11-08], [user:1-gon,2021-11-08], [user:_runtimeTerror_,2021-11-08], [user:Jeel_Vaishnav,2021-11-08], [user:AmShZ,2021-11-08], [user:errorgorn,2021-11-08], [user:ijxjdjd,2021-11-08], [user:Utkarsh.25dec,2021-11...
[contest_time:1605]. This round will be rated for participants with a rating less than $2100$. For, ]. This round will be rated for participants with a rating less than $2100$. For higher rated

Full text and comments »

  • Vote: I like it
  • +805
  • Vote: I do not like it

27.
Codeforces Round #600 (Div. 2)
By hugopm, 7 years ago, In English
Codeforces Round #600 (Div. 2) Hello, Codeforces! I'm glad to invite you to [contest:1253], which will be held on [contest_time:1253]. It will be **rated for all participants with rating below 2100**. You will be given **six problems** and **two hours** to solve them. As usual, the score distribution will be announced shortly before the round. The problems were invented and prepared by me. Huge thanks to: - [user:faremy,2019-11-14] for taking time to solve and give me precious feedback on most of the problems I have considered putting into my round throughout its whole creation (more than 6 months!) - [user:300iq,2019-11-14] for coordinating the round and giving helpful advices - [user:MikeMirzayanov,2019-11-14] for great systems Polygon and Codeforces - [user:dorijanlendvaj,2019-11-14], [user:McDic,2019-11-14], [user:nvmdava,2019-11-14], [user:_Kuroni_,2019-11-14], [user:fedoseev.timofey,2019-11-14], [user:Nebuchadnezzar,2019-11-14], [user:opukittpceno_hhr,2019-11-14], [user:aneesh2312,2019-11-14]...
**rated for all participants with rating below 2100**. You will be given **six problems** and **two, :1253]. It will be **rated for all participants with rating below 2100**. You will be given **six

Full text and comments »

  • Vote: I like it
  • +794
  • Vote: I do not like it

28.
Codeforces Round #919 (Div. 2)
By sum, history, 3 years ago, In English
Codeforces Round #919 (Div. 2) Hello Codeforces! ================= [user:omeganot,2024-01-10] and I are excited to invite you to participate in [contest:1920] which will start on [contest_time:1920]. You will be given 2 hours to solve 6 problems. One of the problems is divided into 2 subtasks. **This round will be rated for participants of Division 2 with a rating lower than 2100.** We would like to thank - [user:artyom123,2024-01-10] for his epic coordination and also for translating the problem statements! - [user:A_G,2024-01-10], [user:PurpleCrayon,2024-01-10], [user:juliany2,2024-01-10], [user:Andreasyan,2024-01-10], [user:oursaco,2024-01-10], [user:hyforces,2024-01-10], [user:Apple_Method,2024-01-10], [user:GusterGoose27,2024-01-13], [user:null_awe,2024-01-10], [user:awesomeguy856,2024-01-10], [user:lunchbox,2024-01-10], [user:jli505,2024-01-10], [user:Lemur95,2024-01-10], [user:ocasu,2024-01-10], [user:EmeraldBlock,2024-01-10], [user:EnDeRBeaT,2024-01-10], [user:cry,2024-01-10], [user:htetgm,2024...
**This round will be rated for participants of Division 2 with a rating lower than2100.**

Full text and comments »

  • Vote: I like it
  • +658
  • Vote: I do not like it

29.
Codeforces Round 892 (Div. 2)
By induk_v_tsiane, history, 3 years ago, translation, In English
Codeforces Round 892 (Div. 2) #### <b><font size="6">Hello, Codeforces.</font></b> <img src="/predownloaded/14/cc/14cc4faf55cf00829bc2720470af02030a8165c2.jpg"> We are happy to invite you to [contest:1859], which will take place on [contest_time:1859]. All of the problems are original and were prepared by a collective of authors, consisting of [user:kristevalex,2023-08-09], [user:i_love_penguins,2023-08-09], [user:efimovpaul,2023-08-09] and me, [user:induk_v_tsiane,2023-08-09]. <b> This round will be rated for participants with a rating lower than 2100.</b> We would like to thank: - [user:Artyom123,2023-08-09] for coordinating the round. - [user:maomao90,2023-08-09], [user:Yuu,2023-08-09], [user:Qwerty1232,2023-08-09] and [user:Mangooste,2023-08-09] for GM testing. - [user:maks_matiupatenko,2023-08-09], [user:tiom4eg,2023-08-09], [user:ilyakrasnovv,2023-08-09], [user:sergeev.PRO,2023-08-09], [user:EJIC_B_KEDAX,2023-08-09], [user:Yar_sem,2023-08-09], [user:gmusya,2023-08-09], [user:zwezdinv,2023-08...
participants with a rating lower than 2100. We would like to thank: - [user:Artyom123,2023-08-09, , [user:induk_v_tsiane,2023-08-09]. This round will be rated for participants with a rating lower than2100

Full text and comments »

  • Vote: I like it
  • +776
  • Vote: I do not like it

30.
Codeforces Round #665 (Div. 2)
By 055D, 6 years ago, In English
Codeforces Round #665 (Div. 2) Hello Codeforces! I'm glad to invite you to participate in [contest:1401] taking place on [contest_time:1401]. The round is **rated for users whose rating is lower than 2100**. All problems were mainly created and prepared by me, and I'd also like to thank: - [user:adedalic,2020-08-20] for coordinating and reviewing the round, - [user:AmShz,2020-08-20], [user:growup974,2020-08-20], [user:dorijanlendvaj,2020-08-20], [user:Osama_Alkhodairy,2020-08-20], [user:Mohamed.Sobhy,2020-08-20], [user:pikmike,2020-08-20], [user:kdjonty31,2020-08-20], [user:csani,2020-08-20], [user:BledDest,2020-08-20], [user:saurabhshadow,2020-08-20], [user:postscript,2020-08-20], [user:errorgorn,2020-08-20] for testing the problems and giving feedback, - [user:MikeMirzayanov,2020-08-20] for Codeforces and Polygon platforms, - All users for participating in the contest! You will be given **6 problems** and **2 hours** to solve them. The score distribution will be announced closer to the start ...
[contest_time:1401]. The round is **rated for users whose rating is lower than 2100**. All problems, round is **rated for users whose rating is lower than 2100**.

Full text and comments »

  • Vote: I like it
  • +717
  • Vote: I do not like it

31.
How to use Codeforces [GUIDE]
By SlavicG, 5 years ago, In English
How to use Codeforces [GUIDE] I see a lot of newcomers struggling to use the website to it's fullest, so I decided to write a blog that has all important information about how to use Codeforces in a single place. I will update it with time, so feel free to write your suggestions/questions in case I missed something and I will be glad to add it to the post! I would like to thank [user:_Vanilla_,2022-02-05] and [user:mesanu,2022-02-05] for helping me write the blog, and [user:Monogon,2022-02-05], [user:down,2022-02-05] and [user:AlperenT,2022-02-05] for proofreading and giving suggestions. #### Navigating through pages ![ ](https://media.discordapp.net/attachments/705371983650619454/928235498487570442/bandicam_2022-01-05_12-36-00-134.jpg?width=991&height=110) It's possible to navigate through most pages of Codeforces using the bar on the top, I will talk about what each tab does more in depth below: #### The Help Page The help page contains the answer to a lot of questions about Codeforces, such as rati...
; candidate master ([1900, 2099] rating) - yellow — master ([2100, 2299] rating) - orange &mdash

Full text and comments »

  • Vote: I like it
  • +726
  • Vote: I do not like it

32.
Codeforces Round #738 (Div. 2)
By Bazoka13, history, 5 years ago, In English
Codeforces Round #738 (Div. 2) Hi Codeforces! We are glad to invite you to our first Codeforces Round [contest:1559] which will be held on [contest_time:1559]. This round will be **rated for participants with rating less than 2100**. We will be glad to see participants from the first division to join out of competition as well! In this round, as the best friend of Mocha's, you are going to help her to solve the problems she meets. The problems are prepared by [user:2sozx,2021-08-12], [user:JJLeo,2021-08-12], [user:Serval,2021-08-12], [user:CalvinJin,2021-08-12] and me. We hope you will enjoy the round. :P We would like to thank: - [user:1-gon,2021-08-12] for awesome coordination of this round and helping us improve our problems. - [user:Toxel,2021-08-12] for excellent testing and discussion of this round. - [user:cppascalinux,2021-08-12], [user:PurpleCrayon,2021-08-12], [user:ijxjdjd,2021-08-12], [user:m371,2021-08-12], [user:qxforever,2021-08-12], [user:fixed_lxy,2021-08-12], [user:HKvv,2021...
[contest_time:1559]. This round will be **rated for participants with rating less than2100**. We will be, 2100**. We will be glad to see participants from the first division to join out of competition as

Full text and comments »

  • Vote: I like it
  • +796
  • Vote: I do not like it

33.
Codeforces Round 1025 (Div. 2)
By MOUFLESS, 18 months ago, In English
Codeforces Round 1025 (Div. 2) ## Ready to Duel? If yes, [user:fzark, 2025-05-09], [user:Intellegent, 2025-05-09], and I are glad to invite you to [Codeforces Round 1025 (Div. 2)](https://codeforces.me/contests/2109), which will be held on [contest_time:2109]. This round will be **rated for participants with rating lower than 2100**. We will also be glad to see the participants with a higher rating to participate in our round unofficially! You will be given **6** problems (with at least one interactive problem and one problem that has 3 versions) and **2 hours and 15 minutes** to solve them. Also you can read about interactive problems [here](https://codeforces.me/blog/entry/45307). **Please take a look at the score distribution; it may help you during the contest. Additionally, make sure to read all the problems.** We would like to thank: - [user:satyam343,2025-05-09], our great beloved coordinator. - [user:Kaitokid,2025-05-09], [user:rui_er,2025-05-09], [user:TripleM5da,2025-05-09], [user:N...
This round will be **rated for participants with rating lower than 2100**. We will also be glad to

Full text and comments »

  • Vote: I like it
  • +684
  • Vote: I do not like it

34.
Codeforces Round #922 (Div. 2)
By ace5, history, 3 years ago, translation, In English
Codeforces Round #922 (Div. 2) Hello, Codeforces! I and [user:ooaa,2024-01-29] are excited to invite you to participate in [Codeforces Round 922 (Div. 2)](https://codeforces.me/contest/1918), which will take place on [contest_time:1918]. This round will be **rated** for participants, whose **rating is below 2100**. Participants with higher rating can participate unofficially. You will be given 7-8 problems and 2 hours to solve them. We recommend you to read all the problems. **1 or more interactive problems may occur in the round**, so we suggest to read this [post](https://codeforces.me/blog/entry/45307). We would like to thank: - [user:Akulyat,2024-01-29] for the excellent coordination of our round. - [user:wuhudsm,2024-01-29] for finding that the previous C has already occured in one of the rounds. - [user:A_G,2024-01-29], [user:bashkort,2024-01-29], [user:orz,2024-01-29], [user:Andreasyan,2024-01-29], [user:green_gold_dog,2024-01-29], [user:zwezdinv,2024-01-29], [user:EJIC_B_KEDAX,2024-01-2...
This round will be **rated** for participants, whose **rating is below 2100**. Participants with, Этот раунд будет **рейтинговым** для участников, чей **рейтинг ниже 2100**. Участники с более

Full text and comments »

  • Vote: I like it
  • +575
  • Vote: I do not like it

35.
Codeforces Round #669
By i.e, 6 years ago, translation, In English
Codeforces Round #669 Мы с [user:realhype,2020-09-06] рады пригласить вас на [contest:1407], который пройдет в [contest_time:1407]. **Он будет рейтинговым для всех участников, чей рейтинг ниже 2100.** Задачи были придуманы и подготовлены [user:realhype,2020-09-06] и [user:i.e,2020-09-06]. Мы хотим поблагодарить всех, кто оказался причастен к этому раунду: - [user:antontrygubO_o,2020-09-06] за координацию раунда и высокое чувство вкуса, благодаря чему у нас получился отличный контест. - [user:xiryss,2020-09-06], [user:Tlatoani,2020-09-06], [user:hugopm,2020-09-06], [user:Alireza_Keshavarz,2020-09-06], [user:jouIej,2020-09-06], [user:jo_ulej,2020-09-06], [user:dick,2020-09-06], [user:Ari,2020-09-06], [user:AmShZ,2020-09-06], [user:AliceWalkingOutOfHerLife,2020-09-06], [user:Devil,2020-09-06], [user:morzer,2020-09-06], [user:baby_baby_baby_ooh,2020-09-06], [user:PM11,2020-09-06], [user:postscript,2020-09-06], [user:Programmer,2020-09-06], [user:saurabhshadow,2020-09-06], [user:_overrated_,2020-09-06],...
[contest_time:1407]. **Он будет рейтинговым для всех участников, чей рейтинг ниже2100.**, than 2100.**

Full text and comments »

  • Vote: I like it
  • +736
  • Vote: I do not like it

36.
Codeforces Round #723 (Rated for Div 2)
By errorgorn, history, 5 years ago, In English
Codeforces Round #723 (Rated for Div 2) Hello again Codeforces! [user:Errorgorn,2021-05-25], [user:Oolimry,2021-05-25] and [user:ILoveIOI,2021-05-25] are glad to invite you to participate in [contest:1526] which will be held at [contest_time:1526]. The round will be **rated for the participants with a rating lower than 2100**. Participants from the first division are also welcomed to take part in the competition but it will be unrated for them. You will be given **2 hours and 30 minutes** to solve **6 questions**. One of the puzzles is interactive, please read [the guide of interactive](https://codeforces.me/blog/entry/45307) [problems](https://en.wikipedia.org/wiki/Binary_search_algorithm) before the contest. We would like to thank: - Our lord and saviour [user:AntontrygubO_o,2021-05-25] for amazing coordination and rejecting our poopoo tasks - [user:dantoh000,2021-05-25] and [user:tqbfjotld,2021-05-25] for roasting our enigmas and testing them before they were prepared - our many testers [user:balbit,2021-05...
[contest_time:1526]. The round will be **rated for the participants with a rating lower than2100, be **rated for the participants with a rating lower than 2100**. Participants from the first

Full text and comments »

  • Vote: I like it
  • +923
  • Vote: I do not like it

37.
The Ultimate Reroot Template
By pajenegod, 3 years ago, In English
The Ultimate Reroot Template Hi Codeforces! Have you ever had this issue before? ![ ](https://cdn.discordapp.com/attachments/572613134020247562/1191774699110285392/image.png?ex=65a6a9ae&is=659434ae&hm=aeb62b0d97a84c226709b88bc3db7647f4509eef7c3a757a798ffe37e7e91c2b&) If yes, then you have come to the right place! This is a blog about my super easy to use template for (reroot) DP on trees. I really believe that this template is kind of revolutionary for solving reroot DP problems. I've implemented it both in [Python](https://codeforces.me/contest/1324/submission/240129139) and in [C++](https://codeforces.me/contest/1324/submission/240131453) (the template supports `Python2`, `Python3` and `>= C++14`). Using this template, you will be able to easily solve > 2000 rated reroot problems in a couple of minutes, with a couple of lines of code. A big thanks goes out to everyone that has helped me by giving feedback on blog and/or discussing reroot with me, [user:nor,2024-01-03], [user:meooow,2024-01-03], [u...
(2100 rating) [problem:1187E] : [Python solution](https://codeforces.me/contest/1187/submission, (2100 rating) [problem:852E] : [Python solution](https://codeforces.me/contest/852/submission

Full text and comments »

  • Vote: I like it
  • +489
  • Vote: I do not like it

38.
Codeforces Round #813 (Div. 2)
By Vladithur, history, 4 years ago, In English
Codeforces Round #813 (Div. 2) #####Привет, Codeforces! Мы с [user:Igorfardoc,2022-08-07] рады представить вам наш [contest:1712], который пройдет в [contest_time:1712]. **Этот раунд будет рейтинговым для участников, чей рейтинг ниже, чем 2100.** Мы хотим выразить благодарность: - [user:DishonoredRighteous,2022-08-07] за координацию раунда. - [user:Um_nik,2022-08-11], [user:Ormlis,2022-08-07], [user:errorgorn,2022-08-07], [user:FairyWinx,2022-08-07], [user:golikovnik,2022-08-07], [user:74TrAkToR,2022-08-07], [user:thenymphsofdelphi,2022-08-08], [user:lox123,2022-08-07], [user:Kon567889,2022-08-07], [user:AlperenT,2022-08-07], [user:Alexdat2000,2022-08-07], [user:MagentaCobra,2022-08-07], [user:welleyth,2022-08-07], [user:_dlbm17,2022-08-08], [user:satyam_343,2022-08-07], [user:thanhchauns2,2022-08-07], [user:SlavicG,2022-08-07], [user:_Vanilla_,2022-08-07], [user:jampm,2022-08-07], [user:QuangBuiCP,2022-08-08], [user:LeCaToX,2022-08-08] за тестирование раунда и полезный фидбэк. - [user:MikeMirzayanov,2022...
[contest_time:1712]. **Этот раунд будет рейтинговым для участников, чей рейтинг ниже, чем2100.**, held on [contest_time:1712]. **This round will be rated for participants with rating lower than2100.**, rating lower than 2100.** We would like to thank: - [user:DishonoredRighteous,2022-08-07] for, рейтинг ниже, чем 2100.** Мы хотим выразить благодарность: - [user:DishonoredRighteous,2022-08-07

Full text and comments »

  • Vote: I like it
  • +622
  • Vote: I do not like it

39.
Codeforces Round #701 (Div. 2)
By Kaey, 6 years ago, In English
Codeforces Round #701 (Div. 2) Ciao, Codeforces! We're glad to invite you to take part in [contest:1485], which will be held on [contest_time:1485]. This round will be **rated for participants with rating lower than 2100**. You will be given **6 problems** and **2 hours** to solve them. We would like to thank - [user:MrBrionix,2021-02-08], [user:Myk_00L,2021-02-08], [user:taulant,2021-02-01] and [user:TheScrasse,2021-02-08] (a.k.a. the jungkook official fanclub) for inventing and preparing the problems. - [user:isaf27,2021-02-08] for the great coordination and the valuable help he provided at any time. - [user:antontrygubO_o,2021-02-08] for not being involved and hence not rejecting any problem. - [user:MikeMirzayanov,2021-02-08] for creating Codeforces and Polygon. Last but not least, we also want to thank the testers: [user:armyalpaca,2021-02-08], [user:dario2994,2021-02-10], [user:davi_bart,2021-02-08], [user:DeadlyCritic,2021-02-08], [user:franfill,2021-02-08], [user:HIS_GRACE,2021-02-08], [u...
[contest_time:1485]. This round will be **rated for participants with rating lower than2100**.

Full text and comments »

  • Vote: I like it
  • +674
  • Vote: I do not like it

40.
Codeforces Round #936 (Div. 2)
By yunetive29, history, 3 years ago, translation, In English
Codeforces Round #936 (Div. 2) ###**Hola, Codeforces!** Мы рады пригласить вас принять участие в [Codeforces Round 936 (Div. 2)](https://codeforces.me/contest/1946), который состоится в [contest_time:1946]. Раунд был подготовлен [user:exhausted,2024-03-18], [user:max0000561,2024-03-18], [user:azureglow,2024-03-18] и мной. Этот раунд будет **рейтинговым для участников, чей рейтинг ниже 2100**. Участники с более высоким рейтингом могут принять участие вне конкурса. Вам будет предложено **6 задач и 2 часа** на их решение. Мы надеемся, что вам они покажутся интересными. Мы хотим поблагодарить: - [user:74TrAkToR,2024-03-18] за координацию раунда. - Наших тестеров [user:A_G,2024-03-18], [user:teraqqq,2024-03-18], [user:green_gold_dog,2024-03-18], [user:meowcneil,2024-03-18], [user:Noinoiio,2024-03-18], [user:sdyakonov,2024-03-21], [user:molney,2024-03-18], [user:IzhtskiyTimofey,2024-03-18], [user:zwezdinv,2024-03-18], [user:Nickir,2024-03-18], [user:Kihihihi,2024-03-18], [user:sergeev.PRO,2024-03-18], ...
This round will be **rated for participants whose rating is below 2100**. Participants with higher, Этот раунд будет **рейтинговым для участников, чей рейтинг ниже 2100**. Участники с более высоким

Full text and comments »

  • Vote: I like it
  • +605
  • Vote: I do not like it

41.
Codeforces Round #793 (Div. 2)
By CoderAnshu, 4 years ago, In English
Codeforces Round #793 (Div. 2) Hi Codeforces! I am pleased to invite you to [Codeforces Round #793 (Div. 2)](https://codeforces.me/contest/1682 "Adhocforces Round"), which will take place on [contest_time:1682]. You will be given **6 problems** and **2 hours** to solve them. The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1 participants can participate unofficially in the round. All problems in this round were prepared by me and [user:rivalq,2022-05-19]. We have worked on this round for a long time and hope you find every problem interesting. I would like to thank: - [user:antontrygubO_o,2022-05-19] for marvellous coordination of the round. - [user:errorgorn,2022-05-19], [user:kclee2172,2022-05-19], [user:AmShZ,2022-05-19], [user:nvmdava,2022-05-19], [user:TheScrasse,2022-05-19], [user:aryanc403,2022-05-19], [user:koderkushy,2022-05-19], [user:PurpleCrayon,2022-05-19], [user:nor,2022-05-19], [user:AlperenT,2022-05-19], [user:towrist,2022-05-19], [user:...
The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1

Full text and comments »

  • Vote: I like it
  • +616
  • Vote: I do not like it

42.
Codeforces Round #726 (Div. 2)
By SlavicG, history, 5 years ago, In English
Codeforces Round #726 (Div. 2) #### Hello Codeforces! [user:ssense,2021-06-15] and I are very glad to invite you to [contest:1537] which will take place on [contest_time:1537]. The round will be **rated for participants with a rating lower than 2100**. Division 1 participants are also welcomed to take part in the competition but it will be unrated for them. The round was originally planned to be a division 3 round so the problems might be slightly easier than average Div 2. You will be given **6 problems** and **2 hours** to solve them. We would like to thank the following people: - <a class="rated-user user-red" href="/profile/1-gon" title="yo-yo master">1-gon</a> for amazing coordination of our round! - <a class="rated-user user-red" href="/profile/antontrygubO_o" title="orz Tester">antontrygubO_o</a> for testing, translating statements and providing useful ideas! - <a class="rated-user user-legendary" href="/profile/Maksim1744" title="orz Tester">Maksim1744</a>, <a class="rated-user user-re...
on [contest_time:1537]. The round will be **rated for participants with a rating lower than2100

Full text and comments »

  • Vote: I like it
  • +690
  • Vote: I do not like it

43.
Codeforces Round #774 (Div. 2)
By MateoCV, history, 5 years ago, In English
Codeforces Round #774 (Div. 2) Hola Codeforces! I am happy to invite you to [contest:1646], which will take place on [contest_time:1646]. **Notice the unusual time!** **The round will be rated for participants with rating lower than 2100.** You will have **2 hours** to solve **6 problems**. The problems were authored and prepared by me. I would like to thank the following people who made the round possible: - [user:darkkcyan,2022-02-26] for coordination and help in problem preparation. - [user:KAN,2022-02-26] for translating the statements. - [user:antontrygubO_o,2022-02-26], [user:errorgorn,2022-02-26], [user:mjhun,2022-02-26], [user:wxhtzdy,2022-02-26], [user:generic_placeholder_name,2022-02-26], [user:Supermagzzz,2022-02-26], [user:ta4p,2022-02-26], [user:fishy15,2022-02-26], [user:polarity-,2022-02-26], [user:MarcosK,2022-02-26], [user:TeaTime,2022-02-26], [user:Stepavly,2022-02-26], [user:SebaMarin,2022-02-26], [user:CarusoX,2022-02-26], [user:dbsic211,2022-02-26], [user:ak2006,2022-02-26], [user:De...
lower than 2100.** You will have **2 hours** to solve **6 problems**. The problems were authored and, the unusual time!** **The round will be rated for participants with rating lower than2100.** You

Full text and comments »

  • Vote: I like it
  • +643
  • Vote: I do not like it

44.
Codeforces Round 1060 (Div. 2)
By Intellegent, 13 months ago, In English
Codeforces Round 1060 (Div. 2) <center> <img src="https://i.imgur.com/Brilqkh.png" style="width: 125.0px;max-width: 100.0%;max-height: 100.0%;"></center> <center> <h1> Hi Codeforces! </h1> </center> I am very excited to invite you to participate in [contest:2154], starting at [contest_time:2154]. There will be **6** wowee problems for you to solve in **2 hours**, some problems will have multiple parts. All problems were authored and prepared by me. This round will be **rated for all participants with rating below 2100**. I would like to thank the following list of very strong individuals for making this round possible: - [user:satyam343,2025-10-16] for epic coordination. - [user:um_nik,2025-10-16] for preliminary review. - The army of testers: [user:Dominater069,2025-10-16], [user:sammyuri,2025-10-16], [user:__baozii__,2025-10-16], [user:Andreasyan,2025-10-16], [user:potatoo,2025-10-16], [user:_istil,2025-10-16], [user:nifeshe,2025-10-16], [user:anango,2025-10-16], [user:cry,2025-10-16], [...
participants with rating below 2100**.

Full text and comments »

  • Vote: I like it
  • +553
  • Vote: I do not like it

45.
Codeforces Round #772 (Div. 2)
By abc864197532, history, 5 years ago, In English
Codeforces Round #772 (Div. 2) Hello, Codeforces! [user:dannyboy20031204,2022-02-18] and I are glad to invite everyone to participate in [contest:1635], which will be held on [contest_time:1635]. **This Round will be rated for participants with rating lower than 2100.** You will have **2 hours** to solve **6 problems**. We would like to thank: - [user:74TrAkToR,2022-02-18] for excellent coordination of the round and translating the statements. - [user:mhq,2022-02-18], [user:generic_placeholder_name,2022-02-18], [user:null_awe,2022-02-18], [user:ptd,2022-02-18], [user:Fysty,2022-02-18], [user:8e7,2022-02-18], [user:yungyao,2022-02-18], [user:Devil,2022-02-18], [user:amano_hina,2022-02-18], [user:Dragonado,2022-02-18], [user:DIvanCode,2022-02-18], [user:voventa,2022-02-18], [user:lox123,2022-02-18], [user:Marslai24,2022-02-18], [user:FHVirus,2022-02-18], [user:saarang,2022-02-18], [user:Olly_Z,2022-02-18], [user:arseny.__.,2022-02-18], [user:Prokhor08,2022-02-18], [user:sam571128,2022-02-18], [user:efimovpau...
participants with rating lower than 2100.** You will have **2 hours** to solve **6 problems**. We, rating lower than 2100.** You will have **2 hours** to solve **6 problems**.

Full text and comments »

  • Vote: I like it
  • +650
  • Vote: I do not like it

46.
Codeforces Round #508 (Div. 2)
By Ashishgup, history, 8 years ago, In English
Codeforces Round #508 (Div. 2) Hi everyone! It has been almost 2 years since I joined Codeforces, and it has been a great journey as a contestant. I now try to take a shot at problem-setting with my friend [user:Mahir83,2018-09-05]. With that said, I bring to your attention my new [contest:1038] that will take place on [contest_time:1038]. If your rating is less than 2100, this round will be rated for you; otherwise, you can participate out of competition. I would like to thank [user:Mahir83,2018-09-05] for his help with preparing problems, [user:_kun_,2018-09-05] & [user:300iq,2018-09-05] for coordinating my round and [user:Um_nik,2018-09-05], [user:senek_k,2018-09-05], [user:gritukan,2018-09-05], [user:Vovuh,2018-09-05] & [user:BledDest,2018-09-05] for testing my problems. I would also like to thank [user:MikeMirzayanov,2018-09-05] for Codeforces and Polygon platforms. You will be given 6 problems and 2 hours to solve them. Scoring distribution will be announced later. Good luck! **UPD:** Scorin...
[contest_time:1038]. If your rating is less than 2100, this round will be rated for you; otherwise

Full text and comments »

  • Vote: I like it
  • +784
  • Vote: I do not like it

47.
Codeforces Round 1005 (Div. 2)
By Intellegent, history, 21 month(s) ago, In English
Codeforces Round 1005 (Div. 2) <center> <img src="https://i.imgur.com/McpYICK.png" style="width: 125.0px;max-width: 100.0%;max-height: 100.0%;"></center> <center> <h1> Hello Codeforces! </h1> </center> I am very excited to offer you to participate in [contest:2064], starting at [contest_time:2064]. There will be **6** very epic tasks and you will have **2 hours** to solve them. All problems were authored and prepared by me. This round will be **rated for all participants with rating below 2100**. I would like to thank the following list of orzosities for making this round possible: - [user:flamestorm,2025-02-13] for coordinating and helping with problem preparation. - My army of testers: [user:N_z__,2025-02-13], [user:triple__a,2025-02-13], [user:sammyuri,2025-02-13], [user:_istil,2025-02-13], [user:Dominater069,2025-02-13], [user:nifeshe,2025-02-13], [user:awesomeguy856,2025-02-13], [user:Error_Yuan,2025-02-13], [user:anango,2025-02-13], [user:temporary1,2025-02-13], [user:efishel,2025-02-13], [u...
authored and prepared by me. This round will be **rated for all participants with rating below2100**.

Full text and comments »

  • Vote: I like it
  • +551
  • Vote: I do not like it

48.
Codeforces Round #779 (Div. 2)
By DeMen100ns, 5 years ago, In English
Codeforces Round #779 (Div. 2) Xin chào, Codeforces! (Hello, Codeforces!) ٩ (◕‿◕｡) ۶ Me, [user:_FireGhost_,2022-03-25] and [user:Spyofgame,2022-03-25] are glad to invite you to [contest:1658], which will take place on [contest_time:1658]. **The round will be rated for participants with rating lower than 2100.** You will have **2 hours** to solve **6 problems, one of which is divided into two subtasks**. In this contest, you will meet _Kitagawa Marin_ and her friends _Gojou_, _Juju_ and _Shinju_ from _My Dress-up Darling_! We hope you will find our problems interesting. Good luck to you all! (ﾉ ◕ ヮ ◕) ﾉ *: ･ ﾟ ✧ <img src="https://i.imgur.com/AFmfwXg.png" align="right" /> We sincerely thank the following people for their contributions in the round: - [user:errorgorn,2022-03-25] for <strike>rejecting 20 problems from <span style="color: #0000FF"><b>SPyofgame</b></span></strike> coordinating the round and [user:KAN,2022-03-25] who guided him in his first coordination. - [user:Spyofgame,2022-03-25] and ...
with rating lower than 2100.** You will have **2 hours** to solve **6 problems, one of which is

Full text and comments »

  • Vote: I like it
  • +606
  • Vote: I do not like it

49.
Codeforces Round #963 (Div.2)
By thanhchauns2, 2 years ago, In English
Codeforces Round #963 (Div.2) ### Hello Codeforces! $\newline$ <spoiler summary="Do you know that eating cheese can make you code faster than the running speed of a Tyrannosaurus REX?"> Because the Tyrannosaurus REXs are dea- </spoiler> It's been a while, today [user:GlowCheese,2024-07-29] and I are delighted to invite you to participate in [contest:1993]. This round will be **rated** for all participants with a rating lower than **2100**. Our round will start on [contest_time:1993]. You will be given **6 problems** and **120 minutes** to solve them. This contest is brought to you by <a href="https://www.facebook.com/code.mely">Code Mely</a>, a Vietnamese community for Computer Science. Reach out to us <a href="https://www.codemely.dev/">here</a>. <img align="right" src="https://media.discordapp.net/attachments/936552439698567218/1268925594863800461/image.png?ex=66ae328d&is=66ace10d&hm=8dc25beb3a109212996005831d580aac19a11609a1e27ac6b7eb1b4b672bce4b&=&format=webp&quality=lossless&width=1037&hei...
**2100**.

Full text and comments »

  • Vote: I like it
  • +522
  • Vote: I do not like it

50.
Codeforces Round #788 (Div. 2)
By Ahmed_Hosssam, 5 years ago, In English
Codeforces Round #788 (Div. 2) <spoiler summary="عيد سعيد(Happy Eid), Codeforces!"> <img src="https://i.imgur.com/frdxaAH.png" /> </spoiler> I'm glad to invite you to [contest:1670], which will be held on [contest_time:1670]. This round is rated for the participants with rating lower than 2100. You will be given **6 problems** and **2 hours** to solve them. All problems were prepared by me, [user:Hemose,2022-05-04] and [user:ZerooCool,2022-05-04]. I would like to thank: - [user:Monogon,2022-05-04], for a lot of things (awesome coordination, helping in preparation, rejecting only not interesting tasks and a lot of useful discussions). - [user:I_Love_Slim,2022-05-04] for teaching us <s>BLABIZO</s> useful concepts. - Our army of testers [user:YahiaSherif,2022-05-04], [user:DeadlyPillow,2022-05-04], [user:TheScrasse,2022-05-04], [user:Bakry,2022-05-04], [user:IsaacMoris,2022-05-04], [user:TeaTime,2022-05-04], [user:magnus.hegdahl,2022-05-04], [user:generic_placeholder_name,2022-05-04], [user:...
This round is rated for the participants with rating lower than 2100.

Full text and comments »

  • Vote: I like it
  • +565
  • Vote: I do not like it

51.
Codeforces Round 982 (Div. 2)
By myst-6, history, 2 years ago, In English
Codeforces Round 982 (Div. 2) Hello Codeforces! Me and [user:yud08,2024-10-20] are excited to invite you to take part in [contest:2027], which starts on [contest_time:2027]. You will be given **5 problems** and **2 hours** to solve them. Two problems are divided into two subtasks. This round will be rated for all participants whose rating is **strictly below 2100**. The problems were authored by me and [user:yud08,2024-10-20], and prepared by me. We would like to thank: - [user:abc864197532,2024-10-20] and [user:vladithur,2024-10-20] for an amazing double coordination. - [user:Alexdat2000,2024-10-20] for translating the statements to Russian. - [user:BurnedChicken,2024-10-20] for LGM testing. - [user:BucketPotato,2024-10-20], [user:Fysty,2024-10-20], [user:alvingogo,2024-10-20], and [user:WiwiHo,2024-10-20] for red testing. - [user:sammyuri,2024-10-20], [user:anango,2024-10-20], [user:jay_jayjay,2024-10-20], [user:amsraman,2024-10-20], [user:Intellegent,2024-10-20], [user:valeriu,2024-10-20], [user:...
This round will be rated for all participants whose rating is **strictly below 2100**.

Full text and comments »

  • Vote: I like it
  • +492
  • Vote: I do not like it

52.
Codeforces Round #620 (Div. 2)
By djm03178, history, 7 years ago, In English
Codeforces Round #620 (Div. 2) **안녕하세요, 코드포스!** (Hello, Codeforces!) I'm glad to invite you to [contest:1304]. The contest will start at [contest_time:1304], and it is **rated** for all participants with ratings under 2100. You will be given **6 problems** and one of the problems has 2 subtasks. The contest duration is **2 hours**. The score distribution will be announced later. All problems are prepared by me, with huge help from the testers with developing great solutions. I'll be on the [community Discord server](https://codeforces.me/blog/entry/52778) after the contest to share my thoughts and get feedback about the problems. Thanks to [user:79brue,2020-02-13], [user:molamola.,2020-02-13], [user:FlowerOfSorrow,2020-02-13], [user:evenharder,2020-02-13], [user:cs71107,2020-02-13], [user:Justice_Hui,2020-02-13], [user:rkm0959,2020-02-13], [user:chpark1111,2020-02-13], [user:imeimi,2020-02-13], [user:alswhp,2020-02-13], [user:gaelim,2020-02-13], [user:jh05013,2020-02-13] ([Good tester](https://codefo...
**rated** for all participants with ratings under 2100.

Full text and comments »

  • Vote: I like it
  • +530
  • Vote: I do not like it

53.
Codeforces Round 968 (Div. 2)
By zltzlt, history, 2 years ago, In English
Codeforces Round 968 (Div. 2) (After 3 months) Hello again, Codeforces! We are glad to invite you to participate in [contest: 2003], which will start on [contest_time: 2003]. You will be given **6 problems** and **2 hours** to solve them. Two problems are divided into two subtasks. This round will be **rated** for participants whose rating is **below 2100**. Participants with higher rating can participate unofficially. The problems were authored and prepared by me. I would like to thank: - [user: 244mhq, 2024-8-23] for perfect coordination. - [user: A_G, 2024-8-23], [user: wutongchun, 2024-8-23], [user: yeminghan, 2024-8-23] for red testing. - [user: DisconnectedGraph, 2024-8-23], [user: small_peter, 2024-8-23], [user: JWRuixi, 2024-8-23] for orange testing. - [user: yinhee, 2024-8-23], [user: QwQwf, 2024-8-23], [user: Jryno1, 2024-8-23], [user:sinsop90,2024-08-23] for purple testing. - [user: dieselhuang, 2024-8-23], [user: WRuperD, 2024-8-23], [user: CSQ31, 2024-8-23], [user: gdf_yhm, 2024-8-23...
This round will be **rated** for participants whose rating is **below 2100**. Participants with

Full text and comments »

  • Vote: I like it
  • +449
  • Vote: I do not like it

54.
Train Better with ThemeCPs (+ Website)!
By pwned, 23 months ago, In English
Train Better with ThemeCPs (+ Website)! Hello Codeforces! I am excited to share with you my competitive programming innovation which successfully propelled me to master (2100+)! This is the **<span style="color:black;">Theme</span><span style="color:red;">CP</span>** training method, which stands for **Themed <span style="color:red;">C</span>odeforces <span style="color:red;">P</span>rogressions**. Use at your discretion -- your Codeforces practice may get too effective and addictive! ![ ](/predownloaded/b5/33/b533201227bd15e23e4d344e38cf7f454e27e08a.png) **Want to read this blog in document form (with images)? Check out the following Google Doc!** https://tinyurl.com/themecp #### What is **<span style="color:black;">Theme</span><span style="color:red;">CP</span>**? **<span style="color:black;">Theme</span><span style="color:red;">CP</span>** is an experimental training system wherein users train on a perpetual ladder for ratings in **[<span style="color:gray;">900</span>, <span style="color:black;">3</span><...
me to master (2100+)! This is the **Theme, tag. For example, a level 49 mock would be 1700/1900/2100/2300. 3. **Begin your ThemeCP!** The

Full text and comments »

  • Vote: I like it
  • +582
  • Vote: I do not like it

55.
Educational Codeforces Round 90 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 90 [Rated for Div. 2] Hello Codeforces! On [contest_time:1373] [contest:1373] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-06-24] Glazov, Adilbek [user:adedalic,2020-06-24] Dalabaev, Vladimir [user:vovuh,2020-06-24] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +550
  • Vote: I do not like it

56.
Codeforces Round #842 (Div.2)
By thanhchauns2, history, 4 years ago, In English
Codeforces Round #842 (Div.2) Hi Codeforces! ================== [user:Igorfardoc,2020-01-05], [user:Vladithur,2020-02-09], [user:alexdat2000,2019-08-18], [user:gluchie,2021-03-10], [user:DeMen100ns,2020-09-19], [user:Spyofgame,2021-10-03] and me (spelling "thanh-chau-n-s-2") are delighted to invite you to participate in [Codeforces Round #842 (Div. 2)](https://codeforces.me/contests/1768). **This round will be rated for all participants with a rating lower than 2100.** - Start time: [contest_time:1768] - Duration: **120 minutes**. - Number of tasks: **6**. <img align="right" src="https://media.discordapp.net/attachments/961567157622276126/1056248841348841594/received_3472327789705304.webp?width=541&height=676" width="30%" height="40%"> <spoiler summary="This contest is brought to you by"> - <a href = "https://www.facebook.com/HocvienPTIT">PTIT</a>, my university. - <a href = "https://discord.gg/codemely">Code Mely</a>, a Vietnamese fanpage for Computer Science. </spoiler> Special thanks to: ...
than 2100.**

Full text and comments »

  • Vote: I like it
  • +593
  • Vote: I do not like it

57.
Codeforces Round #708
By shishyando, history, 6 years ago, translation, In English
Codeforces Round #708 И снова привет, Codeforces! Мы с [user:Artyom123,2021-03-14] рады пригласить вас на [contest:1497], который состоится в [contest_time:1497]. **Раунд будет рейтинговым для всех участников, чей рейтинг ниже 2100.** Вот очень крутые люди, которых мы хотим поблагодарить: - [user:isaf27,2021-03-14] за координацию раунда и идеи по его улучшению - [user:physics0523,2021-03-14], [user:Kotehok3,2021-03-14], [user:Ziware,2021-03-14], [user:Kirill22,2021-03-14], [user:Absyarka,2021-03-14], [user:AliShahali1382,2021-03-14], [user:not_tehlka,2021-03-14], [user:Mohammad_Yasser,2021-03-14], [user:FairyWinx,2021-03-14], [user:kassutta,2021-03-14], [user:LazyPrime,2021-03-14], [user:rkm62,2021-03-14] за тестирование раунда и фидбек - [user:MikeMirzayanov,2021-03-14] за всеми любимые платформы Codeforces и Polygon. У вас будет **2 часа** на решение **5 задач (и 2 подзадач)**. В этот раз условия не связаны с вселенной Valorant, хотя мы до сих пор иногда в него заходим. Мы надеемся, что в...
[contest_time:1497]. **Раунд будет рейтинговым для всех участников, чей рейтинг ниже2100.**, on [contest_time:1497]. **This round will be rated for the participants with rating lower than2100**, with rating lower than 2100** These are some awesome people that we would like to thank, рейтинг ниже 2100.** Вот очень крутые люди, которых мы хотим поблагодарить: - [user:isaf27,2021-03

Full text and comments »

  • Vote: I like it
  • +781
  • Vote: I do not like it

58.
Codeforces Round 1023 (Div. 2)
By sunkuangzheng, 18 months ago, In English
Codeforces Round 1023 (Div. 2) Hello, Codeforces! [user:auiunu,2025-04-30], [user:nahc0el,2025-04-30] and me are glad to invite you to the last round with 10 binary bits &mdash; [contest:2107], which will start on [contest_time:2107]. You will be given 6 problems and 1 subtask with 2 hours 15 minutes to solve them. The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1 participants can participate unofficially. All problems are authored by [user:auiunu,2025-04-30], [user:nahc0el,2025-04-30] and me. We would like to thank: - [user:Dominater069,2025-04-30] and [user:TheScrasse,2025-04-30] for their wonderful coordination and huge help in preparing the round. - [user:Alexdat2000,2025-05-02] for the Russian translations. - [user:hyman00,2025-04-30], [user:le0n,2025-04-30], [user:Flamire,2025-04-30], [user:jeroenodb,2025-04-30] for LGM testing. - [user:Sana,2025-04-30], [user:N_z__,2025-04-30], [user:Wuyanru,2025-04-30], [user:Halzion,2025-04-30], [user:platter,...
The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1

Full text and comments »

  • Vote: I like it
  • +478
  • Vote: I do not like it

59.
Codeforces Round 1049 (Div. 2)
By shorya1835, history, 14 months ago, In English
Codeforces Round 1049 (Div. 2) Hello, Codeforces! We are glad to invite you to participate in [Codeforces Round 1049 (Div. 2)](https://codeforces.me/contest/2140) on [contest_time:2140]. You will have $2$ hours to solve $6$ problems and some problems will be divided into subtasks. The round will be rated for participants whose rating is below **2100**, but higher rated users are also welcome to participate out of competition. The problems were authored and prepared by [user:shorya1835,2025-09-08], [user:divine_spark,2025-09-08] and [user:wakanda-forever,2025-09-08]. We would like to thank: - [user:Sugar_fan,2025-09-08] for his great coordination. - [user:Alexdat2000,2025-09-08] for Russian translation. - [user:doofushmirtz,2025-09-08], [user:Dragokj03,2025-09-08], [user:Shubham_KV,2025-09-08] and [user:ho-oh,2025-09-08], for proposing problems that later weren’t included in the final set. - Our list of testers for providing valuable feedback: [user:fallleaves01,2025-09-08], [user:_istil,2025-09-08...
round will be rated for participants whose rating is below **2100**, but higher rated users are also

Full text and comments »

  • Vote: I like it
  • +518
  • Vote: I do not like it

60.
Codeforces Round #766 (Div. 2)
By manish.17, 5 years ago, In English
Codeforces Round #766 (Div. 2) omg hi Codeforces! [user:ScarletS,2022-01-12], [user:flamestorm,2022-01-12], [user:fishy15,2022-01-13], [user:saarang,2022-01-12], <a class="rated-user user-orange" href="/profile/lookcook" title="Did no work and cried for name to be here">lookcook</a> and I are glad to invite you to our Codeforces round, [contest:1627], which will be held on [contest_time:1627]. **This round will be rated for participants with rating lower than 2100**. We would like to thank: - [user:Monogon,2022-01-12] senpai for excellent coordination of the contest. - [user:MikeMirzayanov,2022-01-12], for creating the amazing Codeforces and Polygon platforms! - [user:KAN,2022-01-15], for Russian translations! - [user:dorijanlendvaj,2022-01-12], [user:errorgorn,2022-01-12], [user:PurpleCrayon,2022-01-12], [user:generic_placeholder_name,2022-01-12], [user:blue,2022-01-12], [user:polarity-,2022-01-12], [user:atharv,2022-01-12], [user:epicxtroll,2022-01-12], [user:dbsic211,2022-01-12], [user:StArChAn...
rating lower than 2100**.

Full text and comments »

  • Vote: I like it
  • +666
  • Vote: I do not like it

61.
Educational Codeforces Round 91 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 91 [Rated for Div. 2] Hello Codeforces! On [contest_time:1380] [contest:1380] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-07-11] Glazov, Adilbek [user:adedalic,2020-07-11] Dalabaev, Vladimir [user:vovuh,2020-07-11] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +515
  • Vote: I do not like it

62.
Mentor the next generation of IOI medalists
By geniucos, history, 7 years ago, In English
Mentor the next generation of IOI medalists Hi friends! My name is Costin-Andrei Oncescu. I began preparation for the IOI in 2011, lasting for 8 years and culminating in one silver and two bronze medals. I began the journey being the first one in my region and not having access to much formalized training. Now in college, I reflect on my experience and come to realize how fortunate I am for all of the great lessons IOI taught me. I now seek to pay it forward by bringing this experience to others that dare to be the first in their town, state, or country. In collaboration with other IOI medalists ([user:Reyna,2019-12-23], [user:reedef,2019-12-23], [user:zscoder,2019-12-23], [user:Adhami,2019-12-23], [user:Rezwan.Arefin01,2019-12-23], [user:Bruteforceman,2019-12-23], [user:rajarshi_basu,2019-12-23], [user:Adhyyan1252,2019-12-26]), teachers, community organizers, and government officials, we are starting a project, CSPrep.org. This initiative is directed to ignite the first generation of IOI medalists in emerging countries b...
a rating of over 2100 on CodeForces.

Full text and comments »

  • Vote: I like it
  • +370
  • Vote: I do not like it

63.
Educational Codeforces Round 100 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 100 [Rated for Div. 2] Hello Codeforces! On [contest_time:1463] [contest:1463] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-12-16] Glazov, Adilbek [user:adedalic,2020-12-16] Dalabaev, Vladimir [user:vovuh,2020-12-16] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +422
  • Vote: I do not like it

64.
My winning theory in IOI 2018 & 2019 — Why I won 2 golds in IOI
By E869120, 7 years ago, In English
My winning theory in IOI 2018 & 2019 — Why I won 2 golds in IOI Dear Codeforces community.<br /> According to [IOI 2019 Results](http://stats.ioinformatics.org/results/2019), I got the 25th place and got successful gold medals twice in a row.<br /> Although it was pretty close to the gold-medal border (only 6.14pts / 600 difference) and it was lower performance than IOI 2018, which I participated when I was orange in Codeforces, I had many chances to get more points in this IOI, even for top 10. Since there are not so many people who have got two gold medals in IOI (and there were many requests like "I want [user:E869120,2019-08-14] to talk about how to get gold in IOI" like [this comment](https://codeforces.me/blog/entry/66909?#comment-510127) and [this comment](https://codeforces.me/blog/entry/66909?#comment-513129)). I want to write something about IOI, which may be useful for people who will participate in IOI next year and also some years later.<br /> ![ ](https://i.ibb.co/TLmqRRX/E869120-IOI-01.png)<br /> <br /> ### A. First of all At...
is this: * 110 people: Same as Codeforces difficulty 2100. If you are purple, you

Full text and comments »

  • Vote: I like it
  • +608
  • Vote: I do not like it

65.
Codeforces Round #741 (Div. 2)
By Wind_Eagle, 5 years ago, In English
Codeforces Round #741 (Div. 2) <p align="right"><small>Choose the way, five paths there for you to find<br>Turn the page, the question lies between the lines... <p align="left"> Привет, Codeforces! Я надеялся, что однажды у меня будет второй раунд, и вот, наконец, надежды оправдались! Я очень рад пригласить вас на [Codeforces Round #741 (Div. 2)](https://codeforces.me/contest/1562), который пройдет в [contest_time:1562]. <b>Этот раунд будет рейтинговым для участников, чей рейтинг ниже, чем 100000110100 (то есть 2100).</b> Моя искренняя благодарность: - [user:antontrygubO_o,2021-08-24] <s>за отклонение задач А</s> за выдающуюся координацию раунда! Благодарю! - [user:gepardo,2021-08-24] сделал много чего полезного. Без него этого раунда бы не было. Благодарю! - [user:EIK,2021-08-24] это тот человек, без которого я бы вообще не попал в спортивное программирование — мой учитель информатики. Благодарю! - [user:MikeMirzayanov,2021-08-24] за платформы Codeforces и Polygon. Благодарю! - Вы, за то,...
participants with rating lower than 100000110100 (2100)., ниже, чем 100000110100 (то есть 2100).

Full text and comments »

  • Vote: I like it
  • +520
  • Vote: I do not like it

66.
Educational Codeforces Round 89 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 89 [Rated for Div. 2] Hello Codeforces! On [contest_time:1366] [contest:1366] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-06-10] Glazov, Adilbek [user:adedalic,2020-06-10] Dalabaev, Vladimir [user:vovuh,2020-06-10] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +510
  • Vote: I do not like it

67.
CodeCraft-21 and Codeforces Round #711 (Div. 2)
By sigma_g, history, 6 years ago, In English
CodeCraft-21 and Codeforces Round #711 (Div. 2) Hello all! We are proud to invite you to **CodeCraft-21**, which takes place on [contest_time:1498]. It is rated for all Div2 participants (rating under 2100). This contest comes under **Threads'21**, as a part of our annual techno-cultural fest [Felicity, IIIT Hyderabad](https://felicity.iiit.ac.in). We have **special prizes for Indian participants**! <img src="/predownloaded/8e/0a/8e0a76faf6acc96ba6ffb9b873136259066b5211.png" width="450px"> You will be given **six problems** to solve in a duration of **two hours**. We have tried our best to keep clean statements, useful samples with good explanations, and strong pretests! We have written step-wise editorials, and will also release video editorials! We would like to thank these amazing people for helping make the contest happen: - [user:bleddest,2021-03-27] for great coordination of our round - [user:ninja_28,2021-03-27], [user:dixitgarg,2021-03-27], [user:ltc.groverkss,2021-03-27] and myself for amazing problem...
rated for all Div2 participants (rating under 2100).

Full text and comments »

  • Vote: I like it
  • +535
  • Vote: I do not like it

68.
Codeforces Round #724 (Rated for Div 2)
By malachi_toney_goat, 5 years ago, In English
Codeforces Round #724 (Rated for Div 2) Hello Codeforces! We, the disciples of Omkar ([user:qlf9,2021-06-04], [user:tlatoani,2021-06-04], [user:hu_tao,2021-06-04], [user:golions,2021-06-04], and Omkar's newest disciple, [user:rabaiBomkarBittalBang,2021-06-04]), have written our third contest: [contest:1536] &mdash; [Omkar 3](https://www.youtube.com/watch?v=MI-pw4DdHEw). It will be held on [contest_time:1536] and will be rated for users in Division 2 (rating lower than 2100). As usual participants with rating >= 2100 are allowed to compete too, but the contest will be unrated for them. You will be given **2 hours** to solve **6 problems**. There may or may not be an interactive problem, so it would behoove you to read the [guide for interactive problems](https://codeforces.me/blog/entry/45307). There also may or may not be competitive programming problems, so you should be sure to thoroughly understand everything [here](https://codeforces.me/blog/entry/91363). We would like to thank: - [user:antontrygubO_o,2021-...
(rating lower than 2100). As usual participants with rating >= 2100 are allowed to compete too, but the, users in Division 2 (rating lower than 2100). As usual participants with rating >=2100 are allowed to

Full text and comments »

  • Vote: I like it
  • +537
  • Vote: I do not like it

69.
Codeforces Round 955 (Div. 2, призы от NEAR!)
By FelixArg, history, 2 years ago, translation, In English
Codeforces Round 955 (Div. 2, призы от NEAR!) Привет, Codeforces! Это был долгий путь, и я, наконец, рад пригласить вас поучаствовать в нашем [contest:1982], который пройдет в [contest_time:1982]. Он будет <b>рейтинговым</b> для всех участников, чей рейтинг будет <b>ниже 2100</b>. Участники с более высоким рейтингом могут принять участие вне конкурса. На раунде вам нужно будет решить <b>6 задач</b>. У вас будет <b>2 часа</b> на их решение. Задачи для раунда вместе со мной готовили [user:nik1998,2024-06-21], [user:egor4444ik,2024-06-21] и [user:iamdimonis,2024-06-21]. Мы от всей души хотим поблагодарить всех, кто оказал бесценную помощь в подготовке этого раунда: <ul style="list-style-type:square"> <li>Нашего проницательного координатора [user:74TrAkToR,2024-06-21] за отличное общение, полезные советы и помощь в подготовке задач!</li> <li>[user:Kolychestiy,2024-06-21] за улучшение одной из задач.</li> <li>[user:EJIC_B_KEDAX,2024-06-21], [user:A_G,2024-06-21], [user:zwezdinv,2024-06-21], [user:Dominater069,202...
This round will be rated for all participants with a rating is below 2100, Он будет рейтинговым для всех участников, чей рейтинг будет ниже 2100. Участники с

Full text and comments »

  • Vote: I like it
  • +434
  • Vote: I do not like it

70.
Codeforces Round #905 (Div. 1, Div. 2, Div. 3)
By 74TrAkToR, history, 3 years ago, translation, In English
Codeforces Round #905 (Div. 1, Div. 2, Div. 3) Привет, Codeforces! Мы рады пригласить вас на наш экспериментальный раунд для трёх дивизионов, который пройдет в [contest_time:1887]. <b> Обратите внимание на нестандартное время начала раунда </b>. В каждом дивизионе будет предложено по 5-7 задач. Раунд будет проведён по правилам Codeforces, будет рейтинговым для всех трёх дивизионов. Немного изменений относительно рейтинга участников в этом соревновании: <ul style="list-style-type:square"> <li>В Div.3 рейтинг участников меньше 1600. </li> <li>В Div.2 рейтинг участников от 1600 до 2099. </li> <li>В Div.1 рейтинг участников не меньше 2100. </li> <li><b>Обратите внимание</b>, что после [contest:1884] рейтинг не будет пересчитан до окончания этого соревнования. </li> </ul> Отметим, что параллельно в этот день будет проходить две командные олимпиады, по задачам которых и составлены раунды: <ul style="list-style-type:square"> <li> XXI Московская командная олимпиада &mdash; командное соревнование для школьников, прох...
, participants range from 1600 to 2099. * In Div.1 the rating of participants is no less than 2100, . * В Div.1 рейтинг участников не меньше 2100. * Обратите внимание, что после

Full text and comments »

  • Vote: I like it
  • +506
  • Vote: I do not like it

71.
Codeforces Round 1102 (Div. 2)
By yanb0, history, 5 months ago, In English
Codeforces Round 1102 (Div. 2) ### Привет, Codeforces! **<img src="/predownloaded/b0/66/b066dfc4251e049870960cf833a9d958c62398de.jpg" style="width: 200.0px;float: right;margin: 0 1.0em 1.0em 1.0em;max-width: 100.0%;max-height: 100.0%;">** Мы очень рады объявить, что [contest:2234] пройдет в [contest_time:2234]. Раунд будет рейтинговым для всех участников с рейтингом, строго меньшим $2100$. У вас будет $2$ часа и $15$ минут, чтобы решить $6$ задач, включая одну, разделённую на две подзадачи (не обязательно идущие подряд). Все задачи придуманы и подготовлены [user:Fakewave,2026-06-02], [user:FairyWinx,2026-06-02] и мной. Мы хотим выразить специальную благодарность этим замечательным людям: - [user:FairyWinx,2026-06-02] за крутую координацию раунда; - [user:300iq,2026-05-18], [user:k1r1t0,2026-05-19], [user:_istil,2026-05-20], [user:Wansur,2026-05-21] и [user:__baozii__,2026-05-27] за красное тестирование. - [user:_Crimson_,2026-05-27], [user:Ansori,2026-06-01] и [user:Arpa,2026-06-05] за оранжевое тес...
для всех участников с рейтингом, строго меньшим $2100$. У вас будет $2$ часа и $15$ минут, чтобы, ]. This round will be rated for all participants with rating below $2100$. You will be given $2$ hours and

Full text and comments »

  • Vote: I like it
  • +518
  • Vote: I do not like it

72.
Codeforces Round 949 (Div. 2)
By zltzlt, history, 2 years ago, In English
Codeforces Round 949 (Div. 2) Hello, Codeforces! We are glad to invite you to participate in [contest: 1981], which will start on [contest_time: 1981]. **Note the unusual start time of the round**. You will be given **6 problems** and **2 hours** to solve them. This round will be **rated** for participants whose rating is **below 2100**. Participants with higher rating can participate unofficially. The problems were authored and prepared by [user: sinsop90, 2024-5-29], [user: yinhee, 2024-5-29] and me. I would like to thank: - [user: 244mhq, 2024-5-29] for his wonderful coordination. - [user: sinsop90, 2024-5-29] and [user: yinhee, 2024-5-29] for providing problem ideas and discussing the problems with me. - [user: AFewSuns, 2024-5-29] and [user: crazy_sea, 2024-5-29] for providing a better solution to one of the problems. - [user: Um_nik, 2024-5-29] for the only LGM testing. - [user: A_G, 2024-5-29], [user: antontrygubO_o, 2024-5-29], [user: StarSilk, 2024-5-29], [user: CharlieV, 2024-5-29], [us...
This round will be **rated** for participants whose rating is **below 2100**. Participants with

Full text and comments »

  • Vote: I like it
  • +370
  • Vote: I do not like it

73.
Зимний интенсив от Умника
By Um_nik, history, 6 years ago, In Russian
Зимний интенсив от Умника Всем привет. Я продолжаю свои попытки в онлайн обучение спортивному программированию (предыдущие итерации: [раз](https://codeforces.me/blog/entry/78785) [два](https://codeforces.me/blog/entry/81129)). Ученики говорят, что им очень нравится, почему бы и вам не приобщиться к прекрасному? ## Что я предлагаю - 5 личных контестов на 4-5 часов, в каждом контесте около 16 задач. - Все задачи со старых раундов Codeforces, но подбираю я их с любовью и прицелом на то, что я смогу интересного сказать на разборе по этому поводу. Задачи сложные. - Соответственно, платформа для проведения (с задачной точки зрения) — закрытая группа на Codeforces. Thanks to MikeMirzayanov после прошлого моего интенсива там прокачали монитор дорешки, теперь все еще более красиво. - <font style="color:red">[New]</font> Рабочий процесс по одному контесту выглядит так: в один день вы пишите виртуалку, на следующий день я провожу разбор. Разборы у меня очень длинные, подробные, с частыми лирическими от...
конкретики - Занятия рассчитаны на фиолетовый/оранжевый. Чем ближе ваш рейтинг к2100, тем (скорее всего, - Занятия рассчитаны на фиолетовый/оранжевый. Чем ближе ваш рейтинг к 2100, тем (скорее всего) вам

Full text and comments »

  • Vote: I like it
  • +339
  • Vote: I do not like it

74.
Codeforces Round #838 (Div. 2)
By satyam343, 4 years ago, In English
Codeforces Round #838 (Div. 2) Hello, Codeforces! [user:amurto,2022-12-13] and I are glad to invite everyone to participate in [contest:1762], which will be held on [contest_time:1762]. This Round will be rated for participants with rating strictly **lower than 2100**. Participants from the first division are also welcomed to take part in the competition but it will be unrated for them. You will be given **7 problems** and **2 hours and 30 minutes** to solve them. One of the problems will be **interactive**. Make sure to read [this blog](https://codeforces.me/blog/entry/45307) and familiarize yourself with these types of problems before the round! We would like to thank: - [user:errorgorn,2022-12-13] for amazing coordination and help with the problem preparation. - [user:KAN,2022-12-13] for translation of the statements into Russian - [user:TheScrasse,2022-12-13] for providing suggestions which helped us to improve one problem. - [user:GoatTamer,2022-12-13] for discussing problems with us whil...
This Round will be rated for participants with rating strictly **lower than 2100 **. Participants

Full text and comments »

  • Vote: I like it
  • +445
  • Vote: I do not like it

75.
[Tutorial] Problems about swapping adjacent elements
By TheScrasse, history, 5 years ago, In English
[Tutorial] Problems about swapping adjacent elements Hello everyone,<br> problems about swapping adjacent elements are quite frequent in CP, but they can be tedious. In this tutorial we will see some easy ideas and use them to solve some problems of increasing difficulty. I tried to put a lot of examples to make the understanding easier.<br> The first part of the tutorial is quite basic, so feel free to skip it and jump to the problems if you already know the concepts. Target: rating $[1400, 2100]$ on CF<br> Prerequisites: greedy, Fenwick tree (or segment tree) Counting inversions ------------------ Let's start from a simple problem. _You are given a permutation $a$ of length $n$. In one move, you can swap two elements in adjacent positions. What's the minimum number of moves required to sort the array?_ #### Claim The result $k$ is equal to the number of inversions, i.e. the pairs $(i, j)$ ($1 \leq i < j \leq n$) such that $a_i > a_j$. #### Proof 1 Let $f(x)$ be the number of inversions after $x$ moves.<br> In one...
Target: rating $[1400, 2100]$ on CF Prerequisites: greedy, Fenwick tree (or segment tree)

Full text and comments »

  • Vote: I like it
  • +223
  • Vote: I do not like it

76.
Educational Codeforces Round 93 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 93 [Rated for Div. 2] Hello Codeforces! On [contest_time:1398] [contest:1398] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-08-13] Glazov, Adilbek [user:adedalic,2020-08-13] Dalabaev, Vladimir [user:vovuh,2020-08-13] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +478
  • Vote: I do not like it

77.
Petition to Restrict the Coach Mode Authority Tighter
By chenjb, history, 5 years ago, In English
Petition to Restrict the Coach Mode Authority Tighter Happy New year, Codeforces. I had this idea for about a month. I heard problem setters complaining about some people used their coach mode authority to enlarge some problems' TL in the Gym just for letting their submissions passed. What's worse, these guys even forgot to change it back, which causes some troubles for participants afterwards. Moreover, I also have similar experience. Back in 2020, I did [SWERC2019](https://codeforces.me/gym/102501/) with my friends. Then after a few days, I returned and found that my competition record disappeared from the scoreboard. Someone must press the 'to practice' or 'devirtualize' button. If you press those buttons, the website will ask you if you confirm your action (which is not reversible). Therefore, I pretty sure there is someone who just don't want to see my partipation record on the scoreboard for some reasons that I could never realize. Just in case some of you don't know (maybe hasn't discovered yet) what the coach mode can do...
achieve **Master** rating (>=2100), which is what I know about getting a coach mode authority (maybe

Full text and comments »

  • Vote: I like it
  • +462
  • Vote: I do not like it

78.
Codeforces Round #832 (Div. 2)
By rivalq, history, 4 years ago, In English
Codeforces Round #832 (Div. 2) Hi Codeforces! I am pleased to invite you to <strike> Adhocforces</strike>, <strike> Mathforces</strike> [Codeforces Round #832 (Div. 2)](https://codeforces.me/contest/1747), which will take place on [Friday, Nov 4, 2022 at 14:35 UTC](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+832&iso=20221104T1435&p1=%3A&ah=2). You will be given **5 problems** and **2 hours** to solve them. The round will be rated for participants of Division 2 with a rating lower than **2100**. Division 1 participants can participate unofficially in the round. All problems in this round were prepared by me and [user:coderanshu,2022-11-02]. I would like to thank: - [user:antontrygubO_o,2022-11-02] for coordination of the round. - [user:ffao,2022-11-02], [user:Everule,2022-11-02], [user:Andreasyan,2022-11-02], [user:koderkushy,2022-11-02], [user:nor,2022-11-02], [user:AlperenT,2022-11-02], [user:the_hyp0cr1t3,2022-11-02], [user:Runtime-Terr0r,2022-11-02], [user:sp005,...
The round will be rated for participants of Division 2 with a rating lower than **2100**. Division

Full text and comments »

  • Vote: I like it
  • +441
  • Vote: I do not like it

79.
Codeforces Round #861 (Div. 2)
By Wind_Eagle, 4 years ago, translation, In English
Codeforces Round #861 (Div. 2) <a href="https://ibb.co/hB6SF5F"><img src="https://i.ibb.co/48qHRyR/350-20230320195909.png" alt="350-20230320195909" border="0"></a> Привет, Codeforces! Я очень рад пригласить вас на [Codeforces Round #861 (Div. 2)](https://codeforces.me/contest/1808), который пройдет в [contest_time:1808]. <b>Этот раунд будет рейтинговым для участников, чей рейтинг ниже, чем 2100.</b> Моя искренняя благодарность: - [user:KAN,2023-03-26] и [user:aleks5d,2023-03-26] за выдающуюся координацию раунда! - [user:Wind_Eagle,2023-03-26], [user:BaluconisTima,2023-03-26], [user:kartel,2023-03-26], [user:gepardo,2023-03-26] и [user:244mhq,2023-03-26] за идеи задач для раунда, а также [user:BaluconisTima,2023-03-26], [user:244mhq,2023-03-26], [user:VEGAnn,2023-03-26], [user:Vladik,2023-03-26] и [user:andrew,2023-03-26] за разработку задач. - [user:vilcheuski,2023-03-26] и [user:programmer228,2023-03-26] &mdash; остальную команду авторов, без которых этот раунд бы не состоялся. - [user:Balucon...
participants with rating lower than 2100., ниже, чем 2100.

Full text and comments »

  • Vote: I like it
  • +387
  • Vote: I do not like it

80.
Codeforces Round 864 (Div. 2)
By rui_er, history, 4 years ago, In English
Codeforces Round 864 (Div. 2) Hello, Codeforces! [user:AC-Automation,2023-04-05] and I [user:rui_er,2023-04-05] are glad to invite you to participate in [contest:1797], which will be held on [contest_time:1797]. **Please note the unusual start time.** This round is rated for the participants with ratings strictly lower than **2100**. You will be given **6 problems** and **2 hours** to solve them. All the problems are prepared by [user:AC-Automation,2023-04-05] and me. We would like to thank: - [user:darkkcyan,2023-04-05] for a perfect coordination and help with the problem preparation. - [user:AC-Automation,2023-04-05] for providing some <s>rejected</s> problems and helping me a lot in preparation. - [user:zplqwq,2023-04-05] for polishing English statements and editorials. - [user:Alexdat2000,2023-04-05] for the Russian translations. - [user:N_z__,2023-04-05], [user:HQJ2007,2023-04-05], [user:2_3_3,2023-04-05], [user:ShmilyTY,2023-04-05], [user:tlsdydaud1,2023-04-05], [user:fishy15,2023-04-05], [use...
This round is rated for the participants with ratings strictly lower than **2100 **. You will be

Full text and comments »

  • Vote: I like it
  • +407
  • Vote: I do not like it

81.
I finally became IGM — please don't spend years hating yourself for failures
By plagues, history, 4 months ago, In English
I finally became IGM — please don't spend years hating yourself for failures Hello everyone! A couple of days ago I finally reached IGM, and you cannot even imagine how happy I am. I want to tell you a bit about my journey. In 8th grade I got my first prize diploma at ROI. That was a pretty cool achievement, but I always wanted to be better. I had three whole years ahead of me to become a winner, yet I never managed to do it. My competitive programming career has been full of disappointments. The only year when I truly believed in myself was 8th grade. I was top 2 at IATI Junior by a huge margin, got my first VKOSHP diploma, became a ROI prizewinner, and overall progressed very fast. For example, that was when I reached 2100 on Codeforces for the first time. As you can see, it took me another 5 years just to finally become a grandmaster. In 9th grade, my team and I got top 5 at VKOSHP. For me it was a huge tilt, because it was the first “not gold” result after I had been dreaming about gold for so long. In 10th grade I was supposed to particip...
example, that was when I reached 2100 on Codeforces for the first time. As you can see, it took me

Full text and comments »

  • Vote: I like it
  • +481
  • Vote: I do not like it

82.
Codeforces Round #1070 (Div. 2)
By _Crimson_, 11 months ago, translation, In English
Codeforces Round #1070 (Div. 2) Привет, кодефорсес ₍^. .^₎⟆ ------------------ <img src="https://i.ibb.co/9HDfGR5z/155897492717156605.jpg" style="float: right;margin: 0 5% 5%;width: 25.0%;height: 25.0%;"> Я, [user:ABalobanov,2025-12-09] и [user:Slamur,2025-12-09] рады пригласить вас поучаствовать в [contest:2176]. Он состоится в [contest_time:2176]. Раунд будет **рейтинговым** для всех участников с рейтингом строго меньшим **2100**. У вас будет **2 часа**, чтобы решить **6 задач**. Мы хотим выразить благодарность этим замечательным людям - Самому милому координатору [user:FairyWinx,2025-12-09]. - [user:KAN,2025-12-09], [user:MikeMirzayanov,2025-12-09] за платформы **Codeforces** и **Polygon**. - Нашим восхитительным тестерам: - **<span style="color: black;">К</span><span style="color: red;">расночерное</span>** тестирование: [user:Um_nik,2025-12-09]. - **<span style="color: red;">Красное</span>** тестирование: [user:A_G,2025-12-09], [user:Wansur,2025-12-09], [user:OG_Matveychick1,2025-12-09], [user:_...
all participants with rating below **2100**. You will be given **2 hours** to solve **6 problems**., рейтингом строго меньшим **2100**. У вас будет **2 часа**, чтобы решить **6 задач**.

Full text and comments »

  • Vote: I like it
  • +512
  • Vote: I do not like it

83.
Click here if you want to know your future CF rating
By stefdasca, history, 6 years ago, In English
Click here if you want to know your future CF rating Have you ever wanted to know how will your CF rating look like in the future, without having to be stressed about the potential shortcomings which may come in future contests? Have you ever wanted to be able to say that you will get the rating of your dreams soon? If the answer for both of these questions is Yes, then you came to the right place. During the last few months, I have used some technical analysis to predict how will some of the people from [my Discord server](http://discord.gg/z3PcA8aDmg) and I have gotten quite consistent results, so I think that my strat is working. I am not going to enter in details on how do I actually do this, because it requires quite some experience to learn all the details, but as people say, an image is worth 1000 words, so here are some few examples. First example is [user:ScarletS,2020-12-29] Here is how his rating looked like in November, before he had a bad contest ![ ](https://i.imgur.com/vtj6rv2.png) Here I told him t...
Sadly for him, this played out too and he fell quite a bit, down to 2100, but hopefully he will

Full text and comments »

  • Vote: I like it
  • +368
  • Vote: I do not like it

84.
Codeforces Round #538 (Div. 2)
By AkiLotus, history, 8 years ago, In English
Codeforces Round #538 (Div. 2) **TREMBLE BEFORE THE MIGHTY OMEGALULGRAPE** ![ ](https://i.imgur.com/kpS7NEq.png) Hello Codeforces! We are honored to invite you to Codeforces Round #538 (Div. 2), which will take place at [contest_time:1114]. The round will be rated for all Division 2 participants **(with rating less than 2100)**. Still, we warmly welcome Division 1 participants to join us out of competition. You will be given **6** problems to solve in **2 hours.** The round's problems were initially prepared by Duy-Bach ~Akikaze,2019-02-05 Le, Xuan-Tung ~neko_nyaa,2019-02-05 Nguyen and Xuan-Quang ~xuanquang1999,2019-02-05 D. Nguyen. **There will be an interactive problem in this round.** Learn more about interactive problems [here](https://codeforces.me/blog/entry/45307). This is our first attempt in making a Codeforces round, so suggestions are much welcome to help us improve ourselves. ;) We also want to thanks many friends for making this round possible: - Dmitry ~_kun_,2019-02-05 Sayutin...
[contest_time:1114]. The round will be rated for all Division 2 participants **(with rating less than2100

Full text and comments »

  • Vote: I like it
  • +573
  • Vote: I do not like it

85.
Codeforces Round #809 (Div. 2)
By BucketPotato, 4 years ago, In English
Codeforces Round #809 (Div. 2) Hi Codeforces, We're excited to invite you to [contest:1706], which will take place at [contest_time:1706]. All problems were created and prepared by [user:lunchbox,2022-07-16], [user:lce4113,2022-07-16], and me. It will be rated for all participants with ratings lower than 2100. Thanks to the people that made this round possible: - [user:IgorI,2022-07-16] for coordinating the round, patiently guiding us through the preparation process, and translating all statements to Russian. - [user:KAN,2022-07-16], for guiding and assisting [user:IgorI,2022-07-16] in the coordination. - [user:Apple_Method,2022-07-16], [user:izhang,2022-07-16], [user:lethan3,2022-07-16], [user:moo.,2022-07-16], [user:null_awe,2022-07-16], and [user:ezraft,2022-07-16] for proposing problems that didn't make it to the final version of the round. - [user:PurpleCrayon,2022-07-16] for feedback and suggestions in the early stages of the round. - Our testers, for their time and feedback: [user:EnDeRBeaT,2022-...
. It will be rated for all participants with ratings lower than 2100.

Full text and comments »

  • Vote: I like it
  • +472
  • Vote: I do not like it

86.
Codeforces Round #660 (Div. 2)
By Denisov, 6 years ago, In English
Codeforces Round #660 (Div. 2) Hello, Codeforces! We ([user:Denisov,2020-07-27], [user:Karavaev1101,2020-07-27], [user:perekopskiy,2020-07-27]) are glad to introduce to you [contest:1388], which will happen on [contest_time:1388]. **The round will be rated for the participants with rating lower than 2100**, although higher rated users are more than welcome to take part out of competition. Huge thanks to those who helped make this round possible: - [user:adedalic,2020-07-27] for amazing coordinating and reviewing the round, as well as helping with many different things. - [user:Karavaev1101,2020-07-27], [user:perekopskiy,2020-07-27] for creating problems and preparation. - [user:dorijanlendvaj,2020-07-27], [user:Tlatoani,2020-07-27], [user:BOGDAN_,2020-07-27], [user:gachiBASS,2020-07-27], [user:pikmike,2020-07-27], [user:antontrygubO_o,2020-07-27], [user:Osama_Alkhodairy,2020-07-27], [user:growup974,2020-07-27], [user:errorgorn,2020-07-27], [user:ilyasiv,2020-07-27], [user:Tathagat_shah,2020-07-28], [user:...
be rated for the participants with rating lower than 2100**, although higher rated users are more

Full text and comments »

  • Vote: I like it
  • +843
  • Vote: I do not like it

87.
Codeforces Round #890 (Div. 2)
By Vladithur, history, 3 years ago, In English
Codeforces Round #890 (Div. 2) #####Hi, Codeforces! [user:Alexdat2000,2023-08-03], [user:Igorfardoc,2023-08-03], and I are pleased to invite you to our [contest:1856], which will be held on [contest_time:1856]. **This round will be rated for participants with a rating lower than 2100.** We would like to thank: - [user:errorgorn,2023-08-03] for coordinating the round. - [user:Yuu,2023-08-03], [user:maomao90,2023-08-03], [user:thenymphsofdelphi,2023-08-03], [user:Dominater069,2023-08-03], [user:Mike4235,2023-08-03], [user:valeriu,2023-08-03], [user:irkstepanov,2023-08-03], [user:zengminghao,2023-08-03], [user:Gheal,2023-08-03], [user:DeMen100ns,2023-08-03], [user:FEDIKUS,2023-08-03], [user:thanhchauns2,2023-08-03], [user:MinaRagy06,2023-08-03], [user:Java,2023-08-03], [user:xudian,2023-08-03], [user:madlogic,2023-08-03], [user:squishybanana04,2023-08-03], [user:stefanbalaz2,2023-08-03], [user:kobebryan9,2023-08-03], [user:Murinh0,2023-08-03], [user:IlyinAD,2023-08-03], [user:Respectively,2023-08-03], [user:p...
participants with a rating lower than 2100.**

Full text and comments »

  • Vote: I like it
  • +441
  • Vote: I do not like it

88.
Codeforces Round 914 (Div. 2)
By oursaco, 3 years ago, In English
Codeforces Round 914 (Div. 2) ### **Note the unusual time of the round.** Hello Codeforces! [user:lunchbox,2023-12-07], [user:Apple_Method,2023-12-07], and I are pleased to invite you to participate in [contest:1904] on [contest_time:1904]. You will be given 2 hours to solve 6 problems (and one subtask). **The round will be rated for participants of Division 2 with a rating lower than 2100**. We promise the statements will be clear and concise, suitable for [user:AdamantChicken2,2023-12-07] to read *wink wink*. --- Also, we would like to thank: - [user:errorgorn,2023-12-07] for the epic coordination. - [user:alexdat2000,2023-10-03] for the Russian translations. - [user:MikeMirzayanov,2023-12-07] for the amazing Codeforces and Polygon platforms (and finally taking Polygon off beta). - <a href="https://codeforces.me/profile/enderbeat"><strong><font color="#a0a">[VIP] EnDeRBeaT</font></strong></a> for testing and statement assistance. - <a href="https://codeforces.me/profile/omeganot"><stron...
**The round will be rated for participants of Division 2 with a rating lower than2100**.

Full text and comments »

  • Vote: I like it
  • +331
  • Vote: I do not like it

89.
Codeforces Round #821 (Div. 2)
By 055D, 6 years ago, In English
Codeforces Round #821 (Div. 2) Hello Codeforces! We invite you to [contest:1733] starting on [contest_time:1733]. The round is **rated for users whose rating is lower than 2100**. All problems were mainly created and prepared by me. One problem is revised by [user:mejiamejia,2022-09-17]. I would also like to thank: - [user:MikeMirzayanov,2022-03-01] for Codeforces and Polygon platforms, - [user:KAN,2022-09-09] for helping preparation of the round, - [user:Arpa,2022-03-01] for coordinating and reviewing the round, - [user:mejiamejia, 2022-09-17] for developing one problem and a lot of advices, - [user:satyam_343,2022-07-09], [user:74TrAkToR,2022-07-12], [user:MagentaCobra,2022-07-27], [user:cadmiumky,2022-08-05], [user:Andreasyan,2022-08-05], [user:darkkcyan,2022-08-06], [user:Vladithur,2022-08-09], [user:Etherite,2022-08-10], [user:welleyth,2022-08-17], [user:mjhmjh1104,2022-08-27], [user:emorgan5289,2022-09-18], [user:jeroenodb,2022-09-18], [user:oolimry,2022-09-18], [user:willy108,2022-09-18], [user:...
whose rating is lower than 2100**.

Full text and comments »

  • Vote: I like it
  • +404
  • Vote: I do not like it

90.
Задачи div. 3 должны быть проще
By Nickir, history, 7 years ago, translation, In English
Задачи div. 3 должны быть проще С момента внедрения раундов div. 3 их было уже 23 штуки, и, возможно, некоторые из вас как и я заметили, что они стали довольно сложными для своей целевой аудитории -- людей с рейтингом ниже 1600. Всё чаще из 6-7 задач только 3-4 действительно решаемы официальными участниками, остальные же решаются только 100-200 и меньше людьми, многие из которых -- внеконкурсные участники. Для объективности оценки можно использовать такой инструмент, как сложность задач, недавняя фича codeforces. В таблице ниже приведены номера раундов, под ними указано количество задач со сложностью не более 1600 в данном раунде, а под ней указано общее количество задач в раунде. ![ ](/predownloaded/36/30/363093d7f48b35b63bafb8cfca850e9487917446.png) Информация справа говорит о том, что в среднем в раунде div. 3 из около семи задач только 3.7 имеют сложность 1600 или меньше, что составляет 55.8% от всех задач раунда. Анонсы к div. 3 гласят, что задачи таких раундов будут интересны участникам с рейтингом до...
problems have the difficulty of 2100 or less, which is the target audience. Last 2-3 problems of those, всего лишь 4 в среднем имеют сложность не более 2100, рассчитанную на целевую аудиторию таких раундов, , total amount of problems in the third row, amount of problems with difficulty 2100 or less in the, , в третьей общее количество задач, в четвёртой количество задач со сложностью не более2100.

Full text and comments »

  • Vote: I like it
  • +451
  • Vote: I do not like it

91.
Codeforces Round #851 (Div. 2)
By azberjibiou, history, 4 years ago, In English
Codeforces Round #851 (Div. 2) Hello Codeforces and welcome back to another div2 round. [user:YeongTree,2023-02-06] and I are excited to invite everyone to participate in [contest:1788], which will be held on [contest_time:1788]. This round is rated for the participants with ratings strictly lower than **2100**. You will be given **6 problems** and **2 hours** to solve them. All the problems are authored and prepared by [user:YeongTree,2023-02-06] and me. We would like to thank - [user:Arpa,2023-02-06] for excellent coordination and help with prepration. - [user:Alexdat2000,2023-02-06] for Russian translation. - [user:tlsdydaud1,2023-02-06], [user:hypergraph_coloring,2023-02-06], [user:Kawaii2DIdolOfGSHS,2023-02-06], [user:nlog,2023-02-06], [user:Ryute,2023-02-06], [user:TheQueenOfHatred,2023-02-06], [user:hanbyeol_,2023-02-06], [user:Physics07,2023-02-06], [user:jjang36524,2023-02-06], [user:OctaneC8H18,2023-02-06], [user:ahgus89,2023-02-06], [user:DELTARUNE,2023-02-06], [user:Go3,2023-02-06], [user:a...
This round is rated for the participants with ratings strictly lower than **2100 **. You will be

Full text and comments »

  • Vote: I like it
  • +491
  • Vote: I do not like it

92.
Codeforces Round 979 (Div. 2)
By cry, 2 years ago, In English
Codeforces Round 979 (Div. 2) Haiii Codeforces ^_^ ================== <img src="/predownloaded/43/5d/435d58648d7459cedf23ec644dc6cc5fbc112f64.png" style="width:350px;float:right;margin:0 1em 1em 1em;"/> **Note the unusual starting time. This round starts 30 minutes before the standard starting time.** [user:vgoofficial,2024-10-15] and I are extremely excited to invite you to [contest:2030] on [contest_time:2030]. You will be given **7 problems** and **2 hours and 15 minutes** to solve them. One problem will be split into two subtasks. This round will be **rated** for all participants with rating below **2100**. This round is based on... absolutely nothing. We would like to mention the following individuals for making the contest possible: - Our coordinatorz [user:satyam343,2024-10-15] for his active and insightful coordination once again. ORZ!!!! - Our testuwuwuwuers for their efforts in improving this [gramazing](https://www.urbandictionary.com/define.php?term=Gramazing) contest: [user:nife...
below **2100**.

Full text and comments »

  • Vote: I like it
  • +417
  • Vote: I do not like it

93.
Codeforces Round #654 (Div. 2)
By physics0523, history, 6 years ago, In English
Codeforces Round #654 (Div. 2) Codeforcesの皆さん、こんにちは!(Hello, Codeforces!) I'm glad to invite you to my first contest, [contest:1371] which will be held on [contest_time:1371] (notice **earlier time** than usual). All of the problems were mainly written and prepared by me. The round is **rated if your rating is strictly less than 2100**. You will be given **6 problems** (one problem has a subtask) and **2 hours** to solve them. Please, read all the problems. I would really like to thank: - [user:isaf27,2020-06-30] for amazing coordinating my round. - [user:300iq,2020-06-30] , [user:alireza_kaviani,2020-06-30] , [user:AmShZ,2020-06-30] , [user:antontrygubO_o,2020-06-30] , [user:dorijanlendvaj,2020-06-30] , [user:lucky_21,2020-06-30] , [user:Monogon,2020-06-30] , [user:noobiesAG,2020-06-30] , [user:sibasish_14,2020-06-30] and [user:zxyl,2020-06-30] for mighty testing the problems. - [user:MikeMirzayanov,2020-06-30] for marvelous Codeforces and Polygon platforms. The scoring distribution will be announce...
. The round is **rated if your rating is strictly less than 2100**.

Full text and comments »

  • Vote: I like it
  • +732
  • Vote: I do not like it

94.
Codeforces Round 972 (Div. 2)
By BiNARyBeastt, history, 2 years ago, In English
Codeforces Round 972 (Div. 2) Good Day Codeforces! Me and [user:Tsovak,2024-08-26] are happy to invite you to take part in [contest:2005], which starts on [contest_time:2005]. You will be given **5 problems** and **2 hours** to solve them. Two problems are divided into two subtasks. The round will be rated for all participants with a rating **lower than 2100**. The problems were authored by me with [user:Tsovak,2024-08-26]'s help to solve and alter them. We would like to thank: - [user:TheScrasse,2024-08-26], [user:Kaey,2024-08-31] for wonderful double coordination and chess skills. - [user:Alexdat2000,2024-09-13] for Russian translation. - [user:turmax,2024-08-26], [user:BurnedChicken,2024-08-26] for nutella testing. - [user:physics0523,2024-08-26], [user:Andreasyan,2024-08-26], [user:Arayi,2024-08-26], [user:zidder,2024-08-26] for red testing. - [user:FelixArg,2024-08-26], [user:_LeMur_,2024-08-26], [user:_RedWine_,2024-08-26], [user:Error_Yuan,2024-08-26] for orange testing. - [us...
The round will be rated for all participants with a rating **lower than 2100**.

Full text and comments »

  • Vote: I like it
  • +418
  • Vote: I do not like it

95.
Codeforces Round #926 (Div. 2)
By FairyWinx, 3 years ago, translation, In English
Codeforces Round #926 (Div. 2) Neko Nya, Кодефорсес =＾● ⋏ ●＾= ------------------ <img src="https://i.ibb.co/7G9bxVS/2024-02-13-16-39-13.jpg" style="float: right;margin: 0 5% 5%;width: 25.0%;height: 25.0%;"> Я рад пригласить вас поучаствовать в [contest:1929]. Он состоится в [contest_time:1929] и в нем вы будете помогать мальчику Саше добиться девочки. Раунд будет **рейтинговым** для всех участников с рейтингом строго меньшим **2100**. И у вас будет **2 часа**, чтобы решить **6 задач**. Тута благодарность всем соучаствуюшим в раунде: - Самому милому координатору [user:Artyom123,2024-02-13]. (Не обижайтесь оставшиеся) - [user:KAN,2022-08-31], [user:geranazavr555,2024-02-13], [user:MikeMirzayanov,2024-02-13] за ЛУЧШУЮ платформу. - Легиону тестеров: [user:A_G,2024-02-13], [user:AgafonovArtem,2024-02-13], [user:Alexdat2000,2024-02-13], [user:Vladithur,2024-02-13], [user:wuhudsm,2024-02-13], [user:petyb,2024-02-13], [user:induk_v_tsiane,2024-02-13], [user:sevlll777,2024-02-13], [user:mz1,2024-02-13], [user:...
round will be rated for all participants with a rating strictly less than 2100 . You will have 2, рейтингом строго меньшим **2100**. И у вас будет **2 часа**, чтобы решить **6 задач**.

Full text and comments »

  • Vote: I like it
  • +686
  • Vote: I do not like it

96.
Codeforces Round #825 (Div. 2)
By satyam343, 4 years ago, In English
Codeforces Round #825 (Div. 2) Hello, Codeforces! [user:lackadaisical_lad,2022-10-07], [user:naman1601,2022-10-07] and I are glad to invite everyone to participate in [contest:1736], which will be held on [contest_time:1736]. This Round will be rated for participants with rating lower than **2100**. You will be given **5 problems with one subtask** and **2 hours** to solve them We would like to thank: - [user:Arpa,2022-10-07] for coordinating the round. - [user:KAN,2022-10-07] for help in preparation of the round. - [user:Everule,2022-10-07] for proposing a task that did not make it to the final problemset. - [user:BucketPotato,2022-10-07], [user:PurpleCrayon,2022-10-07], [user:the_hyp0cr1t3,2022-10-07], [user:welleyth,2022-10-07], [user:MagentaCobra,2022-10-07], [user:recurring_raj,2022-10-07], [user:GoatTamer,2022-10-07], [user:udhavvarma03,2022-10-07], [user:74TrAkToR,2022-10-07], [user:AwakeAnay,2022-10-07], [user:cadmiumky,2022-10-07], [user:TheScrasse,2022-10-07], [user:kal013,2022-10-07]...
This Round will be rated for participants with rating lower than **2100**.

Full text and comments »

  • Vote: I like it
  • +318
  • Vote: I do not like it

97.
Educational Codeforces Round 96 [Rated for Div. 2]
By BledDest, history, 6 years ago, translation, In English
Educational Codeforces Round 96 [Rated for Div. 2] Hello Codeforces! On [contest_time:1430] [contest:1430] will start. **Note that the start time is unusual**. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2020-10-10] Dalabaev, Alex [user:fcspartakm,2020-10-10] Frolov an...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +463
  • Vote: I do not like it

98.
Codeforces Round #912 (Div. 2)
By Theo830, 3 years ago, In English
Codeforces Round #912 (Div. 2) Γεια σου (Hello), Codeforces once again! [user:Adam_GS,2023-11-25] and I are glad to invite you to participate in [Codeforces Round #912 (Div. 2)](https://codeforces.me/contest/1903) which will take place on [contest_time:1903]. **Note the unusual start time of the round**. As usual, **this round will be rated for participants with rating lower than 2100.** Problems were created and prepared by [user:Adam_GS,2023-11-25] and me. We tried to make them interesting, with short and clear statements. We hope that you will enjoy them! I would like to thank: - [user:ScarletS,2023-11-25] for amazing coordination of this round. - [user:Adam_GS,2023-11-25] for joining as an author after testing the contest. - [user:fishy15,2023-11-25], [user:Andreasyan,2023-11-25], [user:phattd,2023-11-25], [user:Murinh0,2023-11-25], [user:irkstepanov,2023-11-25], [user:wuhudsm,2023-11-25], [user:Ari,2023-11-25], [user:satyam343,2023-11-25], [user:Qualified,2023-11-25], [user:nyaruhod...
rating lower than 2100.**

Full text and comments »

  • Vote: I like it
  • +463
  • Vote: I do not like it

99.
Educational Codeforces Round 88 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 88 [Rated for Div. 2] Hello Codeforces! On [contest_time:1359] [contest:1359] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-05-27] Glazov, Adilbek [user:adedalic,2020-05-27] Dalabaev, Vladimir [user:vovuh,2020-05-27] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +355
  • Vote: I do not like it

100.
Codeforces Round #1011 (Div. 2)
By Serval, 20 months ago, In English
Codeforces Round #1011 (Div. 2) Hi Codeforces! I [user:Serval,2025-03-19] am glad to invite everyone to participate in [contest:2085], which will be held on [contest_time:2085]. This round will be rated for participants with rating lower than 2100. We will be glad to see the participants with a higher rating to take part in our round unofficially as well! You will be given 6 problems to solve in 2 hours, one of which will be divided into two subtasks. Scoring distribution will be announced later. I would like to thank everyone that makes this round possible: - [user:Error_Yuan,2025-03-19] and [user:satyam343,2025-03-19] for coordination of the round and help with the preparation. It is noteworthy that this round is the debut of [user:Error_Yuan,2025-03-19] as the coordinator. Special thanks to him! - [user:18o3,2025-03-19], [user:AG-88301,2025-03-19], [user:Dominater069,2025-03-19], [user:Edeeva,2025-03-19], [user:Graythron,2025-03-19], [user:Hanghang007,2025-03-19], [user:JagguBandar,2025-03-19], [us...
This round will be rated for participants with rating lower than 2100. We will be glad to see the

Full text and comments »

  • Vote: I like it
  • +383
  • Vote: I do not like it

101.
Codeforces Round #822 (Div. 2)
By arvindf232, history, 4 years ago, In English
Codeforces Round #822 (Div. 2) **UPD: The round has been rescheduled to a different time due to a clash with a CodeChef contest** Hello CodeForces! Me, [user:happypotato1207,2022-09-20] and [user:nicholask,2022-09-20] are excited to invite you to participate in [contest:1734]. It will start at [contest_time:1734]. The round will be **rated for everyone with less than 2100 rating**. You have **2 hours** to solve **6 problems**. **Please note the unusual start time**. We would like to take this opportunity to thank everyone who have contributed to our round: - [user:darkkcyan,2022-09-17] for his excellent coordination; - [user:anthony123,2022-09-17] and [user:jerryliuhkg,2022-09-17] for proposing tasks that did not make it to the final problemset; - [user:thenymphsofdelphi,2022-09-17], [user:kevinxiehk,2022-09-17], [user:xuanquang1999,2022-09-17], [user:ta4p,2022-09-17], [user:ACGN,2022-09-17], [user:Mike4235,2022-09-17], [user:brianlee.lck,2022-09-17], [user:JeffreyLC,2022-09-17], [user:prvocislo,202...
everyone with less than 2100 rating**. You have **2 hours** to solve **6 problems**. **Please note

Full text and comments »

  • Vote: I like it
  • +370
  • Vote: I do not like it

102.
Codeforces Round 1061 (Div. 2)
By hxu10, 13 months ago, In English
Codeforces Round 1061 (Div. 2) On the special day of 1024, I am very glad to invite you to participate in [contest:2156], starting at [contest_time:2156] There will be six problems for you to solve in two hours, one of which will have two parts. At least one problem will be interactive, so please make sure to read the [guide for interactive problem](https://codeforces.me/blog/entry/45307) before the contest. This round will be rated for all participants with rating below 2100. All problems were authored by me, and carefully prepared by [user:maomao90,2025-10-20] and me. I would like to thank the following list of very strong individuals for making this round possible: - [user:maomao90,2025-10-20] for his wonderful coordination and careful adjustments to some problems! - [user:MathModel,2025-10-20] for his excellent work on the editorial. - [user:Alexdat2000,2025-10-20] for translating the statements into russian. - [user:Dominater069,2025-10-20] and [user:A_G,2025-10-20] for VIP testing - [user:Agi...
participants with rating below 2100.

Full text and comments »

  • Vote: I like it
  • +432
  • Vote: I do not like it

103.
Codeforces Round #554 (Div. 2)
By AkiLotus, history, 8 years ago, In English
Codeforces Round #554 (Div. 2) Once again, **TREMBLE BEFORE THE MIGHTY OMEGALULRIPGRAPE.** ![ ](https://i.imgur.com/kpS7NEq.png) ![ ](https://i.imgur.com/A2dF7M2.jpg) *(He last walked the Earth in round [538](https://codeforces.me/blog/entry/65033) btw.)* Hello Codeforces! We are here to invite you to Codeforces Round #554 (Div. 2), which will take place at [contest_time:1152]. The round will be rated for all Division 2 participants **(with rating less than 2100)**, yet any Division 1 participants are welcome to join us out of competition. The round will be cat themed. Raise your paws and prepare your catnips! *(Or even cat memes, while you're at it).* You will be given **6+1** problems ( **6** problems, one of them has **2** subtasks ) to solve in **2 hours.** The round's problems were prepared by Xuan-Quang ~xuanquang1999,2019-04-23 D. Nguyen, Duy-Bach ~Akikaze,2019-04-23 Le, Stefan ~stefdasca,2019-04-23 Dascalescu, Quang-Minh ~MofK,2019-04-23 D. Nguyen and our dear Codeforces coordinator ...
The round will be rated for all Division 2 participants **(with rating less than 2100)**, yet any

Full text and comments »

  • Vote: I like it
  • +436
  • Vote: I do not like it

104.
Codeforces Round #699 (Div. 2)
By Warawreh, history, 6 years ago, In English
Codeforces Round #699 (Div. 2) Hi fellow Coders! [user:Shanks,2021-02-02], [user:Salem_Alwarawreh,2021-02-02] and I are glad to invite you to take part in [contest:1481], which will take place on [contest_time:1481]. Round will be rated for participants with rating less than 2100. Participants from the first division are also welcomed to take part out of competition. You will be given **2 hours** to solve **6 problems**, each problem has a picture and a story above it. The stories are skippable if you want to focus on the real problems. We would also like to thank: - [user:adedalic,2021-02-02] for the coordination and discussion of this round! - [user:Motarack,2021-02-02], [user:namanbansal013,2021-02-02], [user:Jellyman102,2021-02-02], [user:stack_overflows,2021-02-02], [user:Manik,2021-02-02], [user:morzer,2021-02-02] and [user:_HossamYehia_,2021-02-02] for phase one testing and valuable feedback. - [user:kclee2172,2021-02-02], [user:awoo,2021-02-02], [user:Karavaiev,2021-02-02], [user:I_Love_YrNameC...
participants with rating less than 2100. Participants from the first division are also welcomed to take

Full text and comments »

  • Vote: I like it
  • +552
  • Vote: I do not like it

105.
Educational Codeforces Round 92 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 92 [Rated for Div. 2] Hello Codeforces! On [contest_time:1389] [contest:1389] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-07-28] Glazov, Adilbek [user:adedalic,2020-07-28] Dalabaev, Vladimir [user:vovuh,2020-07-28] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +413
  • Vote: I do not like it

106.
Codeforces Round #782 (Div. 2)
By Newtech66, 5 years ago, In English
Codeforces Round #782 (Div. 2) Hello, Codeforces! [user:TimeWarp101,2022-04-12] and I are excited to invite you to [contest:1659] which will take place on [contest_time:1659]. **This round will be rated for participants with rating lower than 2100.** Many thanks to all the people who made this round possible: - [user:Arpa,2022-04-12] and [user:KAN,2022-04-12] for coordinating the round! - [user:KAN,2022-04-17] for Russian translations. - [user:AwakeAnay,2022-04-12] for a lot of advice throughout the process + listening to my terrible problem ideas, and for proposing tasks that did not make it to the final problemset. - [user:TimeWarp101,2022-04-12] cause I love you uwu <3 - [user:i_am_completely_useless,2022-04-12] for being completely useless. - [user:antontrygubO_o,2022-04-12], [user:AmShz,2022-04-12], [user:AwakeAnay,2022-04-12], [user:generic_placeholder_name,2022-04-12], [user:TeaTime,2022-04-12], [user:fishy15,2022-04-12], [user:TheScrasse,2022-04-12], [user:kartikeyasri23,2022-04-12], [user:Mage...
place on [contest_time:1659]. **This round will be rated for participants with rating lower than2100.**

Full text and comments »

  • Vote: I like it
  • +469
  • Vote: I do not like it

107.
Codeforces Round 911 (Div. 2)
By NemanjaSo2005, history, 3 years ago, In English
Codeforces Round 911 (Div. 2) Hello, Codeforces! [user:Riblji_Keksic,2023-11-25] and I are glad to invite you to [contest:1900], which will start on [contest_time:1900]. You will be given **6** problems and **2** hours to solve them. The round will be rated for participants of Division 2 with a rating lower than **2100**. Division 1 participants can participate unofficially. All problems are invented and prepared by [user:Riblji_Keksic,2023-11-25] and me. Special thanks go to [user:n0sk1ll,2023-11-25] and [user:TimDee,2023-11-25] for their great work during the testing process of the round. And of course, I would love to thank the people who made this round possible: - [user:pashka,2023-11-25] for his great coordination of the round! - [user:IgorI,2023-11-25] for helping host the round! - [user:Alexdat2000,2023-11-25] for helping translate the round! - [user:prvocislo,2023-11-25], [user:wxhtzdy,2022-06-02], [user:valeriu,2023-11-25], [user:satyam343,2023-11-25], [user:n0sk1ll,2023-11-25...
The round will be rated for participants of Division 2 with a rating lower than **2100**. Division

Full text and comments »

  • Vote: I like it
  • +338
  • Vote: I do not like it

108.
Codeforces Round #705 (Div. 2)
By AlFlen, 6 years ago, translation, In English
Codeforces Round #705 (Div. 2) <p style="text-align:right"><i>The future is bulletproof<br> The aftermath is secondary<br> It's time to do it now and do it loud!</i></p> Привет, Codeforces! Мы с [user:74TrAkToR,2021-03-03] рады пригласить вас на наш совместный [contest:1493], который пройдет в [contest_time:1493]. Обратите внимание на необычное время проведения раунда. <b>Он будет рейтинговым для всех участников, чей рейтинг ниже 2100.</b> Мы уже проводили раунд и провели работу над ошибками: <ul> <li>условия будут короткие и понятные</li> <li>мы постарались сделать претесты еще сильнее</li> <li>разбор будет опубликован сразу же после раунда</li> </ul> Мы хотим поблагодарить всех, кто оказал нам бесценную помощь в подготовке этого раунда: <ul style="list-style-type:square"> <li>Нашего координатора [user:KAN,2021-03-03] за великолепную координацию раунда.</li> <li>Наших тестеров [user:Tlatoani,2021-03-03], [user:sava-cska,2021-03-03], [user:DIvanCode,2021-03-03], [user:BLIZZARD,2021-03-03], ...
participants with rating strictly less than 2100., рейтинговым для всех участников, чей рейтинг ниже 2100.

Full text and comments »

  • Vote: I like it
  • +679
  • Vote: I do not like it

109.
Codeforces Round #689 (Div. 2), основанный на Zed Code Competition 2020
By Vladik, 6 years ago, translation, In English
Codeforces Round #689 (Div. 2), основанный на Zed Code Competition 2020 <img alt="epam" src="https://d3373sevsv1jc.cloudfront.net/uploads/communities_production/page_part/46738/50534DE5F997443DBE1BBA96BC394F66.png" style="float:right; height: 200px; "/> <p>Привет, <span style="font-weight:bold">Code</span><span style="color:rgb(71,94,152);font-weight:bold">forces</span>!</p> Рад анонсировать и пригласить вас на [contest:1461], который пройдет [contest_time:1461]. Мы хотим предложить вам для решения 6 задач взятых с Zed Code Competition 2020, который проводился в рамках конференции [Adapt by Zed](http://zed.epam.com/) компанией [EPAM Systems](https://www.epam.com/). **Этот раунд будет рейтинговым для участников, чей рейтинг ниже 2100.** - Авторами раунда являются: Александр [user:AleXman111,2020-12-10] Кривошеев, Александр [user:sdryapko,2020-12-10] Дряпко, Алексей [user:netman,2020-12-10] Вистяж и я. - Координаторами раунда выступили Владимир [user:vovuh,2020-12-10] Петров и Николай [user:KAN,2020-12-10] Калинин. - Тестировщики: [user:pi...
**This round will be rated for the participants with rating lower than 2100.**, **Этот раунд будет рейтинговым для участников, чей рейтинг ниже 2100.**

Full text and comments »

  • Vote: I like it
  • +328
  • Vote: I do not like it

110.
Codeforces Round #853 (Div. 2)
By Serval, history, 4 years ago, In English
Codeforces Round #853 (Div. 2) **UPD: The start time has been changed. Note that the start time is unusual.** Hi Codeforces! [user:Bazoka13,2023-02-23], [user:Toxel,2023-02-23], and I [user:Serval,2023-02-23] are glad to invite everyone to participate in [contest:1789], which will be held on [contest_time:1789]. This round will be rated for participants with rating lower than 2100. We will be glad to see the participants with a higher rating to take part in our round unofficially as well! You will be given 6 problems to solve in 2 hours. Scoring distribution will be announced later. We would like to thank everyone that makes this round possible: - [user:Artyom123,2023-02-23] for coordination of the round and help with the preparation. - [user:SSerxhs,2023-02-23], [user:skywalkert,2023-02-23], [user:zlc1114,2023-02-23], [user:foreverlasting,2023-02-23], [user:tiger2005,2023-02-23], [user:OMG_link,2023-02-23], [user:fried-chicken,2023-02-23], [user:tibinyte,2023-02-23], [user:_Viole_,2023-02-23], [u...
This round will be rated for participants with rating lower than 2100. We will be glad to see the

Full text and comments »

  • Vote: I like it
  • +394
  • Vote: I do not like it

111.
Best of COCI #1
By MladenP, history, 5 years ago, In English
Best of COCI #1 Since a new season of COCI (Croatian Open Competition in Informatics) started [last saturday](https://codeforces.me/blog/entry/96022), here is the first in a series of COCI appreciation posts (I will post one after each COCI round, so six in total!). For my coaching, I went through all COCI contests since 2006 to gather tasks and selected some of my favorite ones. ### Notes - I skipped a lot of the really hard tasks because they weren't useful for my students. I kept a list of these tasks, if someone wants it, they can PM me. Also, I only considered COCI, not COI. This current season is not being considered. - There are many great tasks outside of the 48 shown (throughout the series), so it's worth it to go through other tasks as well. I have selected just my favorite ones. - These tasks are maybe not always the most innovative, I have selected the tasks that are most useful for coaching and learning new ideas, so for people who already know the idea, the difficulty might be mu...
Difficulty range: 2100-2300

Full text and comments »

  • Vote: I like it
  • +237
  • Vote: I do not like it

112.
Educational Codeforces Round 103 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 103 [Rated for Div. 2] Hello Codeforces! On [contest_time:1476] [contest:1476] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2021-01-28] Glazov, Adilbek [user:adedalic,2021-01-28] Dalabaev, Vladimir [user:vovuh,2021-01-28] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +376
  • Vote: I do not like it

113.
Codeforces Round #645 (Div. 2)
By Alexdat2000, 6 years ago, translation, In English
Codeforces Round #645 (Div. 2) _Сoronavirus work, coronavirus school, coronavirus rest, coronavirus time spending, coronavirus contest._ <p align="center"> <img src="/predownloaded/21/49/2149d863ac14b6520c81bebd44b1d0e544b44eb2.jpg"> </p> Привет, Codeforces! Во [contest_time:1358] пройдёт [contest:1358]. Он будет рейтинговым для **всех участников, чей рейтинг ниже 2100**. Вам будет предложено **6 задач** и **2 часа** на их решение. Задачи были придуманы и подготовлены Алексеем [user:Alexdat2000,2020-05-19] Дацковским, Илианом [user:ilian04,2020-05-19] Андриановым, Всеволодом [user:Sevlll,2020-05-19] Лепешовым. Мы постарались сделать интересные задачи, красивые условия и сильные тесты. Надеемся, что вам понравятся задачи и ваш рейтинг станет выше! Мы выражаем благодарность: - [user:MikeMirzayanov,2020-05-19] за великолепные платформы Codeforces и Polygon! - [user:300iq,2020-05-19] за прекрасную координацию и полезные советы! - Спасибо [user:Siberian,2020-05-19], [user:mohammedehab2002,2020-0...
with rating lower than 2100**. You will have **2 hours** to solve **6 problems**., рейтинг ниже 2100**. Вам будет предложено **6 задач** и **2 часа** на их решение.

Full text and comments »

  • Vote: I like it
  • +313
  • Vote: I do not like it

114.
Educational Codeforces Round 85 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 85 [Rated for Div. 2] Hello Codeforces! On [contest_time:1334] [contest:1334] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-04-09] Glazov, Adilbek [user:adedalic,2020-04-09] Dalabaev, Vladimir [user:vovuh,2020-04-09] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +361
  • Vote: I do not like it

115.
Codeforces Round 1045 (Div. 2)
By henotrix, 15 months ago, In English
Codeforces Round 1045 (Div. 2) Hello, Codeforces! I am glad to invite you to take part in [contest:2134], which will start on [contest_time:2134]. You will have $2$ hours to solve $6$ problems. The score distribution is listed below. There will be at least one interactive problem, so make sure to read the [guide for interactive problems](https://codeforces.me/blog/entry/45307) before the contest. The round will be rated for participants whose rating is below $2100$, but higher rated users are also welcome to participate out of competition. The problems were authored and prepared by me. I would like to thank: - [user:SSerxhs,2025-08-24] for coordination and providing great ideas to improve the problem set. - [user:Alexdat2000,2025-08-24] for translating the statements to Russian. - Our list of testers for providing valuable feedback: [user:StarSilk,2025-08-24], [user:BurnedChicken,2025-08-24], [user:Misuki,2025-08-24], [user:__baozii__,2025-08-24], [user:_istil,2025-08-24], [user:A_G,2025-08-24],...
The round will be rated for participants whose rating is below $2100$, but higher rated users are

Full text and comments »

  • Vote: I like it
  • +328
  • Vote: I do not like it

116.
Educational Codeforces Round 97 [Rated for Div. 2]
By awoo, 6 years ago, translation, In English
Educational Codeforces Round 97 [Rated for Div. 2] Hello Codeforces! On [contest_time:1437] [contest:1437] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-10-26] Glazov, Adilbek [user:adedalic,2020-10-26] Dalabaev, Vladimir [user:vovuh,2020-10-26] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +356
  • Vote: I do not like it

117.
Divide by Zero 2021 and Codeforces Round #714 (Div. 2)
By mtnshh, history, 6 years ago, In English
Divide by Zero 2021 and Codeforces Round #714 (Div. 2) [The Programming Club, IIT Indore](https://www.linkedin.com/company/progclub-iiti) is proud to present our flagship event, **Divide By Zero**! The contest will take place on [contest_time:1513]. This round will be rated for all participants with a rating lower than 2100. ![Divide By Zero 2021](/predownloaded/bd/91/bd91b097406e37c0d35b474bbf0d95b5a097d840.jpeg) Thanks to the following people for making the round possible: - [user:KAN,2021-04-10] for coordinating throughout the round. - [user:kalpitk,2021-04-10], [user:ajit,2021-04-10] and [user:7dan,2021-04-10] for setting the problems. - [user:dvshah,2021-04-10], [user:bhanushali,2021-04-10], [user:sundesh,2021-04-10], [user:AniketSangwan,2021-04-10], [user:krishanu21saini,2021-04-10], [user:somyamehta_24,2021-04-10] and [user:hk2102,2021-04-10] for their contribution to the problemset. - [user:Um_nik,2021-04-10], [user:dorijanlendvaj,2021-04-10], [user:chctxdy68,2021-04-10], [user:Osama_Alkhodairy,2021-04-10], [user:Scarle...
round will be rated for all participants with a rating lower than 2100.

Full text and comments »

  • Vote: I like it
  • +502
  • Vote: I do not like it

118.
Codeforces Round 1068 (Div. 2)
By paulzrm, 11 months ago, In English
Codeforces Round 1068 (Div. 2) Hello Codeforces! We are glad to invite you to participate in [contest:2173] on [contest_time:2173]. This round is rated for **all participants with rating below 2100**. You will be given **6 problems** and **2 hours** to solve them. **At least one problem will be interactive**, so please make sure to read the [guide for interactive problems](https://codeforces.me/blog/entry/45307) before the contest. In this contest, characters from four different anime series appear in some of the problem statements (including the one my avatar is from). Can you guess which series they are? We would like to thank: - [user:paulzrm,2025-12-02], [user:HHH666666,2025-12-02], [user:chen_zida,2025-12-02] and [user:Hugewide,2025-12-02] for writing the problems. - [user:Error_Yuan,2025-12-02] for coordinating the round. - [user:MikeMirzayanov,2025-12-02] for great Codeforces and Polygon platforms. - [user:Alexdat2000,2025-12-04] for translating the statements into Russian. - [user...
This round is rated for **all participants with rating below 2100**. You will be given **6 problems

Full text and comments »

  • Vote: I like it
  • +381
  • Vote: I do not like it

119.
Codeforces Round 949 (Div. 2) Editorial
By zltzlt, history, 2 years ago, In English
Codeforces Round 949 (Div. 2) Editorial Thank you for participating! Sorry for being much harder than usual Div. 2 :( But we still hope you find some of our problems interesting. <spoiler summary="Rating predictions (Inspired by sum's editorial)"> It seems like a joke now... | Person | A | B | C | D | E | F | | :-----------: | :-----------: | :-----------: | :-----------: | :-----------: | :-----------: | :-----------: | | [user: zltzlt, 2024-5-31] | 800 | 1400 | 1600 | 2000 | 2300 | 2800 | | [user: small_peter, 2024-5-31] | 800 | 1400 | 1700 | 1600 | | | | [user: WRuperD, 2024-5-31] | 800 | 1300 | 1600 | 2000 | | 2800 | | [user: yinhee, 2024-5-31] | 800 | 1000 | 1500 | 2100 | 2200 | 2700 | | [user: sinsop90, 2024-5-31] | 1000 | 1300 | 1500 | 2000 | 2200 | | | [user: Yujiahe,2024-05-28] | 800 | 1100 | 1600 | 1900 | | 2700 | | [user: CharlieV, 2024-5-31] | | | | 2400 | 2500 | 3000 | | [user: JWRuixi, 2024-5-31] | | | | 1800 | | | | [user: Edwin__VanCleef, 2024-5-31] | | | 1600 | 1800 | | | [u...
| 1000 | 1500 | 2100 | 2200 | 2700 | | [user: sinsop90, 2024-5-31] | 1000 | 1300 | 1500 | 2000 | 2200

Full text and comments »

  • Vote: I like it
  • +250
  • Vote: I do not like it

120.
Codeforces Round #1002 (Div. 2)
By yunetive29, 21 month(s) ago, translation, In English
Codeforces Round #1002 (Div. 2) ###**Ciao, Codeforces!** Я рад пригласить вас принять участие в [Codeforces Round 1002 (Div. 2)](https://codeforces.me/contest/2059), который состоится в [contest_time:2059]. Задачи были предложены мной и Артёмом [user:shfs,2025-01-30]. Мы надеемся, что задачи покажутся вам интересными. Этот раунд будет **рейтинговым для участников, чей рейтинг ниже 2100**. Участники с более высоким рейтингом могут принять участие вне конкурса. Вам будет предложено **5 задач и 2 часа** на их решение. Последняя задача будет разделена на две части. Я хочу поблагодарить: - [user:shfs,2025-01-30] за помощь в создании задач. - [user:Artyom123,2025-01-30] за элегантную координацию раунда. - Наших тестеров [user:makrav,2025-01-30], [user:Anonymous_Noob,2025-01-30], [user:IzhitskiyTimofey,2025-01-30], [user:sadness,2025-01-30], [user:djm03178,2025-01-30], [user:ArSarapkin,2025-01-30], [user:max0000561,2025-01-30], [user:Vash_nick,2025-01-30], [user:AndreyPavlov,2025-01-30], [user:127.0.0.1...
This round will be **rated for all participants, with rating below 2100**. Participants with higher, Этот раунд будет **рейтинговым для участников, чей рейтинг ниже 2100**. Участники с более высоким

Full text and comments »

  • Vote: I like it
  • +324
  • Vote: I do not like it

121.
Codeforces Round 1035 (Div. 2)
By CutieSmileHaruka, history, 16 months ago, In English
Codeforces Round 1035 (Div. 2) 你好，Codeforces！ We (FeOI and WAOI Team) are glad to invite you to take part in [contest:2119], which will start on [contest_time:2119]. You will be given **6 problems** and **2 hours** to solve them. The round will be rated for participants of Division 2 with a rating lower than **2100**. Division 1 participants can participate unofficially. All problems are authored by [user:lizhous,2025-06-28], [user:Lyz09,2025-06-28], [user:ma2021tyoi0037,2025-06-28] and me. I would like to thank the following people for making this round possible: - [user:abc864197532,2025-06-28] for the excellent coordination. - [user:Alexdat2000,2025-06-28] for Russian translation. - [user:lizhous,2025-06-28], [user:Lyz09,2025-06-28], [user:Rebex,2025-06-28], [user:hzy_mod,2025-06-28] and me for providing some rejected problems. - [user:Z-301,2025-06-28] for Legendary Grandmaster Testing. He was promoted from IGM to LGM four days after testing, congratulations! - [user:Fysty,2025-06-28], [user:_...
The round will be rated for participants of Division 2 with a rating lower than **2100**. Division

Full text and comments »

  • Vote: I like it
  • +297
  • Vote: I do not like it

122.
Educational Codeforces Round 101 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 101 [Rated for Div. 2] Hello Codeforces! On [contest_time:1469] [contest:1469] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-12-27] Glazov, Adilbek [user:adedalic,2020-12-27] Dalabaev, Vladimir [user:vovuh,2020-12-27] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +365
  • Vote: I do not like it

123.
Codeforces Round 1007 (Div. 2)
By FetFot, 21 month(s) ago, In English
Codeforces Round 1007 (Div. 2) <h1>مرحبا, Codeforces!</h1> Translation: Hello, Codeforces! We are super excited to invite you to participate in [Codeforces Round 1007 (Div. 2)](https://codeforces.me/contest/2071), which will be held on [Friday, February 28, 2025 at 17:35](https://www.timeanddate.com/worldclock/fixedtime.html?day=28&month=2&year=2025&hour=17&min=35&sec=0&p1=166). This round will be **rated for all participants with rating below $2100$**. Participants with higher ratings are encouraged to participate out of the competition. You will be presented with **$6$ or $7$ problems** and **$2$ hours and $15$ minutes** to solve them. The problems are authored and prepared by [user:Al-Merreikh,2025-02-25], [user:ApraCadabra,2025-02-25], [user:FzArK,2025-02-25], [user:limbo16,2025-02-25], [user:MOUFLESS,2025-02-25], and [user:Vectors_Master,2025-02-25]. We would like to thank everyone who made this round possible: - [user:Sugar_fan,2025-02-25] for coordinating the round and helping with problem pr...
This round will be **rated for all participants with rating below $2100$**. Participants with

Full text and comments »

  • Vote: I like it
  • +343
  • Vote: I do not like it

124.
You can do it, too!
By kpw29, 4 years ago, In English
You can do it, too! Introduction ------------------------------- So, I set myself [that challenge](https://codeforces.me/blog/entry/81383) to retire as a red coder before 24.09.2020... and I failed **miserably**. At least I am less delayed than most civil infrastructure projects. This blog will be a recap of this _short_ challenge with a mixture of some tips on practicing (for all levels!), some random life advice and, of course my bad sense of humour. It is dedicated to all those who aren't wonderkids, go from failure to failure and feel like banging their head into a wall during most of their competitive programming journey. Whatever your goal is, I'd like to strengthen your beliefs &mdash; you can do it! How it all started ------------------ My skill level has been in constant stagnation for years. I've always thought that I'm just not talented enough to be a grandmaster. Although I've been red twice in the past, it was quite lucky and the next contests were solid $-137$ and $-189$ so th...
, being a really nice guy, shared with me his recipe: _First solved 100 2000 rated problems then 1002100

Full text and comments »

  • Vote: I like it
  • +435
  • Vote: I do not like it

125.
CodeTON Round 8 Editorial
By cry, 3 years ago, In English
CodeTON Round 8 Editorial Thank you for participating! We put a lot of effort into this contest. Special thanks to [user:TheScrasse,2024-03-10] for contributing to these problems. <spoiler summary="Rating Predictions"> | Person | A | B | C1 | C2 | D | E | F | G | H | |--------------------------------------------|------|------|------|------|------|------|------|------|------| | [user:oursaco,2024-03-30] | 800 | 1200 | 1500 | 1800 | 2200 | 2400 | 2800 | 2700 | 3400 | | [user:priyanshu.p,2024-03-30] | 800 | 1200 | 1300 | 1600 | 2200 | | | | | | [user:thescrasse,2024-03-30] | 800 | 1200 | 1400 | 1700 | 2100 | 2300 | 2900 | 2900 | 3500 | | [user:cry,2024-03-30] | 800 | 1000 | 1300 | 1700 | 2100 | 2200 | 2800 | 2900 | 3500 | | [user:buffering,2024-03-30] | 800 | 1000 | 1500 | 1900 | 2100 | 2200 | 2700 | 2800 | 3500 | | [user:jaggubandar,2024...
| 811 | 1189 | 1455 | 1810 | 2100 | 2273 | 2709 | 2770 | 3463 | | Actual | 800, | | | | | | [user:thescrasse,2024-03-30] | 800 | 1200 | 1400 | 1700 | 2100 | 2300 | 2900 | 2900 | 3500

Full text and comments »

  • Vote: I like it
  • +143
  • Vote: I do not like it

126.
Codeforces Round 1051 (Div. 2)
By LucaLucaM, 14 months ago, In English
Codeforces Round 1051 (Div. 2) Hello, Codeforces! Or, as we like to say in Romania: *Poți să îmi dai link la rundă în privat să testez?* We are proud to invite you to [contest:2143], which will be held on [contest_time:2143]. 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-7 problems**, one of which will be divided into a subtask, and **2 hours** to solve them. The problems were authored by [user:anpaio,2025-09-15], [user:tvladm,2025-09-15], [user:MateiKing80,2025-09-15] and by yours truly. We would like to thank: - [user:ntherner,2025-07-07] and [user:Vladithur,2025-07-07] for coordinating the round, - ~rolandpetrean,2025-09-15 ~waipoli,2025-09-15 ~Turcavid,2025-09-15 ~tibinyte2006,2025-09-15 ~_istil,2025-09-15 ~Tudy006,2025-09-15 ~mircea_007,2025-09-15 ~madlogic,2025-09-15 ~Non-origination,2025-09-15 ~AlanSkarica,2025-09-15 ~ToniB,2025-09-15 ~andrei_C1,2025-09-15 ~AleXutzZu...
The round will be rated for participants whose rating is **below 2100**, but higher rated users are

Full text and comments »

  • Vote: I like it
  • +405
  • Vote: I do not like it

127.
Educational Codeforces Round 110 [Rated for Div. 2]
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 110 [Rated for Div. 2] Hello Codeforces! On [contest_time:1535] [contest:1535] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2021-06-03] Glazov, Adilbek [user:adedalic,2021-06-03] Dalabaev, Vladimir [user:vovuh,2021-06-03] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +350
  • Vote: I do not like it

128.
Codeforces Round #876 (Div. 2)
By valerikk, history, 3 years ago, In English
Codeforces Round #876 (Div. 2) Привет, Codeforces! Я приглашаю вас принять участие в [contest:1839], который состоится [contest_time:1839]. Раунд будет рейтинговым для участников с рейтингом ниже 2100. Участники с более высоким рейтингом могут принять участие вне конкурса. Вам будет предложено 5 задач и 2 часа на их решение. Я рекомендую прочитать все задачи. Одна из задач будет интерактивной, поэтому, пожалуйста, прочитайте [руководство по интерактивным задачам](https://codeforces.me/blog/entry/45307) перед контестом. Все задачи были придуманы мной. Я хочу поблагодарить: - [user:Renatyss,2023-06-01] за помощь с подготовкой и обсуждение задач. - [user:IgorI,2023-06-01] за отличную координацию раунда. - [user:bashkort,2023-06-01], [user:Allvik06,2023-06-01], [user:Ormlis,2023-06-01], [user:satyam343,2023-06-01], [user:maomao90,2023-06-01], [user:Dominater069,2023-06-01], [user:Yuu,2023-06-01], [user:Kirill020708,2023-06-01], [user:asafiul,2023-06-01], [user:iliya_mon,2023-06-01], [user:sdyakonov...
The round will be rated for participants with rating lower than 2100. Participants with higher, Раунд будет рейтинговым для участников с рейтингом ниже 2100. Участники с более высоким рейтингом

Full text and comments »

  • Vote: I like it
  • +336
  • Vote: I do not like it

129.
Codeforces Round #551 (Div. 2)
By Serval, 8 years ago, In English
Codeforces Round #551 (Div. 2) Hi Codeforces! We are glad to invite you to our first Codeforces Round [contest:1153] which will be held on [contest_time:1153]. This round will be rated for participants with rating less than 2100. We will be glad to see participants from the first division to join out of competition as well! In this round, as the best friend of Serval's, you are going to help him to solve the problems he meets. The problems are prepared by [user:bzh,2019-04-12] and me. We hope you will enjoy the round. :P Great thanks to [user:300iq,2019-04-12] for coordination of this round, [user:isaf27,2019-04-12], [user:gritukan,2019-04-12], [user:KAN,2019-04-12], [user:mohammedehab2002,2019-04-12], [user:learner99,2019-04-12], [user:aleks5d,2019-04-12] and [user:Um_nik,2019-04-13] for testing our rounds, and [user:MikeMirzayanov,2019-04-12] for the amazing Codeforces and Polygon platforms. You will be given 6 problems to solve in 2 hours. Scoring distribution will be announced later. Please ...
[contest_time:1153]. This round will be rated for participants with rating less than2100. We will be glad

Full text and comments »

  • Vote: I like it
  • +490
  • Vote: I do not like it

130.
Educational Codeforces Round 152 [Rated for Div. 2]
By BledDest, history, 3 years ago, translation, In English
Educational Codeforces Round 152 [Rated for Div. 2] Hello Codeforces! On [contest_time:1849] [contest:1849] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours to solve them**. The problems were invented and prepared by Adilbek [user:adedalic,2023-07-26] Dalabaev, Mikhail [user:awoo,2023-07-26] Piklyaev, Maksim [user:Neon,2023-07-26] Mescheryakov and ...
This round will be **rated for the participants with rating lower than 2100**. It will be held on

Full text and comments »

  • Vote: I like it
  • +322
  • Vote: I do not like it

131.
Editorial for Codeforces Round #919 (Div. 2)
By sum, history, 3 years ago, In English
Editorial for Codeforces Round #919 (Div. 2) ##Information about the round <spoiler summary="Rating predictions (inspired by BucketPotato's editorial)"> | Person | A | B | C | D | E | F1 | F2 | |--------------------------------------------|------|------|------|------|------|------|------| | [user:sum,2024-01-13] | 800 | 1300 | 1500 | 1900 | 2000 | 2200 | 2900 | | [user:oursaco,2024-01-13] | 800 | 1100 | 1300 | 1600 | 1800 | 2100 | 3100 | | [user:omeganot,2024-01-13] | 900 | 1000 | 1400 | 1700 | 1900 | 2200 | 2800 | | [user:sriniv,2024-01-13] | | | | 1900 | 2000 | 1900 | | | [user:apple_method,2024-01-13] | 1000 | 1200 | 1400 | 1900 | 1600 | | | | [user:awesomeguy856,2024-01-13] | 800 | 1100 | 1400 | 1800 | 1900 | 2000 | 2800 | | [user:nonrice,2024-01-13] | 900 | 1000 | 1400 | 1750 | | | | | [user:null_aw...
| 1786 | 1900 | 2071 | 2867 | | Actual | 800 | 1100 | 1500 | 1800 | 2100 | 2500 | 3000, ] | 800 | 1100 | 1300 | 1600 | 1800 | 2100 | 3100 | | [user:omeganot,2024-01-13

Full text and comments »

  • Vote: I like it
  • +314
  • Vote: I do not like it

132.
Educational Codeforces Round 163 [Rated for Div. 2]
By awoo, history, 3 years ago, translation, In English
Educational Codeforces Round 163 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! We are pleased to announce a new long-term partnership between Codeforces and [Neapolis University Pafos](https://www.nup.ac.cy/). Now educational rounds will be supported by Neapolis University Pafos. Stay tuned and you will find out more soon. On [contest_time:1948] [contest:1948] will start. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +279
  • Vote: I do not like it

133.
Codeforces Round #546 (Div.2)
By DmitryGrigorev, history, 8 years ago, translation, In English
Codeforces Round #546 (Div.2) Hi, Codeforces! I`m glad to invite everybody to the #546 Codeforces round, which will be held [on Monday, March 11, 2019 at 19:35](https://www.timeanddate.com/worldclock/fixedtime.html?day=11&month=3&year=2019&hour=19&min=35&sec=0&p1=166). The round will be rated for all participants from the second division (with rating **below than 2100**). As usually, we will be glad to see participants from the first division out of competition! Problems for the round have been proposed by Fedor [user:osaaateiasavtnl.,2019-03-09] Ushakov, Stepan [user:IbragiMMamilov,2019-03-09] Stepkin, Alexey [user:usertab34,2019-03-09] Roze, Denis [user:Denisson,2019-03-09] Shpakovskij and Alexander [user:Ralsei,2019-03-09] Gladkov. The round have been prepared by us, Dmitry [user:DmitryGrigorev,2019-03-09] Grigoryev, Fedor [user:osaaateiasavtnl.,2019-03-09] Ushakov, Semyon [user:cookiedoth,2019-03-09] Savkin and Dmitry [user:TheWayISteppedOutTheCar,2019-03-09] Piskalov. We'd like to give thanks to I...
rating **below than 2100**). As usually, we will be glad to see participants from the first, есть для участников с рейтингом **меньше, чем 2100**). Как обычно, мы будем очень рады видеть всех

Full text and comments »

  • Vote: I like it
  • +454
  • Vote: I do not like it

134.
Codeforces Round 1014 (Div. 2)
By k1sara, 20 months ago, In English
Codeforces Round 1014 (Div. 2) <p> <h2>Xin Chào, Codeforces! (☆^ー^☆)</h2> </p> We are thrilled to invite you to participate in [contest:2092], which will be held on [contest_time:2092]. This round will be <b>rated for all participants with rating below 2100</b>. Participants with higher ratings are encouraged to participate out of the competition. You will be offered <b>6 problems and 2 hours</b> to solve them. The tasks were authored and written by [user:k1sara,2025-03-26] and [user:sergeev.PRO,2025-03-26]. We hope you enjoy the challenge! A heartfelt thank you to everyone who made this round a reality: - [user:244mhq,2025-03-26] and [user:Um_nik,2025-03-26] for expertly coordinating the contest and offering invaluable guidance throughout the process, - [user:makrav,2025-03-26], [user:zltzlt,2025-03-26], [user:IzhitskiyTimofey,2025-03-26], [user:sadness,2025-03-26], [user:Noinoiio,2025-03-26], [user:max0000561,2025-03-26], [user:Vash_nick,2025-03-26], [user:yunetive29,2025-03-26], [user:ahmet...
This round will be rated for all participants with rating below 2100. Participants with

Full text and comments »

  • Vote: I like it
  • +301
  • Vote: I do not like it

135.
Codeforces Round 1106 (Div. 2)
By Friendiks, 5 months ago, translation, In English
Codeforces Round 1106 (Div. 2) ### Привет, Codeforces! Мы рады объявить, что [contest:2238] пройдёт в [contest_time:2238]. Раунд будет рейтинговым для участников с рейтингом ниже $2100$. Вам будет предложено $6$ задач, на решение которых будет $2$ часа. Все задачи были придуманы и подготовлены [user:lewc,2026-06-25], [user:KotlechkovEgor,2026-06-25] и мной. Мы выражаем ОГРОМНУЮ благодарность следующим людям, без которых раунд не смог бы состояться: * [user:74TrAkToR,2026-06-25] за невероятную координацию. * [user:Um_nik,2026-06-25] и [user:244mhq,2026-06-25] за предварительное ревью раунда. * [user:zhiganov_v,2026-06-25], [user:wxhtzdy,2026-06-25], [user:JYJin,2026-06-25], [user:abc864197532,2026-06-26] и [user:OG_Matveychick1,2026-06-25] за красное тестирование раунда. * [user:XaRDKoDblCH,2026-06-25], [user:pskobx,2026-06-25], [user:Mark_Pr,2026-06-25] и [user:_lemur_,2026-06-25] за оранжевое тестирование раунда. * [user:_liravel_,2026-06-25], [user:mirach0ck,2026-06-25], [user:MaksimXD,2026-06-25],...
be rated for participants with rating below $2100$. You will be offered $6$ problems, with $2$ hours, участников с рейтингом ниже $2100$. Вам будет предложено $6$ задач, на решение которых будет $2$ часа.

Full text and comments »

  • Vote: I like it
  • +324
  • Vote: I do not like it

136.
CodeCraft-20 (Div. 2)
By shaanknight, history, 7 years ago, In English
CodeCraft-20 (Div. 2) Hello Codeforces! We are thrilled to invite you to [contest:1316], which is to take place on [contest_time:1316]. The contest is rated for all participants with ratings under 2100. The contest comes under the wing of **Threads '20**, the annual technical fest, a part of [Felicity, IIIT Hyderabad](https://felicity.iiit.ac.in/) . ![ ](https://i.imgur.com/ovAt5P3.jpg) Participants will be asked to solve **6** problems in **2 hours** . Scoring will be announced just before the contest . The problems were created by [user:gaurav172,2020-03-02], [user:naruhodou,2020-03-02], [user:preet_t,2020-03-02] and [user:shaanknight,2020-03-02] . We want to thank all the people for making this contest possible . - Our Coordinator [user:antontrygubO_o,2020-03-02] for the immense help and guidance. - All the testers of the round : [user:codelegend,2020-03-02], [user:aryanc403,2020-03-02], [user:_overrated_,2020-03-02], [user:FlowerOfSorrow,2020-03-02], [user:nvmdava,2020-03-02], [u...
contest is rated for all participants with ratings under 2100.

Full text and comments »

Announcement of CodeCraft-20 (Div. 2)
  • Vote: I like it
  • +432
  • Vote: I do not like it

137.
Codeforces Round 1000 (Div. 2) — Editorial
By chromate00, 22 months ago, In English
Codeforces Round 1000 (Div. 2) — Editorial <spoiler summary="Rating Predictions"> | Handles | A | B | C | D | E | F1 | F2 | | ---------------- | --- | ---- | ----------- | ----------- | ----------- | ---- | ----------- | | ~Proof_by_QED,2025-01-20 | 800 | 1000 | 1500 | 2200 | 2400 | 1800 | 2600 | | ~chromate00,2025-01-20 | 800 | 1100 | 1500 | 2100 | 2300 | 1800 | 2700 | | ~redpanda,2025-01-20 | 800 | 900 | 1400 | 2000 | 2400 | | | | ~larush,2025-01-20 | 800 | 1100 | 1600 | 2100 | | | | | ~FairyWinx,2025-01-20 | 800 | 900 | 1500 | 2000 | 2400 | 1800 | 2500 | | [user:priyanshu.p,2025-01-20] | 800 | 1200 | 1500 | 2000 | 2500 | 2000 | | | ~Intellegent,2025-01-20 | 800 | 1000 | 1400 | 2000 | 2200 | 2000 | 260...
| 2100 | 2300 | 1800 | 2700 | | ~redpanda,2025-01-20 | 800 | 900

Full text and comments »

  • Vote: I like it
  • +229
  • Vote: I do not like it

138.
Codeforces Round 1067 (Div. 2)
By kingmessi, 11 months ago, In English
Codeforces Round 1067 (Div. 2) <img src="/predownloaded/cc/cf/cccf1d602af8c092d82d3bc34ca8a2a4ac0582e8.gif" style="width:180px; float:right; margin-left:10px;"> Good day Codeforces &#x2728; ---------------------------- We are excited to invite you all to [contest:2158], starting at [contest_time:2158]. This round features **6 problems** to be scored in **2 hours**, with a few problems including multiple parts. All tasks were authored and prepared by [user:koderkushy,2025-11-28] and me. This round will be **rated for all participants with rating below 2100**. Take a look at all the problems, we hope you enjoy the challenge! &#x1F680; We extend many thanks to our team for helping make this round possible: - [user:abc864197532,2025-11-28] for his excellent coordination. - [user:KAN,2025-11-28] for preliminary review. - Testers lineup: [user:Dominater069,2025-11-28], [user:dreamoon_love_AA,2025-11-28], [user:Fysty,2025-11-28], [user:amano_hina,2025-11-28], [user:_istil,2025-11-28], [user:__baozii__,2...
will be **rated for all participants with rating below 2100**. Take a look at all the problems, we

Full text and comments »

  • Vote: I like it
  • +418
  • Vote: I do not like it

139.
Codeforces Round #769 (Div. 2)
By Igorfardoc, history, 5 years ago, In English
Codeforces Round #769 (Div. 2) #### Привет, Codeforces! Мы с [user:Vladithur,2022-01-28] рады представить вам наш [contest:1632], который пройдет в [contest_time:1632]. **Этот раунд будет рейтинговым для участников, чей рейтинг ниже, чем 2100.** Мы хотим выразить огромную благодарность: - [user:irkstepanov,2022-01-28] и [user:KAN,2022-01-28] за <strike>то, что они не отклоняли наши задачи</strike> великолепную координацию раунда и помощь в подготовке задач. - [user:Ormlis,2022-01-28], [user:antontrygubO_o,2022-01-28], [user:generic_placeholder_name,2022-01-28], [user:Alexdat2000,2022-01-28], [user:Dart-Xeyter,2022-01-28], [user:wxhtzdy,2022-01-28], [user:sohsoh,2022-01-28], [user:zer0brain,2022-01-28], [user:radal,2022-01-28], [user:dbsic211,2022-01-28], [user:stevancv,2022-01-28], [user:maxverr,2022-01-28], [user:Scrubpai,2022-01-28], [user:Artem1303,2022-01-28], [user:RomkaRomantic,2022-01-28] и [user:MaxShch,2022-01-28] за тестирование раунда и полезный фидбэк. - [user:MikeMirzayanov,2022-01-28] за круты...
rating lower than 2100.**, ниже, чем 2100.**

Full text and comments »

  • Vote: I like it
  • +394
  • Vote: I do not like it

140.
Codeforces Round #678 (Div. 2), основанный на финале Andersen Programming Contest 2020
By Vladik, 6 years ago, translation, In English
Codeforces Round #678 (Div. 2), основанный на финале Andersen Programming Contest 2020 <img alt="andersen" src="https://user-images.githubusercontent.com/1968460/94995698-b4bf1b80-05a8-11eb-8206-05370556b080.jpg" style="float:right; height: 200px; "/> <p>Привет, <span style="font-weight:bold">Code</span><span style="color:rgb(71,94,152);font-weight:bold">forces</span>!</p> Рад анонсировать и пригласить вас на [contest:1436], который пройдет [contest_time:1436]. Пару недель назад мы проводили [contest:1422] на основе задач [contest:297213], а в этот раз мы хотим предложить вам порешать лучшие 5-6 задач финала. **Обратите, пожалуйста, внимание на необычное время начала раунда. Этот раунд будет рейтинговым для участников, чей рейтинг ниже 2100.** Компания [Andersen](https://contest.andersenlab.com/) уже второй год проводит соревнование, которое в первую очередь предназначено для поддержки студентов региональных ВУЗов Беларуси и Украины (с этого года). В этом году в финале соревнования примет участие [60 студентов](http://apc2020.contest.codeforces.com/group/vBi...
with rating lower than 2100.**, участников, чей рейтинг ниже 2100.**

Full text and comments »

  • Vote: I like it
  • +278
  • Vote: I do not like it

141.
Educational Codeforces Round 86 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 86 [Rated for Div. 2] Hello Codeforces! On [contest_time:1342] [contest:1342] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-04-25] Glazov, Adilbek [user:adedalic,2020-04-25] Dalabaev, Vladimir [user:vovuh,2020-04-25] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +336
  • Vote: I do not like it

142.
Codeforces rating deflation
By Christine-, history, 5 months ago, In English
Codeforces rating deflation <div align="right"> <table> <tr> <td align="left"><em> &mdash; You know what they call an International Grandmaster in 2026?<br> &mdash; They don't call it an International Grandmaster?<br> &mdash; No, man, they got the AI there, they wouldn't know what International Grandmaster is.<br> &mdash; What'd they call it?<br> &mdash; They call it International Master. </em></td> </tr> </table> </div> ### Introduction There was a heated discussion recently, and I decided to quantify the rating deflation over the recent 1.5 years. After accounting for natural improvement, I found roughly 150-190 rating points of deflation. The following is the rating gap between AI period and pre-AI period. ![Codeforces rating deflation](/predownloaded/f1/e2/f1e24c6c9cec1abfe4ba887e365f6ae049260df9.png) ### Background - We need to estimate the recent rating dynamics and compare it with pre-AI dynamics. - Participants have natural improvement when they train, especially lower rated...

Full text and comments »

  • Vote: I like it
  • +202
  • Vote: I do not like it

143.
Codeforces Round #897 (Div. 2)
By salyg1n, 3 years ago, translation, In English
Codeforces Round #897 (Div. 2) Hello, Codeforces! &#129327; [user:green_gold_dog,2023-09-11], [user:ace5,2023-09-09], [user:bashkort,2023-09-09] and I [user:salyg1n,2023-09-09] are pleased to invite you to participate in [Codeforces Round 897 (Div. 2)](https://codeforces.me/contest/1867 ), which will take place on [Monday, September 11, 2023 in 17:35](https://www.timeanddate.com/worldclock/fixedtime.html?day=11&month=9&year=2023&hour=17&min=35&sec=0&p1=166). This round will be **rated** for participants whose **rating is below 2100**. You will be given 6 tasks and 2 hours to solve them. We recommend reading all the tasks. **Interactive tasks may occur in the round**, so we suggest reading this [post] (https://codeforces.me/blog/entry/45307 ). We want to thank: - [user:Aleks5d,2023-09-09] for coordinating the round and improving one of the tasks. &#129299; - [user:Allvik06,2023-09-09], [user:Nutella3000,2023-09-09], [user:arbuzick,2023-09-09], [user:alegsandyr,2023-09-09], [user:maomao90,2023-09-0...
This round will be **rated** for participants whose **rating is below 2100**., Этот раунд будет **рейтинговым** для участников, чей **рейтинг ниже 2100**. Участники с более

Full text and comments »

  • Vote: I like it
  • +280
  • Vote: I do not like it

144.
Codeforces Round #843 (Div. 2)
By Wind_Eagle, history, 4 years ago, translation, In English
Codeforces Round #843 (Div. 2) <a href="https://ibb.co/whxngNB"><img src="https://i.ibb.co/1GwCQf7/38-20230104210158.png" alt="38-20230104210158" border="0"></a> Привет, Codeforces! Я очень рад пригласить вас на [Codeforces Round #843 (Div. 2)](https://codeforces.me/contest/1775), который пройдет в [contest_time:1775]. <b>Этот раунд будет рейтинговым для участников, чей рейтинг ниже, чем 2100.</b> Моя искренняя благодарность: - [user:KAN,2023-01-08] и [user:aleks5d,2023-01-08] за выдающуюся координацию раунда! - [user:Wind_Eagle,2023-01-08], [user:BaluconisTima,2023-01-08], [user:kartel,2023-01-08] и [user:aleks5d,2023-01-08] за идеи задач для раунда, а также [user:Wind_Eagle,2023-01-08], [user:BaluconisTima,2023-01-08], [user:kartel,2023-01-08], [user:VEGAnn,2023-01-08] и [user:Vladik,2023-01-08] за разработку задач. - [user:andrew,2023-01-08], [user:gepardo,2023-01-08], [user:244mhq,2023-01-08], [user:vilcheuski,2023-01-08] &mdash; остальную команду авторов области, без которых этот раунд бы не ...
participants with rating lower than 2100., ниже, чем 2100.

Full text and comments »

  • Vote: I like it
  • +309
  • Vote: I do not like it

145.
Codeforces Round 1034 (Div. 3) Editorial
By reirugan, 16 months ago, In English
Codeforces Round 1034 (Div. 3) Editorial I hope you all enjoyed the contest! <spoiler summary="Rating Predictions"> | Predictor | A | B | C | D | E | F | G | |------------------------------------|--------|--------|--------|--------|--------|--------|--------| | [user:AksLolCoding,2025-07-01] | 800 | 900 | 1000 | 1500 | 1500 | 1800 | 1700 | | [user:__baozii__,2025-07-01] | 800 | 800 | 1200 | 1500 | 1500 | 1600 | 1900 | | [user:DivinePunishment,2025-07-01] | 800 | 900 | 1100 | 1400 | 1500 | 1600 | 1900 | | [user:Edeeva,2025-07-01] | 800 | 800 | 1000 | 1200 | 1600 | 1800 | 2200 | | [user:efishel,2025-07-01] | 800 | 800 | 1000 | 1200 | 1400 | 1500 | 1900 | | [user:-firefly-,2025-07-01] | 800 | 800 | 900 | 1400 | 1500 | 1700 | 2000 | | [user:hashman,2025-07-01] | 800 | 900 | 1100 | 1600 | 1500 | 1800 | ...
| 1000 | 1300 | 1600 | 1700 | 2100 | | [user:macaquedev,2025-07-01] | 800

Full text and comments »

  • Vote: I like it
  • +292
  • Vote: I do not like it

146.
Educational Codeforces Round 84 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 84 [Rated for Div. 2] Hello Codeforces! On [contest_time:1327] [contest:1327] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-03-22] Glazov, Adilbek [user:adedalic,2020-03-22] Dalabaev, Vladimir [user:vovuh,2020-03-22] Petrov, Ivan [user:Bl...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +344
  • Vote: I do not like it

147.
Codeforces Round #771 (Div. 2)
By atodo, 5 years ago, In English
Codeforces Round #771 (Div. 2) Hello, Codeforces! I am happy to invite you to [contest:1638], which will take place on [contest_time:1638]. **The round will be rated for participants with rating lower than 2100.** You will have **2 hours** to solve **6 problems**. The problems were authored and prepared by me. I would like to thank the following people who made the round possible: - [user:Artyom123,2022-02-13] for coordination, help in problem preparation and translating the statements. - [user:KAN,2022-02-13] for helping with round preparation. - [user:geniucos,2022-02-13] and [user:spatarel,2022-02-13] for discussing problems with me way before the round was proposed. - [user:gamegame,2022-02-13], [user:Kirill22,2022-02-13], [user:AlexLuchianov,2022-02-13], [user:Monogon,2022-02-13], [user:wxhtzdy,2022-02-13], [user:generic_placeholder_name,2022-02-13], [user:BlueDiamond,2022-02-13], [user:Devil,2022-02-13], [user:Ziware,2022-02-13], [user:Utkarsh.25dec,2022-02-13], [user:TeaTime,2022-02-13], [user:...
round will be rated for participants with rating lower than 2100.** You will have **2 hours** to solve

Full text and comments »

  • Vote: I like it
  • +661
  • Vote: I do not like it

148.
Educational Codeforces Round 151 [Rated for Div. 2]
By awoo, history, 3 years ago, translation, In English
Educational Codeforces Round 151 [Rated for Div. 2] Hello Codeforces! On [contest_time:1845] [contest:1845] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="https://mirror.codeforces.com/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2023-06-28] Dalabaev, Ivan [user:BledDest,2023-06-28] Androsov, Maksim [user:Neon,2023-06-28] Mesch...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +245
  • Vote: I do not like it

149.
Codeforces Round #877 (Div. 2)
By jdurie, 3 years ago, In English
Codeforces Round #877 (Div. 2) Hi, Codeforces! I welcome everyone to participate in [contest:1838], which will start on [contest_time:1838]. The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1 participants can participate unofficially in the round. You will be given 6 problems and 2 hours to solve them. One of the problems will be interactive, so please read [this guide](https://codeforces.me/blog/entry/45307) if you are not familiar with interactive problems. The score distribution will be 500 &mdash; 1000 &mdash; 1250 &mdash; 1750 &mdash; 2250 &mdash; 3000. All problems were created and prepared by me. I would like to thank: - [user:ScarletS,2023-05-23] and [user:KAN,2023-05-23] for coordinating the round - [user:Alexdat2000,2023-06-04] for translating statements to Russian - [user:AggravatedCow,2023-05-23], [user:ak2006,2023-05-23], [user:akifpatel,2023-05-23], [user:Awesome3.14,2023-05-23], [user:BucketPotato,2023-05-23], [user:dbaumg,2023-05-2...
The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1

Full text and comments »

  • Vote: I like it
  • +274
  • Vote: I do not like it

150.
Codeforces Round 1083 (Div. 2)
By Leftist_G, 9 months ago, In English
Codeforces Round 1083 (Div. 2) #### 你好, Codeforces! <img src="/predownloaded/ee/40/ee40e93b2b5e01607ec07e0bea1ff7d7c2dadfaf.png" style="width: 300.0px;float: right;margin: 0 1.0em 1.0em 1.0em;max-width: 100.0%;max-height: 100.0%;"> We (DBOI Team) are very glad to invite you to participate in [contest:2205], starting at [contest_time:2205]. There will be **7 problems** for you to solve in **2 hours and 30 minutes**. All problems were authored and prepared by [user:cool_milo,2026-02-19], [user:StayAlone,2026-02-19] and me. This round will be rated for all participants with **rating below 2100**. I would like to thank the following list of very strong individuals for making this round possible: - [user:Error_Yuan,2026-02-19] for the excellent coordination and for making problems better. - [user:Alexdat2000,2026-02-19] for Russian translation. - [user:CTHOOH,2026-02-19], [user:LiHn,2026-02-19], [user:Angelic717,2026-02-19], [user:StayAlone,2026-02-19] and me for providing some rejected problems. - All ...
will be rated for all participants with **rating below 2100**.

Full text and comments »

  • Vote: I like it
  • +377
  • Vote: I do not like it

151.
Codeforces Round #940 and CodeCraft-23 (Div. 2)
By fangahawk, 3 years ago, In English
Codeforces Round #940 and CodeCraft-23 (Div. 2) ## Hello Codeforces! We're glad to invite everyone to participate in [contest:1957], which will start on [contest_time:1957]. The contest will be rated for all the Div. 2 participants (Rating < 2100). The [Programming Club at IIIT-H](https://iiit-programming-club.github.io/) organizes this event as a part of our techno-cultural fest Felicity @ IIIT Hyderabad. ![Programming Club at IIIT-H](/predownloaded/59/ef/59ef041bd6932a30f783be7beb8fadaa01120bd6.png) You will have 6 problems to solve in the duration of <s>2 hours</s> 2 hours and 15 minutes. One of the problems is divided into 2 subtasks. Do ensure you read all of the problems! There have been a bunch of people that have helped us in making this contest a (hopefully) great one! - [user:ScarletS,2023-12-01] and [user:KAN,2024-04-18] for their wonderful coordination. - [user:Alexdat2000,2022-07-17] for translating the problem statements to Russian. - [user:akcube,2024-04-18], [user:fangahawk,2024-04-18], [user:Geng...
:1957]. The contest will be rated for all the Div. 2 participants (Rating < 2100 ).

Full text and comments »

  • Vote: I like it
  • +373
  • Vote: I do not like it

152.
Codeforces Round 1030 (Div. 2)
By szilb, 17 months ago, In English
Codeforces Round 1030 (Div. 2) Üdv, Codeforces! [user:Error-42,2025-06-10], [user:gortomi,2025-06-10] and I are glad to invite everyone to participate in [contest:2118], which will be held on [contest_time:2118]. You will be given 6 problems and 1 subtask with 2 hours to solve them. The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1 participants can participate unofficially. All problems are authored by [user:Error-42,2025-06-10], [user:gortomi,2025-06-10] and me. We would like to thank: - [user:satyam343,2025-06-10] for their amazing coordination and for rejecting our bad ideas ${\color{white}{\text{and several other problems too.}}}$ - [user:peti1234,2025-06-10] for their LGM opinion. - [user:Alexdat2000,2025-06-10] for the Russian translations. - [user:N_z__,2025-06-10], [user:Error_Yuan,2025-06-10], [user:_istil,2025-06-10], [user:busamate,2025-06-10], [user:andrei_boaca,2025-06-10], [user:Dominater069,2025-06-10], [user:nifeshe,2025-06-10] fo...
The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1

Full text and comments »

  • Vote: I like it
  • +311
  • Vote: I do not like it

153.
Educational Codeforces Round 142 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 142 [Rated for Div. 2] Hello Codeforces! On [contest_time:1792] [contest:1792] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2023-01-23] Dalabaev, Vladimir [user:vovuh,2023-01-23] Petrov, Ivan [user:BledDest,2023-01-23] Androsov, Ma...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +222
  • Vote: I do not like it

154.
Codeforces Round 998 (Div. 3) Editorial
By cry, 22 months ago, In English
Codeforces Round 998 (Div. 3) Editorial <spoiler summary="Rating Predictions"> | Predictor | A | B | C | D | E | F | G | |--------------------------------------------|------|------|------|------|------|------|------| | [user:Proof_By_QED,2025-01-15] | 800 | 1000 | 1100 | 1300 | 1600 | 1900 | 2400 | | [user:cry,2025-01-15] | 800 | 1000 | 1000 | 1200 | 1700 | 2000 | 2400 | | [user:chromate00,2025-01-15] | 800 | 1000 | 1000 | 1400 | 1700 | 2000 | 2400 | | [user:DivinePunishment,2025-01-15] | 800 | 1200 | 1100 | 1200 | 1700 | 2000 | 2300 | | [user:-firefly-,2025-01-15] | 800 | 1000 | 1000 | 1400 | 1800 | 2000 | 2400 | | [user:Error_Yuan,2025-01-15] | 800 | 1100 | 1200 | 1600 | 1800 | 2100 | 2400 | | [user:macaquedev,2025-01-15] | 800 | 1000 | 1500 | 1400 | 1300 | 2000 | 1900 | | [user:In...
-01-15] | 800 | 1100 | 1200 | 1600 | 1800 | 2100 | 2400

Full text and comments »

  • Vote: I like it
  • +126
  • Vote: I do not like it

155.
Codeforces Round #862 (Div. 2)
By Alexdat2000, 4 years ago, translation, In English
Codeforces Round #862 (Div. 2) Привет всем на Codeforces.com! В этом раунде я ([user:Alexdat2000,2023-04-01]) и двое моих друзей &mdash; [user:FairyWinx,2023-04-01] и [user:Sevlll777,2022-06-03] &mdash; подготовили для вас **6 задач** (одна из которых разбита на две подзадачи), а у вас будет **2 часа** на их решение. Приглашаем всех перейдите по ссылке: [contest:1805] в [contest_time:1805]. **Этот раунд будет рейтинговым для всех участников с рейтингом строго меньше 2100.** А теперь несколько благодарностей: - Спасибо [**<font color="#ff0000">[Coordinator] pashka</font>**](https://codeforces.me/profile/pashka) за координацию и помощь в поиске тестеров - Особое спасибо [**<font color="#ff0000">[G.O.A.T.] Mangooste</font>**](https://codeforces.me/profile/Mangooste) за обсуждение задач и тестирование - Спасибо всем тестерам: [**<font color="#000000">[MVP</font><font color="#ff0000">++</font><font color="#000000">] Ormlis</font>**](https://codeforces.me/profile/Ormlis), [**<font color="#ff0000">[...
with a rating of strictly less than 2100.**, строго меньше 2100.**

Full text and comments »

  • Vote: I like it
  • +362
  • Vote: I do not like it

156.
Educational Codeforces Round 143 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 143 [Rated for Div. 2] Hello Codeforces! On [contest_time:1795] [contest:1795] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2023-02-15] Dalabaev, Vladimir [user:vovuh,2023-02-15] Petrov, Ivan [user:BledDest,2023-02-15] Androsov, Ma...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +242
  • Vote: I do not like it

157.
Educational Codeforces Round 180 [Rated for Div. 2]
By awoo, history, 17 months ago, translation, In English
Educational Codeforces Round 180 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Neapolis University Pafos](https://www.nup.ac.cy/). They offer a BSc in Computer Science and AI with [JetBrains Scholarships] (https://lp.jetbrains.com/academy/csai-program/). Gain cutting-edge skills in AI and machine learning, preparing you for high-demand tech careers. Curious? Check out the [CSAI curriculum] (https://drive.google.com/file/d/19I776O8NG07ie2Q14wwBspuh3De4kbHc/view). Limited scholarships available &mdash; don't miss your chance to study in Europe for free! On [contest_time:2112] [contest:2112] will start. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a ful...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +487
  • Vote: I do not like it

158.
Educational Codeforces Round 48 [Rated for Div. 2]
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 48 [Rated for Div. 2] On [contest_time:1016] Educational Codeforces Round 48 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM ICPC rules. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Ivan [user:BledDest,2018-08-02] Androsov, Roman [user:Ajosteen,2018-08-02] Glazov, Adilbek [user:adedalic,2018-08-02] Dalabaev, Vladimir [user:Vovuh,2018-08-02] Petrov and me. Good luck to all participants! Congratulations to th...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +234
  • Vote: I do not like it

159.
CodeCraft-22 and Codeforces Round #795 (Div 2.)
By amul_agrawal, 4 years ago, In English
CodeCraft-22 and Codeforces Round #795 (Div 2.) **Namaste Codeforces!** We are excited to invite everyone to **CodeCraft-22** which will take place on [contest_time:1691]. It is rated for all people who are below **<font color="#ff8c00">yellow</font>**! (rating under 2100) The [**Programming Club at IIIT-H**](https://iiit-programming-club.github.io/) organizes this event under Threads'22, as a part of our techno-cultural fest [**Felicity, IIIT Hyderabad**](http://felicity.iiit.ac.in). <img src="/predownloaded/91/7b/917ba5fc64144c1effe15bd932cfb39dab2f7fda.png" width="400px"> There are **6** Problems with **2 hours** to solve them. The scoring distribution will be released soon! We have worked hard to keep the statements clean and the pretests strong! After the contest, **step-wise tutorial** and **video tutorial** will be released along with the code! - This round was wonderfully co-ordinated by [user:darkkcyan,2022-05-27] and [user:KAN,2022-05-27] orz! - This round was a joint effort by [user:rahulgoel,2022-05-...
2100)

Full text and comments »

  • Vote: I like it
  • +386
  • Vote: I do not like it

160.
Codeforces Round #696 (Div. 2)
By IgorI, history, 6 years ago, translation, In English
Codeforces Round #696 (Div. 2) Hi, Codeforces! Я рад пригласить Вас на [Codeforces Round #696](https://codeforces.me/contests/1474), который состоится во [contest_time:1474]. **Раунд будет рейтинговым для всех участников с рейтингом меньше $2100$.** Участники из первого дивизиона могут принять участие вне конкурса. Вам будет предложено $6$ задач на $2$ часа. Все задачи раунда придуманы мной. Спасибо [user:adedalic,2021-01-17] за замечательную координацию раунда и [user:MikeMirzayanov,2021-01-17] за системы Codeforces и Polygon. Также благодарю тестеров [user:awoo,2021-01-17], [user:errorgorn,2021-01-17], [user:khiro,2021-01-17], [user:rkm62,2021-01-17], [user:AmShZ,2021-01-17], [user:IaMaNanBord,2021-01-17], [user:Osama_Alkhodairy,2021-01-17], [user:Prakash11,2021-01-17], [user:HIS_GRACE,2021-01-17], [user:Gauravvv,2021-01-17], [user:Dragnoid99,2021-01-18] за тестирование раунда и полезные комментарии к задачам. Разбалловка: $500-1000-1500-2000-2250-3000$. Всем удачи! **UPD:** [Разбор](https://cod...
less than $2100$.** Participants from the first division can take part out of competition., состоится во [contest_time:1474]. **Раунд будет рейтинговым для всех участников с рейтингом меньше $2100

Full text and comments »

  • Vote: I like it
  • +614
  • Vote: I do not like it

161.
Codeforces Round #983 (Div. 2)
By Sagita_Phoenix, history, 2 years ago, In English
Codeforces Round #983 (Div. 2) ### Hello Codeforces! $\newline$ <spoiler summary="From AkiLotus"> > "<span style="color: red">K</span>aleidoscopic, this place still is. How long have I been away...?" Hi. Akik<span style="color: red">a</span>ze a.k.a. AkiLotus here. Four years have passed, lo<span style="color: red">n</span>g enou<span style="color: red">g</span>h huh? I h<span style="color: red">o</span>pe that after all these times, I am not too rusty to set good tas<span style="color: red">k</span>s for yo<span style="color: red">u</span> to enjoy, starting with <span style="color: red">t</span>his <span style="color: red">o</span>ne! <strong>See yo<span style="color: red">u</span> in the round!</strong> <span style="color: #ec3e9d"><i>"Waeeguyehy" is coming soon.</i></span> </spoiler> It's been a while, today [user:AkiLotus,2024-07-29] and I are delighted to invite you to participate in [contest:2032]. This round will be <strong>rated</strong> for all participants with a rating lower than <...
lower than 2100.

Full text and comments »

  • Vote: I like it
  • +429
  • Vote: I do not like it

162.
Educational Codeforces Round 115 [Rated for Div.2]
By BledDest, 5 years ago, In English
Educational Codeforces Round 115 [Rated for Div.2] Hello Codeforces! On [contest_time:1598] [contest:1598] will start. **Note that the start time is unusual**. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Alex [user:fcspartakm,2021-10-09] Frolov, Mikhail [user:awoo,2021-10-09] Piklyaev, Max [...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +310
  • Vote: I do not like it

163.
Educational Codeforces Round 98 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 98 [Rated for Div. 2] Hello Codeforces! On [contest_time:1452] [contest:1452] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-11-18] Glazov, Adilbek [user:adedalic,2020-11-18] Dalabaev, Vladimir [user:vovuh,2020-11-18] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +272
  • Vote: I do not like it

164.
Educational Codeforces Round 111 [Rated for Div. 2]
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 111 [Rated for Div. 2] Hello Codeforces! On [contest_time:1550] [contest:1550] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2021-07-13] Dalabaev, Vladimir [user:vovuh,2021-07-13] Petrov, Ivan [user:BledDest,2021-07-13] Androsov, Mak...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +289
  • Vote: I do not like it

165.
Codeforces Round 1081 (Div. 2)
By Jamshed11, 9 months ago, In English
Codeforces Round 1081 (Div. 2) Hello Codeforces !!! I am very excited to invite you to participate in [Codeforces Round 1081](https://codeforces.me/contests/2192), which will be held on [contest_time:2192]! You will be given **$\mathbf{2}$ hours** to solve **$\mathbf{6}$ problems**. This round will be rated for all participants with **rating below 2100**. This is my first time hosting an official Codeforces round, and all the problems are authored by me. I hope you will enjoy the round. This round would not be possible without the help of the following people: - [user:Proof_by_QED,2026-02-18] for excellent coordination and improving the problems. - [user:flamestorm,2026-02-18] and [user:ScarletS,2026-02-18] for initial coordination of the round. - [user:Alexdat2000,2026-02-18] for russian statement translation. - All the testers for testing and sharing valuable feedback: [user:__baozii__,2026-02-18], [user:YuukiS,2026-02-18], [user:N_z__,2026-02-18], [user:sammyuri,2026-02-18], [user:Ari,2026-02-18],...
2100**.

Full text and comments »

  • Vote: I like it
  • +362
  • Vote: I do not like it

166.
Educational Codeforces Round 155 [Rated for Div. 2]
By awoo, history, 3 years ago, translation, In English
Educational Codeforces Round 155 [Rated for Div. 2] Hello Codeforces! On [contest_time:1879] [contest:1879] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="https://mirror.codeforces.com/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2023-09-23] Dalabaev, Ivan [user:BledDest,2023-09-23] Androsov, Maksim [user:Neon,2023-09-23] Mesch...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +245
  • Vote: I do not like it

167.
Codeforces Round 1019 (Div. 2)
By Blagoj, 19 months ago, In English
Codeforces Round 1019 (Div. 2) Hello, Codeforces! [user:NemanjaSo2005,2025-4-15] and I are glad to invite you to [contest:2103], which will start on [contest_time:2103]. You will be given **6** problems and **2** hours to solve them. The round will be rated for participants of Division 2 with a rating lower than **2100**. Division 1 participants can participate unofficially. All problems are invented and prepared by [user:NemanjaSo2005,2025-4-15] and me. We would like to thank: - [user:MikeMirzayanov,2025-4-15] for the Codeforces and Polygon platforms! - [user:maomao90,2025-4-15] for his great coordination of the round! - [user:Alexdat2000,2025-4-15] for helping translate the round! - [user:prvocislo,2025-04-19] for being the MVT (Most Valuable Tester)! - [user:A_G,2025-4-15] for nutella testing! - [user:milisav,2025-4-15], [user:N_z__,2025-4-15], [user:_istil,2025-4-15], [user:TimDee,2025-4-15], [user:culver0412,2025-4-15] and [user:Error_Yuan,2025-4-15] for red testing! - [user:Pe...
The round will be rated for participants of Division 2 with a rating lower than **2100**. Division

Full text and comments »

  • Vote: I like it
  • +337
  • Vote: I do not like it

168.
Educational Codeforces Round 145 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 145 [Rated for Div. 2] Hello Codeforces! On [contest_time:1809] [contest:1809] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2023-03-19] Dalabaev, Ivan [user:BledDest,2023-03-19] Androsov, Maksim [user:Neon,2023-03-19] Mescheryakov ...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +226
  • Vote: I do not like it

169.
Educational Codeforces Round 114 [Rated for Div. 2]
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 114 [Rated for Div. 2] Hello Codeforces! On [contest_time:1574] [contest:1574] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2021-09-19] Dalabaev, Vladimir [user:vovuh,2021-09-19] Petrov, Ivan [user:BledDest,2021-09-19] Androsov, Mak...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +281
  • Vote: I do not like it

170.
Educational Codeforces Round 102 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 102 [Rated for Div. 2] Hello Codeforces! On [contest_time:1473] [contest:1473] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2021-01-13] Glazov, Adilbek [user:adedalic,2021-01-13] Dalabaev, Vladimir [user:vovuh,2021-01-13] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +292
  • Vote: I do not like it

171.
Codeforces Round 856 (Div. 2)
By MateoCV, 4 years ago, In English
Codeforces Round 856 (Div. 2) Hola Codeforces! I am happy to invite you to [contest:1794], which will take place on [contest_time:1794]. **Notice the unusual time!** **The round will be rated for participants with rating lower than 2100.** You will have **2 hours** to solve **5 problems**. The problems were authored and prepared by me. I would like to thank the following people who made the round possible: - [user:pashka,2023-03-01] for coordination, help in problem preparation and translating the statements. - [user:errorgorn,2023-03-03], [user:mjhun,2023-03-03], [user:BucketPotato,2023-03-03], [user:darkkcyan,2023-03-03], [user:MarcosK,2023-03-03], [user:CodigoL,2023-03-03], [user:perdu,2023-03-03], [user:AngrySeal,2023-03-03], [user:SebaMarin,2023-03-03], [user:Crazypy,2023-03-03], [user:CarusoX,2023-03-03], [user:alwyn,2023-03-03], [user:khangai11,2023-03-03], [user:Byakko,2023-03-03], [user:rchaves,2023-03-03], [user:chickensqaure,2023-03-03], [user:YOK,2023-03-03], [user:rekomodo,2023-03-03], [user...
the unusual time!** **The round will be rated for participants with rating lower than2100.** You

Full text and comments »

  • Vote: I like it
  • +605
  • Vote: I do not like it

172.
Codeforces Round #622 (Div. 2)
By ch_egor, 7 years ago, translation, In English
Codeforces Round #622 (Div. 2) Всем привет! В это воскресенье пройдет <a href="http://mos-inf.olimpiada.ru">московская олимпиада школьников по программированию для 6-9 классов</a>. Над туром работала Московская методическая комиссия, известная вам также по Открытой олимпиаде школьников по программированию, Московской командной олимпиаде и олимпиаде Мегаполисов (раунды <a href="https://codeforces.me/blog/entry/21185">327</a>, <a href="https://codeforces.me/blog/entry/23309">342</a>, <a href="https://codeforces.me/blog/entry/43615">345</a>, <a href="https://codeforces.me/blog/entry/47769">376</a>, <a href="https://codeforces.me/blog/entry/50613">401</a>, <a href="https://codeforces.me/blog/entry/54350">433</a>, <a href="https://codeforces.me/blog/entry/55201">441</a>, <a href="https://codeforces.me/blog/entry/57981">466</a>, <a href="https://codeforces.me/blog/entry/58229">469</a>, <a href="https://codeforces.me/blog/entry/61638">507</a>, <a href="https://codeforces.me/blog/entry/62440">516</a>, <a href=...
будет рейтинговым для второго дивизиона (рейтинг ниже 2100). Как обычно, участники из первого дивизиона, . Round will be rated for second division (rating below 2100). As usual, participants from the first

Full text and comments »

Tags 622
  • Vote: I like it
  • +197
  • Vote: I do not like it

173.
Codeforces Round #785 (Div. 2)
By JaySharma1048576, 5 years ago, In English
Codeforces Round #785 (Div. 2) Hello Codeforces, I invite you to participate in [contest:1673] which will be held on [contest_time:1673]. **The round will be rated for participants of Division 2 with rating strictly less than 2100**. But as always, the participants of Division 1 are welcome to take part out of competition. You will be given **6 problems** and **2 hours** to solve them. Moreover, there will be atleast $1$ and atmost $1048576$ interactive problems. So, you are advised to refer to the [guide on interactive problems](https://codeforces.me/blog/entry/45307) in case you are not familiar with them. I would like to thank the following people for their contribution to the round: - [user:Artyom123,2022-04-28] for his amazing coordination, helping me throughout the preparation of the round and translating the statements. - [user:Um_nik,2022-04-28], [user:Monogon,2022-04-28], [user:kclee2172,2022-04-28], [user:TheScrasse,2022-04-28], [user:yash_daga,2022-04-28], [user:Sad_reacts_only,2022-04-28], ...
round will be rated for participants of Division 2 with rating strictly less than2100**. But as always

Full text and comments »

  • Vote: I like it
  • +369
  • Vote: I do not like it

174.
Codeforces Round 924 (Div. 2)
By Artyom123, history, 3 years ago, In English
Codeforces Round 924 (Div. 2) Hello, Codeforces! We're glad to invite you to take part in [contest:1928], which will start on [contest_time:1928]. You will be given **6 problems** and **2 hours** to solve them. This round will be **rated** for participants whose rating is **below 2100**. Participants with higher rating can participate unofficially. The problems were authored and prepared by [user:vaaven,2024-02-08], [user:silvvasil,2024-02-08], [user:Alexdat2000,2024-02-08], [user:teraqqq,2024-02-08] and me. The round is based on Moscow Olympiad for school students. We would like to thank - [user:TheScrasse,2024-02-08] for his high-speed coordination; - [user:nor,2024-02-08], [user:Wizard_of_Orz,2024-02-08], [user:GreatEagle,2024-02-08], [user:rolandpetrean,2024-02-08], [user:volochai,2024-02-08], [user:A_G,2024-02-08], [user:Wobert,2024-02-08], [user:--tofu--,2024-02-08], [user:-is-this-fft-,2024-02-08], [user:jamesbamber,2024-02-08], [user:franv,2024-02-08], [user:MatteoArcari,2024-02-08], [user:s...
This round will be **rated** for participants whose rating is **below 2100**. Participants with

Full text and comments »

  • Vote: I like it
  • +504
  • Vote: I do not like it

175.
Educational Codeforces Round 194 [rated for Div. 2]
By BledDest, 2 months ago, translation, In English
Educational Codeforces Round 194 [rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 150px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Neapolis University Pafos](https://www.nup.ac.cy/). [contest:2260] will start on [contest_time:2260]. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. I hope everyone participating finds interesting problems for them to solve. I would like to express my gratitude to Mike [user:MikeMirzayanov,2026-09-06] Mirzayanov for creating Cod...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +214
  • Vote: I do not like it

176.
Educational Codeforces Round 108 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 108 [Rated for Div. 2] Hello Codeforces! On [contest_time:1519] [contest:1519] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2021-04-28] Glazov, Adilbek [user:adedalic,2021-04-28] Dalabaev, Vladimir [user:vovuh,2021-04-28] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +279
  • Vote: I do not like it

177.
Educational Codeforces Round 71 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 71 [Rated for Div. 2] Hello Codeforces! On [contest_time:1207] [contest:1207] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2019-08-06] Glazov, Adilbek [user:adedalic,2019-08-06] Dalabaev, Vladimir [user:Vovuh,2019-08-06] Petrov, Ivan [user:Bl...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +258
  • Vote: I do not like it

178.
Educational Codeforces Round 67 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 67 [Rated for Div. 2] Hello Codeforces! On [contest_time:1187] [contest:1187] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2019-06-04] Glazov, Adilbek [user:adedalic,2019-06-04] Dalabaev, Vladimir [user:Vovuh,2019-06-04] Petrov, Ivan [user:Bl...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +308
  • Vote: I do not like it

179.
Codeforces Round #489 (Div.2)
By DmitryGrigorev, 8 years ago, translation, In English
Codeforces Round #489 (Div.2) Привет, Codeforces! Я рад пригласить всех на раунд #489 Codeforces, который состоится уже завтра, [в понедельник, 18 июня 2018 г. в 19:35](https://www.timeanddate.com/worldclock/fixedtime.html?day=18&month=6&year=2018&hour=19&min=35&sec=0&p1=166). Раунд будет рейтинговым для всех участников из второго дивизиона (то есть для участников с рейтингом **меньше, чем 2100**). Как обычно, мы будем очень рады видеть всех участников из первого дивизиона на нашем контесте вне конкурса! Задачи на этот раунд придумывали и готовили мы, ученики московской школы №2007, Дмитрий [user:DmitryGrigorev,2018-06-17] Григорьев и Фёдор [user:ushakov.fedor,2018-06-17] Ушаков. Большое спасибо Андрею [user:GreenGrape,2018-06-17] Райскому за помощь в подготовке задач и тестировании раунда, Ильдару [user:300iq,2018-06-17] Гайнуллину и Амиррезе [user:Arpa,2018-06-18] Пурахавану за помощь в тестировании раунда, а также координатору Николаю [user:KAN,2018-06-17] Калинину за то, что наши зачастую странные и непро...
participants from the second division (with rating **below than 2100**). As usually, we will be glad to, есть для участников с рейтингом **меньше, чем 2100**). Как обычно, мы будем очень рады видеть всех

Full text and comments »

  • Vote: I like it
  • +405
  • Vote: I do not like it

180.
Educational Codeforces Round 44 [Rated for Div. 2]
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 44 [Rated for Div. 2] Hello Codeforces! On [contest_time:985] Educational Codeforces Round 44 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM ICPC rules. After the end of the contest you will have one day to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were prepared by Adilbek [user:adedalic,2018-05-20] Dalabaev, Vladimir [user:Vovuh,2018-05-20] Petrov and me. Good luck to all participants! Congratulations to the winners: <table class='bordertable'> <tbody> <tr> <th>Rank</th> ...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +286
  • Vote: I do not like it

181.
Codeforces Round #845 (Div. 2) and ByteRace 2023
By TimeWarp101, 4 years ago, In English
Codeforces Round #845 (Div. 2) and ByteRace 2023 Hello, Codeforces! NJACK &mdash; the Computer Science Club of IIT Patna is excited to invite you to **ByteRace 2023** &mdash; [contest:1777] under **Celesta** &mdash; the annual Techno-Management Fest of IIT Patna. The contest will take place on [contest_time:1777]. **This round will be rated for participants with rating lower than 2100.** ![ ](/predownloaded/fe/63/fe63baf2a3f195f519ff5907f40f0fb6fdd46ed7.png) Many thanks to all the people who made this round possible: - The problems were authored and prepared by me, [user:quantau,2023-01-19], [user:mayankfrost,2023-01-19], [user:ShivanshJ,2023-01-19], [user:Crocuta,2023-01-19] and [user:AwakeAnay,2023-01-19]. - [user:irkstepanov,2023-01-19] and [user:KAN,2023-01-19] for coordinating the round! - [user:jenishmonpara,2023-01-19], [user:100gods,2023-01-19] and [user:V_S_M,2023-01-19] for their guidance throughout the process. - VIP testers: [user:YashPant,2023-01-19] and [user:Newtech66,2023-01-19] <3 - Shoutout to [us...
with rating lower than 2100.**

Full text and comments »

  • Vote: I like it
  • +273
  • Vote: I do not like it

182.
Codeforces Round #695 (Div. 2)
By DS007, 6 years ago, In English
Codeforces Round #695 (Div. 2) Hello Codeforces! I am pleased to invite you to my first contest [contest:1467], which will take place on [contest_time:1467]. The problems were written by [user:alimq,2021-01-07] and [user:DS007,2021-01-07]. The round is rated for all users with rating less than 2100, while other users can participate unofficially. You will be given 5 problems and 2 hours to solve them. You are strongly advised to read all the problems. I would really like to thank: <ul> <li> [user:BledDest,2021-01-07] for his amazing coordination of the round. </li> <li> [user:Aggu_01000101,2021-01-07] and [user:infinitepro,2021-01-07] for helping me in shortening the problem statements and solving one of the problems. <li> [user:MikeMirzayanov,2021-01-07] for creating the Codeforces and Polygon systems. </li> <li> The following people for testing the round: </li> </ul> <table style="border:0px"> <tr style="border:0px"> <td style="border:0px"></th> <td style="border:0px"><font color="blue"><a cl...
round is rated for all users with rating less than 2100, while other users can participate unofficially.

Full text and comments »

  • Vote: I like it
  • +424
  • Vote: I do not like it

183.
Educational Codeforces Round 94 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 94 [Rated for Div. 2] Hello Codeforces! On [contest_time:1400] [contest:1400] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-08-24] Glazov, Adilbek [user:adedalic,2020-08-24] Dalabaev, Vladimir [user:vovuh,2020-08-24] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +281
  • Vote: I do not like it

184.
Educational Codeforces Round 113 [Rated for Div. 2]
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 113 [Rated for Div. 2] Hello Codeforces! On [contest_time:1569] [contest:1569] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2021-09-07] Dalabaev, Vladimir [user:vovuh,2021-09-07] Petrov, Ivan [user:BledDest,2021-09-07] Androsov, Mak...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +256
  • Vote: I do not like it

185.
Codeforces Round #675 (Div. 2) based on Qualification Andersen Programming Contest 2020
By aropan, history, 6 years ago, translation, In English
Codeforces Round #675 (Div. 2) based on Qualification Andersen Programming Contest 2020 Tryam, Codeforces! <img alt="andersen" src="https://user-images.githubusercontent.com/1968460/94995698-b4bf1b80-05a8-11eb-8206-05370556b080.jpg" style="float:right; height: 200px; "/> Perhaps you are waiting for us to announce the final of BSUIR championship, but for now we are only glad to invite you to [contest:1422], which will be held on [contest_time:1422]. **This round will be rated for the participants with rating lower than 2100.** The problems were prepared for you by [user:andrew,2020-10-03], [user:hloya_ygrt,2020-10-03], [user:AleXman111,2020-10-03] and [user:Vladik,2020-10-03] together with me. We think that we have prepared good problems for [contest:297213]. After that we selected the best ones for this round. The company [Andersen](https://contest.andersenlab.com/) has been holding a competition for the second year already, which is primarily intended to support students of regional universities in Belarus and Ukraine (starting this year). First of all, we...
be rated for the participants with rating lower than 2100.**

Full text and comments »

  • Vote: I like it
  • +323
  • Vote: I do not like it

186.
Codeforces Round #830 (Div. 2)
By 74TrAkToR, history, 4 years ago, translation, In English
Codeforces Round #830 (Div. 2) Привет, Codeforces! Я рад пригласить вас на мой [contest:1732], который пройдет в [contest_time:1732]. <b>Он будет рейтинговым для всех участников, чей рейтинг будет ниже 2100 до </b> [contest_time:1753]. Задачи были придуманы и подготовлены [user:74TrAkToR,2020-10-20]. Хочу поблагодарить всех, кто оказал бесценную помощь в подготовке этого раунда: <ul style="list-style-type:square"> <li>Координатора [user:Artyom123,2022-10-20] за отличное общение и помощь с подготовкой.</li> <li>Тестеров [user:gisp_zjz,2022-10-20], [user:Pointy,2022-10-20], [user:q-w-q-w-q,2022-10-20], [user:feecIe6418,2022-10-20], [user:nnv-nick,2022-10-20], [user:xiaoziya,2022-10-20], [user:Ormlis,2022-10-20], [user:huangzirui,2022-10-20], [user:Chenyu_Qiu,2022-10-20], [user:triple__a,2022-10-20], [user:gyh20,2022-10-20], [user:low_,2022-10-20], [user:voventa,2022-10-20], [user:tibinyte,2022-10-20], [user:Mr.Robot_28,2022-10-20], [user:Qingyu,2022-10-20], [user:RUSH_D_CAT,2022-10-20], [user:physics0523,20...
round will be rated for all the participants with rating strictly less than 2100 before , рейтинговым для всех участников, чей рейтинг будет ниже 2100 до [contest_time:1753].

Full text and comments »

  • Vote: I like it
  • +248
  • Vote: I do not like it

187.
Codeforces Round #536 (Div. 2)
By jinlifu1999, history, 8 years ago, In English
Codeforces Round #536 (Div. 2) Hello, Codeforces! It's my honor to invite you to Codeforces Round #536 (Div. 2), which takes place at [12:35 UTC, January 31st, 2019](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+%23536+%28Div.+2%29&iso=20190131T1235&p1=1440&ah=2). The round will be **rated** for all division 2 participants **(with rating less than 2100)**. Also we warmly welcome those division 1 participants to join us out of competition. This is my second round on Codeforces platform, and my first round was on January 31st, **2018**, which is such a coincidence that I would like to say thanks to [user:KAN,2019-01-29] for his awesome coordination and great dedication to this round. Besides, much thanks to testers [user:Aleks5d,2019-01-29], [user:cyand1317,2019-01-29], [user:mohammedehab2002,2019-01-29], [user:osaaateiasavtnl.,2019-01-29] for their excellent testing work. Also, I would like to appreciate the Codeforces platform created and maintained by [user:MikeMirzayanov,2019-01-...
participants **(with rating less than 2100)**. Also we warmly welcome those division 1 participants to join

Full text and comments »

  • Vote: I like it
  • +438
  • Vote: I do not like it

188.
Codeforces Round 1118 (Div. 2)
By ItsNotMeItsYou, 3 months ago, In English
Codeforces Round 1118 (Div. 2) # Merhaba Codeforces! We are proud to invite you to [contest:2258], which will be held on [contest_time:2258]. 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](https://codeforces.me/blog/entry/45307) to interactive problems if you have not encountered them before. The problems were authored by me ([user: ItsNotMeItsYou,2025-10-31]), [user:carcinisation,2025-11-17], [user:mychecksdead,2025-11-24] and [user:Seferoglu,2024-06-07]. 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: - [user:cadmiumky,2023-11-08] for his outstanding coordination of the round, - [user:um_nik,...
The round will be rated for participants whose rating is **below 2100**, but higher rated users are

Full text and comments »

  • Vote: I like it
  • +343
  • Vote: I do not like it

189.
Codeforces Round #882 (Div 2)
By PoPularPlusPlus, history, 3 years ago, In English
Codeforces Round #882 (Div 2) Hi Codeforces! I welcome everyone to participate in [contest:1847] which will start on [contest_time:1847]. The round will be rated for participants of Division 2 with a rating lower than 2100. I would encourage Division 1 participants to participate in the round unofficially. You will be given 6 problems and 2 hours to solve them. One of the problem is interactive, so please read [guide for interactive problems](https://codeforces.me/blog/entry/45307) if you are not familiar with it. <spoiler summary="the theme of the contest is">Read problem statements to know which anime :)</spoiler> All the problems are prepared by me and [user:starchan,2023-07-01]. We would like to thank: - [user:darkkcyan,2023-07-01] for going to Lebanon and doing Quality coordination. - [user:Alexdat2000,2023-07-04] for translating problem statements. - [user:socho,2023-07-01] for helping with the initial stages of the round. - [user:astoria,2023-06-30] for giving problem idea of one o...
The round will be rated for participants of Division 2 with a rating lower than 2100. I would

Full text and comments »

  • Vote: I like it
  • +294
  • Vote: I do not like it

190.
Educational Codeforces Round 150 [Rated for Div. 2]
By awoo, history, 3 years ago, translation, In English
Educational Codeforces Round 150 [Rated for Div. 2] Hello Codeforces! On [contest_time:1841] [contest:1841] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://mirror.codeforces.com/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2023-06-11] Dalabaev, Ivan [user:BledDest,2023-06-11] Androsov, Maksim [user:Neon,2023-06-11] Mesche...
This round will be **rated for the participants with rating lower than 2100**. It will be held on

Full text and comments »

  • Vote: I like it
  • +209
  • Vote: I do not like it

191.
Codeforces Round #747 (Div. 2)
By Theo830, 5 years ago, In English
Codeforces Round #747 (Div. 2) Γεια σου (Hello), Codeforces! [user:Dremix10,2021-10-01] and I are glad to invite you to the first **Cypriot round** [Codeforces Round #747 (Div. 2)](https://codeforces.me/contest/1594) which will take place on [contest_time:1594]. **Note the unusual start time of the round**. As usual, **this round will be rated for participants with rating lower than 2100.** Problems were created and prepared by [user:Dremix10,2021-10-01] and me. We tried to make them interesting, with short and clear statements. We hope that you will enjoy them! I would like to thank: - [user:adedalic,2021-10-01] for amazing coordination of this round. - [user:Dremix10,2021-10-01] for giving the first feedback about every problem I created. - [user:Markadiusz,2021-10-01], [user:cfalas,2021-10-01], [user:m371,2021-10-01], [user:ijxjdjd,2021-10-06], [user:YouKn0wWho,2021-10-06], [user:PurpleCrayon,2021-10-06], [user:flamestorm,2021-10-06], [user:Shinchan01,2021-10-06], [user:rgnerdplayer,2021-...
participants with rating lower than 2100.**

Full text and comments »

  • Vote: I like it
  • +586
  • Vote: I do not like it

192.
Educational Codeforces Round 147 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 147 [Rated for Div. 2] Hello Codeforces! On [contest_time:1821] [contest:1821] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://mirror.codeforces.com/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2023-04-19] Dalabaev, Ivan [user:BledDest,2023-04-19] Androsov, Maksim [user:Neon,2023-04-19] Mesche...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +210
  • Vote: I do not like it

193.
Useless CP Information #8: Are LGMs Overrated?
By greateric, history, 4 months ago, In English
Useless CP Information #8: Are LGMs Overrated? Alright, clickbait title aside, how do tourist and jiangly get to 4000 rating? In chess, real life ratings cap out at around 2900, and even on online sites like Lichess, [the highest bullet players are 3300-3400, and just around 3000 for the other modes](https://lichess.org/player). Also, anecdotally, if rating is correct, the model predicts that someone who is 2940 should beat me 99.1% of the time. I have a gut feeling I beat more than 0.9% of GMs and LGMs in round 1105 and round 1108. <spoiler summary="Review on rating models if you forgot"> Rating represents win probability. In a match, for every 400 points player A is rated higher than player B, player A is 10 times more likely to win (exponentially). - If player A is rated 400 points higher than player B, then out of 11 games, player A should win 10 and player B should win 1. - If player A is rated 800 points higher than player B, then out of 101 games, player A should win 100 and player B should win 1. This can be ...
~~~~~ {3750: 1, 3700: 1, 3650: 2, 3600: 1, 3550: 2, 3500: 1, 3400: 2, 3350: 4, 3300: 3, ...,2100

Full text and comments »

  • Vote: I like it
  • +211
  • Vote: I do not like it

194.
Codeforces Round 1113 (Div. 2)
By szdytom, 3 months ago, In English
Codeforces Round 1113 (Div. 2) # Hello / 你好，Codeforces, ₍^. .^₎⟆ We are happy to invite you to participate in [contest:2248], which will be held on [contest_time:2248]. This round will be rated for all participants with rating below **2100**. You will be given **2 hours and 30 minutes** to solve **7** problems. The tasks are authored and prepared by [user:Zxc200611,2026-07-28], [user:Suwan,2026-07-28], [user:FISHER_,2026-07-28] and me, [user:szdytom,2026-07-28]. We are extremely grateful to these wonderful people: - [user:satyam343,2026-07-28] for their patient and helpful coordination. - [user:Alexdat2000,2026-07-28] for translating the statements to Russian. - Our testers: [user:ConstructibleNumber,2026-07-28], [user:FetFot,2026-07-28], [user:liaoz123,2026-07-28], [user:Rvess,2026-07-28], [user:shorya1835,2026-07-28], [user:Jose_17,2026-07-28], [user:samsoom,2026-07-28], [user:AryRDW,2026-07-28], [user:fuad720,2026-07-28], [user:Pie_TealCompressorDragon,2026-07-28], [user:3atori,2026-07-28], [user:i-lov...
:2248]. This round will be rated for all participants with rating below **2100 **. You will be given **2

Full text and comments »

  • Vote: I like it
  • +352
  • Vote: I do not like it

195.
Codeforces Round #491 (Div.2)
By ashmelev, history, 8 years ago, translation, In English
Codeforces Round #491 (Div.2) Привет! В субботу [23 июня в 18:35 (Московское время)](https://www.timeanddate.com/worldclock/fixedtime.html?day=23&month=6&year=2018&hour=18&min=35&sec=0&p1=166) начнется Codeforces Round #491 (Div.2). Раунд будет **рейтинговым для участников с рейтингом менее 2100**, остальные участники могут решать задачи вне конкурса. Раунд во многом пересекается с задачами олимпиады по программированию ННГУ 2018 года. Если вы принимали участие в олимпиаде или дорешивали задачи, просьба **не участвовать** в раунде. В задачах раунда вам нужно будет помочь студенту Васе справиться с трудностями, вызванными окончанием учебного года. Всего будет предложено 6 задач и 2 часа на их решение. Если же вы решите все задачи за 25 минут, то успеете посмотреть второй тайм матча Южная Корея &mdash; Мексика на чемпионате мира FIFA. Разбалловка немного нестандартная: **500-1000-1250-1500-2000-2750** Выражаю максимальную благодарность Михаилу [user:MikeMirzayanov,2018-06-22] Мирзаянову за всем известн...
round will be **rated for the participants with rating lower than 2100** and other contestants can join, ). Раунд будет **рейтинговым для участников с рейтингом менее 2100**, остальные участники могут решать

Full text and comments »

  • Vote: I like it
  • +380
  • Vote: I do not like it

196.
Educational Codeforces Round 132 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 132 [Rated for Div. 2] Hello Codeforces! On [contest_time:1709] [contest:1709] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2022-07-20] Dalabaev, Vladimir [user:vovuh,2022-07-20] Petrov, Ivan [user:BledDest,2022-07-20] Androsov, Mak...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +166
  • Vote: I do not like it

197.
Летний интенсив от Умника 2021
By Um_nik, history, 5 years ago, In Russian
Летний интенсив от Умника 2021 Всем привет. Я продолжаю свои попытки в онлайн обучение спортивному программированию (предыдущие итерации: [раз](https://codeforces.me/blog/entry/78785) [два](https://codeforces.me/blog/entry/81129) [три](https://codeforces.me/blog/entry/85062)). Ученики говорят, что им очень нравится, почему бы и вам не приобщиться к прекрасному? Тело поста почти совпадает с зимним интенсивом, так что если вы знаете, о чем идёт речь, можете сразу переходить к формочке. ## Что я предлагаю - 5 личных контестов на 4-5 часов, в каждом контесте около 16 задач. - Все задачи со старых раундов Codeforces, но подбираю я их с любовью и прицелом на то, что я смогу интересного сказать на разборе по этому поводу. Задачи сложные. - Соответственно, платформа для проведения (с задачной точки зрения) — закрытая группа на Codeforces. - Рабочий процесс по одному контесту выглядит так: в один день вы пишите виртуалку, на следующий день я провожу разбор. Разборы у меня очень длинные, подробные, с ч...
- Занятия рассчитаны на фиолетовый/оранжевый. Чем ближе ваш рейтинг к 2100, тем (скорее всего) вам

Full text and comments »

  • Vote: I like it
  • +109
  • Vote: I do not like it

198.
Codeforces Round #597 (Div. 2)
By DeliciousFlatChest, history, 7 years ago, In English
Codeforces Round #597 (Div. 2) Good day, Codeforces! Or in my language, magandang araw, Codeforces! [contest:1245] will be held on [contest_time:1245]. Is it rated? Yes, but only for participants **below 2100 rating**. Of course, this round is not made by me alone. So, I would like to thank the following people for their help in making this round possible: - coordinator [user:PikMike,2019-10-31], for coordinating my round even when he was very busy; - testers [user:antontrygubO_o,2019-10-31], [user:McDic,2019-10-31], [user:300iq,2019-10-31], [user:adedalic,2019-10-31], [user:isaf27,2019-10-31], [user:farmersrice,2019-10-31], [user:NeverBeNutella,2019-10-31], [user:Vovuh,2019-10-31], [user:CaseRuten,2019-10-31],[user:Stresshoover,2019-10-31], [user:ZeroAmbition,2019-10-31], [user:Pavlova,2019-10-31], [user:defolaut,2019-10-31], and [user:Arpa,2019-10-31], for testing problems and giving very valuable feedback; - and of course, [user:MikeMirzayanov,2019-10-31] and Codeforces staff, for providing us with the...
**below 2100 rating**.

Full text and comments »

  • Vote: I like it
  • +513
  • Vote: I do not like it

199.
Codeforces Round #737 (Div. 2)
By Mo2men, history, 5 years ago, In English
Codeforces Round #737 (Div. 2) Hello, Codeforces! I'm glad to invite you to [Codeforces Round #737 (Div. 2)](https://codeforces.me/contests/1557) , which will be held on [Monday, August 9, 2021 at 16:35 UTC+2](https://www.timeanddate.com/worldclock/fixedtime.html?msg=Codeforces+Round+%23737+%28Div.+2%29&iso=20210809T1635&p1=53&ah=2). This round **rated for the participants with rating lower than 2100**. You will be given **5 problems** and **2 hours** to solve them.all problems were prepared by me and [user:AhmedEzzatG,2021-08-04]. One of the problems will be **interactive**. So, it is recommended to read the [guide on interactive problems](https://codeforces.me/blog/entry/45307) before the round. I would like to thank - 1. [user:Aleks5d,2021-08-04], for awesome coordination of our round and suggested one of the problems. 2. [user:Kaneki-kun,2021-08-04] for help us to prepare the problems. [user:compiler_101,2021-08-04] ,[user:Shanks,2021-08-04] ,[user:DeadPillow,2021-08-04] , and [user:Omar_E...
This round **rated for the participants with rating lower than 2100**.

Full text and comments »

  • Vote: I like it
  • +292
  • Vote: I do not like it

200.
Codeforces Round #541 (Div. 2)
By ch_egor, 8 years ago, translation, In English
Codeforces Round #541 (Div. 2) Всем привет! В эту субботу пройдет <a href="http://mos-inf.olimpiada.ru">московская олимпиада школьников по программированию для 6-9 классов</a>. Над туром работала Московская методическая комиссия, известная вам также по Открытой олимпиаде школьников по программированию, Московской командной олимпиаде и олимпиаде Мегаполисов (раунды <a href="https://codeforces.me/blog/entry/21185">327</a>, <a href="https://codeforces.me/blog/entry/23309">342</a>, <a href="https://codeforces.me/blog/entry/43615">345</a>, <a href="https://codeforces.me/blog/entry/47769">376</a>, <a href="https://codeforces.me/blog/entry/50613">401</a>, <a href="https://codeforces.me/blog/entry/54350">433</a>, <a href="https://codeforces.me/blog/entry/55201">441</a>, <a href="https://codeforces.me/blog/entry/57981">466</a>, <a href="https://codeforces.me/blog/entry/58229">469</a>, <a href="https://codeforces.me/blog/entry/61638">507</a>, <a href="https://codeforces.me/blog/entry/62440">516</a>). Раунд со...
hours to solve them. Round will be rated for second division (rating below 2100 ). As usual, решение. Раунд будет рейтинговым для второго дивизиона (рейтинг ниже 2100). Как обычно, участники из

Full text and comments »

  • Vote: I like it
  • +203
  • Vote: I do not like it

201.
Codeforces Round #603 (Div. 2)
By Supermagzzz, history, 7 years ago, In English
Codeforces Round #603 (Div. 2) Привет Codeforces! Мы, [user:Supermagzzz,2019-11-28], [user:Stepavly,2019-11-28], [user:AdvancerMan,2019-11-28], [user:unreal.eugene,2019-11-28], студенты ИТМО, желая внести свой вклад в развитие сообщества Codeforces, обратились к [user:MikeMirzayanov,2019-11-28] с предложением помочь с тестированием новых раундов. Но [user:MikeMirzayanov,2019-11-28] предложил нам свою помощь в разработке собственного раунда. Поэтому... Мы рады пригласить вас на [Codeforces Round #603 (Div. 2)](http://codeforces.me/contest/1263), который пройдет в [contest_time:1263]. Он будет рейтинговым для **всех участников, чей рейтинг ниже 2100**. Вам будет предложено **шесть задач** и **два часа** на их решение. Задачи были придуманы и подготовлены [user:Supermagzzz,2019-11-28], [user:Stepavly,2019-11-28], [user:AdvancerMan,2019-11-28], [user:unreal.eugene,2019-11-28], [user:MikeMirzayanov,2019-11-28]. Особую благодарность выражаем: - [user:VArtem,2019-11-28], [user:Nebuchadnezzar,2019-11-28...
below 2100**. You will be given **six problems** and **two hours** to solve them., 2100**. Вам будет предложено **шесть задач** и **два часа** на их решение.

Full text and comments »

  • Vote: I like it
  • +325
  • Vote: I do not like it

202.
Educational Codeforces Round 131 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 131 [Rated for Div. 2] Hello Codeforces! On [contest_time:1701] [contest:1701] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2022-07-07] Dalabaev, Vladimir [user:vovuh,2022-07-07] Petrov, Ivan [user:BledDest,2022-07-07] Androsov, Mak...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +218
  • Vote: I do not like it

203.
Educational Codeforces Round 170 [Rated for Div. 2]
By awoo, history, 2 years ago, translation, In English
Educational Codeforces Round 170 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Neapolis University Pafos](https://www.nup.ac.cy/). They offer a BSc in Computer Science and AI with [JetBrains Scholarships] (https://lp.jetbrains.com/academy/csai-program/). Gain cutting-edge skills in AI and machine learning, preparing you for high-demand tech careers. Curious? Check out the [CSAI curriculum] (https://drive.google.com/file/d/19I776O8NG07ie2Q14wwBspuh3De4kbHc/view) now. Limited scholarships available &mdash; don't miss your chance to study in Europe for free! Are you looking to sharpen your skills and increase your chances of getting a scholarship? Join the free clubs for high school students from JetBrains: - [Math club](https://lp.jetbrains.com/youth-math-club/) - [AI club](https://lp.jetbra...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +168
  • Vote: I do not like it

204.
Educational Codeforces Round 190 [Rated for Div. 2]
By BledDest, 6 months ago, In English
Educational Codeforces Round 190 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Computer Science and Artificial Intelligence (CSAI)] (https://lp.jetbrains.com/academy/csai-program/) program at [Neapolis University Pafos](https://www.nup.ac.cy/), with scholarships provided by JetBrains. [contest:2230] will start on [contest_time:2230]. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. **The problems in this round will partially intersect with Saratov SU internal contest (schedul...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +172
  • Vote: I do not like it

205.
Codeforces Round 965 (Div. 2)
By cry, 2 years ago, In English
Codeforces Round 965 (Div. 2) <center> <img src="/predownloaded/63/b3/63b3ecd158e245202826f07c7510e7a632b90ee0.png" style="width:75;"/> <br> <h2> Wazzup Codeforcers! </h2> </center> [user:sum,2024-08-02], [user:satyam343,2024-08-05], and I are extremely ecstatic to invite you to [contest:1998] on [contest_time:1998]. You will be given **5 problems** and **2 hours** to solve them. **1 problem** will have subtasks. This round will be **rated** for all participants with rating below **2100**. We spent the most time cooking up this round than any other round, so it means a lot if you will participate. We would like to orz the following individuals for making the contest possible: - Our coordinatorz [user:satyam343,2024-08-05] for his gracious coordination and donation of his own problems to this contest. - Our testuwuers: [user:Benq,2024-08-08], [user:omeganot,2024-08-05], [user:maxwellzen,2024-08-05], [user:244mhq,2024-08-05], [user:null_awe,2024-08-05], [user:Dominater069,2024-08-05], [user:A_G...
below **2100**. We spent the most time cooking up this round than any other round, so it means a lot

Full text and comments »

  • Vote: I like it
  • +286
  • Vote: I do not like it

206.
Educational Codeforces Round 196 [rated for Div. 2]
By BledDest, 9 days ago, translation, In English
Educational Codeforces Round 196 [rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 150px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of [Neapolis University Pafos](https://www.nup.ac.cy/). [contest:2283] will start on [contest_time:2283]. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. I hope everyone participating finds interesting problems for them to solve. I would like to express my gratitude to [user:MikeMirzayanov,2026-10-12] for creating Codeforces and Polygon ...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +163
  • Vote: I do not like it

207.
Educational Codeforces Round 109 [Rated for Div. 2]
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 109 [Rated for Div. 2] Hello Codeforces! On [contest_time:1525] [contest:1525] will start. **Please, note the unusual start time.** Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2021-05-15] Glazov, Adilbek [user:adedalic,2021-05-15] Dalabaev, Vladimir...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +196
  • Vote: I do not like it

208.
Cheating statistics
By Christine-, history, 14 months ago, In English
Cheating statistics <p style="text-align: right;"><em> "Lies, damned lies, and statistics."<br> </em></p> Big shoutout to [user:macaquedev,2025-08-26] and all the people working on [the cheater database](https://cf-cheater-database.vercel.app/). Their project has already identified 2,100+ verified cheaters. In my experience, they don't assign a cheater mark easily; some of my reports (which, to me, were clear cases of cheating) were rejected. Here is a small survey on cheating statistics on Codeforces. I computed the rating distribution of caught cheaters and looked at some funny demographics. Namely, we try to compare the frequency of cheating per country. ## Data The list of handles of cheaters was taken from the [user:macaquedev,2025-08-26] [GitHub](https://github.com/macaquedev/cf-cheater-highlighter). My small research is based mostly on this list. I used the Codeforces API to gather the rating and the corresponding country of each handle from the list. Next, I used the Codeforces AP...
more cheaters than the 2100 listed in the database. So, instead, for each country X we compute the, | 61 | 2.95 | 5.31 | | 2100–2399 | 39 | 1.88

Full text and comments »

  • Vote: I like it
  • +290
  • Vote: I do not like it

209.
Codeforces Round 917 (Div. 2)
By _LeMur_, 3 years ago, In English
Codeforces Round 917 (Div. 2) Hi, Codeforces! I'm glad to invite you to take part in [Codeforces Round 917](https://codeforces.me/contests/1917), which will take place on [contest_time:1917]. **Round will be rated for participants with rating less than $2100$.** Participants from the first division can take part out of competition. There will be $6$ problems for $2$ hours. The problems are authored by [user:igori,2023-12-24], [user:zidder,2023-12-24] and me. **Part of the problems in this round were in the Yerevan SU 28.1₀.₂₀₂3 Contest. If you participated in it or know at least one problem from it, please refrain from participating in this round.** We would like to thank - Thanks to [user:thescrasse,2023-12-22] for excellent round coordination; - Thanks to our testers: [user:KAN,2023-12-22], [user:S_Voloch,2023-12-22], [user:Tmitmi,2023-12-22], [user:Pagode_Paiva,2023-12-22], [user:hgglmao,2023-12-22], [user:IceWolf898,2023-12-22], [user:daud04,2023-12-22], [user:dewana310,2023-12-22], [user:menbo...
less than $2100$.** Participants from the first division can take part out of competition.

Full text and comments »

  • Vote: I like it
  • +281
  • Vote: I do not like it

210.
Educational Codeforces Round 119 [Rated for Div. 2]
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 119 [Rated for Div. 2] Hello Codeforces! On [contest_time:1620] [contest:1620] will start. **Please, note the unusual start time.** Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2021-12-17] Dalabaev, Vladimir [user:vovuh,2021-12-17] Petrov, Ivan...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +206
  • Vote: I do not like it

211.
List of Suspected Cheaters in Nebius Round 2
By jerrywang0916, history, 7 months ago, In English
List of Suspected Cheaters in Nebius Round 2 This message was originally intended to be posted via the account [user:send_cheater_to_basement,2026-03-31]. However, since that account is not a trusted account, it cannot publish blogs. Therefore, I am using this account instead, **which belongs to one of my classmates**. I would like to thank him for lending it to me. I manually collected all suspicious users, which were then organized by AI. There may be errors. Here is a list of users who are heavily suspected of cheating during the Nebius Round 2. I only managed to check the top 250 participants whose original rating was no higher than Specialist. Unfortunately, I had to stop after checking these because my IP was flagged as a web crawler/bot. **⚠️ DISCLAIMER: Appearing on this list does not definitively prove that a user has cheated.** It simply indicates highly suspicious behavior during the contest. ### Detection Methodology During the contest, anti-AI traps were placed in the problem statements: - ...
My main account got 2100-eps after the round,so i can't wait to find the cheater in front of me.

Full text and comments »

  • Vote: I like it
  • +264
  • Vote: I do not like it

212.
Educational Codeforces Round 112 [Rated for Div. 2]
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 112 [Rated for Div. 2] Hello Codeforces! On [contest_time:1555] [contest:1555] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2021-07-29] Dalabaev, Vladimir [user:vovuh,2021-07-29] Petrov, Ivan [user:BledDest,2021-07-29] Androsov, Mak...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +210
  • Vote: I do not like it

213.
Educational Codeforces Round 107 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 107 [Rated for Div. 2] Hello Codeforces! On [contest_time:1511] [contest:1511] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2021-04-11] Glazov, Adilbek [user:adedalic,2021-04-11] Dalabaev, Vladimir [user:vovuh,2021-04-11] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +223
  • Vote: I do not like it

214.
Codeforces Round #523 (Div. 2)
By Ashishgup, history, 8 years ago, In English
Codeforces Round #523 (Div. 2) Hi everyone! I would like to invite you to my second Codeforces Round, which I have made with my friend and Snackdown partner [user:Jeel_Vaishnav,2018-11-21]. With that said, I bring to your attention our new [contest:1061] that will take place on [contest_time:1061]. If your rating is less than 2100, this round will be rated for you; otherwise, you can participate out of competition. I would really like to thank [user:Jeel_Vaishnav,2018-11-21] for his help with preparing problems, [user:_kun_,2018-11-21] for coordinating our round and [user:Um_nik,2018-11-21], [user:gritukan,2018-04-08], [user:Aleks5d,2018-11-21], [user:Keyuuuu,2018-11-21] & [user:Mahir83,2018-11-21] for testing the problems. I would also like to thank [user:MikeMirzayanov,2018-11-21] for Codeforces and Polygon platforms. You will be given 6 problems and 2 hours to solve them. Scoring distribution will be announced later. Link to [My Coding Library](https://codeforces.me/blog/entry/61836) for those int...
[contest_time:1061]. If your rating is less than 2100, this round will be rated for you; otherwise, you can

Full text and comments »

  • Vote: I like it
  • +517
  • Vote: I do not like it

215.
Best of COCI #2
By MladenP, history, 5 years ago, In English
Best of COCI #2 Since the second round of this season of COCI (Croatian Open Competition in Informatics) was held [last saturday](https://codeforces.me/blog/entry/96881), here is the continuation in the series of COCI appreciation posts (I will post one after each COCI round, so six in total!). For my coaching, I went through all COCI contests since 2006 to gather tasks and selected some of my favorite ones. ### Notes - Check out the [first post](https://codeforces.me/blog/entry/96205) for notes about the process and the problemset. - There are 9 tasks in this problemset since I accidentally forgot to put one task (Zoo) last time, so it's included now. ### Tasks #### [A: 2016/2017, Contest 5: Ronald](https://evaluator.hsin.hr/tasks/HONI161756ronald/) Author: Adrian Satja Kurdija ([user:satja,2021-11-18]) Tags: <spoiler summary="Spoiler"> graph </spoiler> Note: <spoiler summary="Spoiler"> graph task without any graph algorithms </spoiler> Difficulty range: 1300-1500...
Difficulty range: 1900-2100, Difficulty range: 2100-2300

Full text and comments »

  • Vote: I like it
  • +127
  • Vote: I do not like it

216.
Codeforces Round #842 (Div. 2) Editorial
By Vladithur, history, 4 years ago, In English
Codeforces Round #842 (Div. 2) Editorial Hope you liked the problems! <spoiler summary="(from thanhchauns2) Before the round starts"> This is my second contest on Codeforces, inspiring coordination has been done for the last several months, cannot wait until the third round is released! <spoiler summary="Testers' predictions"> <table> <tr style ="background-color:#D3D3D3"> <th>Tester</th> <th>A</th> <th>B</th> <th>C</th> <th>D</th> <th>E</th> <th>F</th> </tr> <tr> <td>[user:xiaoziya,2022-12-13]</td> <td>900</td> <td>1000</td> <td>1400</td> <td>1800</td> <td>2100</td> <td>3000</td> </tr> <tr> <td>[user:feecle6418,2022-12-13]</td> <td>900</td> <td>1200</td> <td>1400</td> <td>1700</td> <td>2200</td> <td>2900</td> </tr> <tr> <td>[user:cadmiumky,2022-12-13]</td> <td>800</td> <td>1100</td> <td>1550</td> <td>1900</td> <td>2200</td> <td>-</td> </tr> <tr> <t...
1400 1800 2100 3000

Full text and comments »

  • Vote: I like it
  • +237
  • Vote: I do not like it

217.
Educational Codeforces Round 123 [Rated for Div. 2]
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 123 [Rated for Div. 2] Hello Codeforces! On [contest_time:1644] [contest:1644] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2022-02-21] Dalabaev, Vladimir [user:vovuh,2022-02-21] Petrov, Ivan [user:BledDest,2022-02-21] Androsov, Mak...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +201
  • Vote: I do not like it

218.
Educational Codeforces Round 182 [Rated for Div. 2]
By awoo, history, 14 months ago, translation, In English
Educational Codeforces Round 182 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Neapolis University Pafos](https://www.nup.ac.cy/). They offer a BSc in Computer Science and AI with [JetBrains Scholarships] (https://lp.jetbrains.com/academy/csai-program/). Gain cutting-edge skills in AI and machine learning, preparing you for high-demand tech careers. Limited scholarships available &mdash; don't miss your chance to study in Europe for free! On [contest_time:2144] [contest:2144] will start. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You w...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +128
  • Vote: I do not like it

219.
Educational Codeforces Round 187 [Rated for Div. 2]
By awoo, history, 9 months ago, translation, In English
Educational Codeforces Round 187 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Computer Science and Artificial Intelligence (CSAI)] (https://lp.jetbrains.com/academy/csai-program/) program at [Neapolis University Pafos](https://www.nup.ac.cy/), with scholarships provided by JetBrains. [contest:2203] will start on [contest_time:2203]. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6-7 problems** and **2 hours** to solve them. The problems were invent...
This round will be **rated for the participants with rating lower than 2100**. It will be held on

Full text and comments »

  • Vote: I like it
  • +119
  • Vote: I do not like it

220.
Codeforces Round #910 (Div. 2)
By n0sk1ll, history, 3 years ago, In English
Codeforces Round #910 (Div. 2) Hello, Codeforces! [user:ELDRVD,2023-11-15] and I are glad to invite you to [contest:1898], which will start on [contest_time:1898]. You will be given **6** problems and **2** hours to solve them. The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1 participants can participate unofficially. All problems are invented and prepared by [user:ELDRVD,2023-11-15] and me. Special thanks go to [user:Sofija06,2023-11-15] and [user:NemanjaSo2005,2023-12-04], our two most dedicated testers. We would also like to honor: - [user:prvocislo,2023-11-15], [user:wuhudsm,2023-11-15], [user:Marckess,2023-11-15], [user:MateoCV,2023-11-15], [user:Wibo,2023-11-15], [user:curly_braces,2023-11-15], [user:LucaLucaM,2023-11-15], [user:null0124,2023-11-15], [user:OAleksa,2023-11-15], [user:AlphaMale06,2023-11-15], [user:FireFrog418,2023-11-15], and [user:sahaun,2023-11-15] for testing this round and providing valuable feedback! - [user:IgorI,2023-11-15] f...
The round will be rated for participants of Division 2 with a rating lower than 2100. Division 1

Full text and comments »

  • Vote: I like it
  • +183
  • Vote: I do not like it

221.
Codeforces Round #945 (Div. 2)
By prvocislo, 2 years ago, In English
Codeforces Round #945 (Div. 2) Ahoj, Codeforces! We are excited to invite you to participate in [contest:1973], which will start on [contest_time:1973]. The problems are authored by [user:TimDee,2024-05-15] and [user:prvocislo,2024-05-15]. This round will be rated for participants whose rating is below $2100$. Participants with higher ratings are encouraged to participate out of the competition. You will be given $6$ problems and $2$ hours to solve them. The scoring distribution is bellow. One of the problems will be **interactive**. Please read [this blog](https://codeforces.me/blog/entry/45307) to get familiar with this type of problems. We would like to thank everyone, who made this round happen: - **You** for participating in this round! I hope you will enjoy the problems! - [user:satyam343,2024-05-15] for great coordination and discussion of the problem ideas! - [user:KAN,2024-05-15] for providing suggestions to help us make the round better - [user:MikeMirzayanov,2024-05-15] for the...
This round will be rated for participants whose rating is below $2100$. Participants with higher

Full text and comments »

  • Vote: I like it
  • +159
  • Vote: I do not like it

222.
List of Graph Problems Having Short Statements (900 to 2100)
By levitational, history, 4 weeks ago, In English
List of Graph Problems Having Short Statements (900 to 2100) # List of Graph Problems Having Short Statements (900 to 2100) Long, wordy statements can be exhausting, especially for beginners. So here is a list of **graph problems** (DFS/BFS, trees, DSU, shortest paths, constructive graph tasks) with **short and easy-to-read statements**, sorted by rating. **Notes:** - Every problem here has a short statement (under about 1000 characters, input/output and samples not counted). - Within each rating, problems are listed in order of problem ID. - Ratings are as of April 2026 and may shift a little over time. - Short statement does not always mean an easy idea. Some of these are tricky! **900** 1. [115A — Party (900)](https://codeforces.me/problemset/problem/115/A) 2. [1057A — Bmail Computer Network (900)](https://codeforces.me/problemset/problem/1057/A) **1000** 1. [500A — New Year Transportation (1000)](https://codeforces.me/problemset/problem/500/A) **1100** 1. [1829E — The Lakes (1100)](https://codeforces.me/probl...
List of Graph Problems Having Short Statements (900 to 2100), **2100**, 1. [1029E — Tree with Small Distances (2100 )](https://codeforces.me/problemset/problem/1029/E) 2

Full text and comments »

  • Vote: I like it
  • +13
  • Vote: I do not like it

223.
Codeforces Round #931 (Div. 2)
By harsh__h, 3 years ago, In English
Codeforces Round #931 (Div. 2) Hello, Codeforces! I invite you to participate in [Codeforces Round 931 (Div. 2)](https://codeforces.me/contest/1934), which will be held on [contest_time:1934]. The round will be **rated** for participants with **rating lower than 2100**. Participants with higher rating can participate in round unofficially. You will have 2 hours to solve 5 problems, with one of the problems having 2 versions. **One or more interactive problems may occur in the round**, so please read [guide for interactive problems](https://codeforces.me/blog/entry/45307) before the contest. All problems are authored by me. I would like to thank: - [user:Akulyat,2024-02-28] for round coordination and help with preparation - [user:A_G,2024-02-28], [user:okwedook,2024-02-28], [user:rui_er,2024-02-28], [user:jdurie,2024-02-28], [user:lunchbox,2024-02-28], [user:_rey,2024-02-28], [user:wjli,2024-02-28], [user:.-O_O-.,2024-02-28], [user:aryanc403,2024-02-28], [user:akshaykhandelwal,2024-02-28], [us...
The round will be **rated** for participants with **rating lower than 2100**. Participants with

Full text and comments »

  • Vote: I like it
  • +206
  • Vote: I do not like it

224.
Educational Codeforces Round 181 [рейтинговый для Div. 2]
By awoo, history, 16 months ago, translation, In English
Educational Codeforces Round 181 [рейтинговый для Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 150px; margin: 10px; max-width:40%;"/> Привет, Codeforces! Благодаря поддержке [Neapolis University Pafos](https://www.nup.ac.cy/bsc-in-computer-science-and-artificial-intelligence), продолжается серия образовательных раундов. Университет предлагает получение степени бакалавра в области компьютерных наук и искусственного интеллекта со [стипендиями JetBrains](https://lp.jetbrains.com/academy/csai-program/). Получите передовые навыки в области искусственного интеллекта и машинного обучения, которые подготовят вас к востребованным техническим карьерам. Доступно ограниченное количество стипендий. Не упустите свой шанс учиться в Европе бесплатно! В [contest_time:2125] состоится [contest:2125]. Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет проводиться по немного расширенным правилам ICPC. Штраф за кажд...
Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +117
  • Vote: I do not like it

225.
Codeforces Round 968 (Div. 2) Editorial
By zltzlt, history, 2 years ago, In English
Codeforces Round 968 (Div. 2) Editorial Thank you for your participation! <spoiler summary="Rating Predictions"> | Person | A | B | C | D1 | D2 | E1 | E2 | F | | :----------: | :----------: | :----------: | :----------: | :----------: | :----------: | :----------: | :----------: | :----------: | | [user: zltzlt, 2024-8-25] | 800 | 1100 | 1500 | 1300 | 2100 | 2100 | 2300 | 2500 | | [user: WRuperD, 2024-8-25] | 800 | 1200 | 1400 | 1800 | 2300 | 2400 | 2600 | 2800 | | [user: Ender32k, 2024-8-25] | 800 | 1100 | 1400 | 1900 | 2200 | | | | | [user: yinhee, 2024-8-25] | 900 | 1200 | 1600 | 1500 | 1900 | 2400 | 2500 | 2700 | | [user: Jryno1, 2024-8-25] | 800 | 1100 | 1500 | 1500 | 1800 | | | | | [user: yeminghan, 2024-8-25] | 800 | 900 | 1500 | 1400 | 1900 | 2700 | 2800 | | | [user: wutongchun, 2024-8-25] | 800 | 900 | 1300 | 1500 | 1900 | 2700 | | 3000 | | [user: small_peter, 2024-8-25] | 800 | 1200 | 1600 | 1900 | 1900 | | | | | [user: DisconnectedGraph, 2024-8-25] | 800 | 1200 | 1400 | 1700 | 2000 | 2000 | 2600 | | ...
| 1120 | 1470 | 1630 | 2000 | 2383 | 2560 | 2750 | | Actual | 800 | 800 | 1200 | 1500 |2100 | 2600

Full text and comments »

  • Vote: I like it
  • +117
  • Vote: I do not like it

226.
Educational Codeforces Round 134 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 134 [Rated for Div. 2] Hello Codeforces! On [contest_time:1721] [contest:1721] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2022-08-26] Dalabaev, Vladimir [user:vovuh,2022-08-26] Petrov, Ivan [user:BledDest,2022-08-26] Androsov, Mak...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +174
  • Vote: I do not like it

227.
New Year wishes from participants — "Cyan Rebellion 2022" survey results
By kpw29, 5 years ago, In English
New Year wishes from participants — "Cyan Rebellion 2022" survey results Hi! Two weeks ago I made a survey [link here:](https://codeforces.me/blog/entry/98424) about making Codeforces better. In this blog I am sharing the results. Consider reading the previous blog first, but this one should be self-contained as well. TLDR ------------------ The quality of Codeforces problems has increased over time, and people are mostly happy. Participants would probably be even happier with a greater variety of problem topics. It's important for setters to consider the contest as a whole, including the target audience of a given task. Some users wrote essays longer than the entire survey. How to access the results ------------------ Before we start, I would like to invite everyone to take a look at the raw data. If you are keen on showing off your data analysis skills, please do so! I hope that some of us will manage to find more interesting insights taking into account preferences of users from various skill groups. [Raw results](https://docs.google.com/...
rated for users under 2100 so in theory shouldn't contain terrible standardness). Maybe [user:awoo

Full text and comments »

  • Vote: I like it
  • +224
  • Vote: I do not like it

228.
Educational Codeforces Round 61 [Rated for Div. 2]
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 61 [Rated for Div. 2] ![ ](https://i.imgur.com/I61q7FQ.png) Hello Codeforces! On [contest_time:1132] [contest:1132] will start. This round is organised in collaboration with Hello Muscat Programming Bootcamp and supported by Sberbank, General Partner of the boot camp and one of the largest banking leaders of Eastern Europe, providing thousands of jobs and innovation in the financial industry. As the Hello Muscat Programming Bootcamp’s General Partner, Sberbank made it possible for students from some of the world’s top universities to attend the bootcamp, by sponsoring their participation. This includes students from Saint-Petersburg State University, Moscow Institute of Physics and Technology (MIPT), Penza State University, National Research Mordovia State University; MRSU, ITMO, Higher School of Economics / Moscow, Volgograd State Technical University, Lobachevsky State University of Nizhni Novgorod, Moscow Aviation Institute, Tyumen industrial University, University of Haifa, Northern (Arctic...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +246
  • Vote: I do not like it

229.
Codeforces Round #532 (Div. 2)
By den2204, history, 8 years ago, translation, In English
Codeforces Round #532 (Div. 2) Привет, Codeforces! В [contest_time:1100] начнётся [contest:1100]. Раунд будет рейтинговым для второго дивизиона (рейтинг ниже 2100). Как обычно, участники из первого дивизиона могут написать контест вне конкурса. На раунде вам будет предложено 6 задач и 2 часа на их решение. Задачи были подготовлены мной, [user:den2204,2019-01-12]. Спасибо [user:MikeMirzayanov,2019-01-12] за платформу Codeforces, [user:KAN,2019-01-12] за помощь с идеями для задач и координацию моей работы. Спасибо [user:gritukan,2019-01-12], [user:Andreikkaa,2019-01-12], [user:flyrise,2019-01-12], [user:Um_nik,2019-01-12], [user:Aleks5d,2019-01-12] и [user:osaaateiasavtnl.,2019-01-12] за помощь в подготовке и тестирование раунда, [user:arsor,2019-01-12] за перевод условий на английский язык, [user:arsijo,2019-01-12] за помощь в проведении раунда. Отдельное спасибо [user:Andreikkaa,2019-01-12] за идею по задаче E. Удачи! P.S. Это мой первый раунд на Codeforces, поэтому не судите строго :) **UPD:**...
(рейтинг ниже 2100). Как обычно, участники из первого дивизиона могут написать контест вне конкурса., below 2100). As usual, participants from the first division can participate in a contest out of

Full text and comments »

  • Vote: I like it
  • +569
  • Vote: I do not like it

230.
Educational Codeforces Round 195 [rated for Div. 2]
By BledDest, 4 weeks ago, translation, In English
Educational Codeforces Round 195 [rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 150px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Neapolis University Pafos](https://www.nup.ac.cy/). [contest:2276] will start on [contest_time:2276]. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. I hope everyone participating finds interesting problems for them to solve. **The round is based on the problems from The ICPC Southern and Volga Russia Regional Contest. If you par...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +132
  • Vote: I do not like it

231.
What If I Never Brick? — A web application that predicts your optimal Codeforces rating
By wyhong3103, history, 3 years ago, In English
What If I Never Brick? — A web application that predicts your optimal Codeforces rating Hello Codeforces, I wanted to share with you a web application I recently developed. The application filters out unsuccessful contests you have participated in on Codeforces and predicts your rating today based on the performance of the contests you have participated in. The primary purpose of this web application is to help users discover their true potential, serving as a source of inspiration and motivation to empower them to persevere in their endeavors. Initially, my idea was to greedily select contests that have a positive delta based on the current rating, using the rating formula mentioned in this [blog post](https://codeforces.me/blog/entry/20762). However, due to slow API calls, I was almost ready to give up on the project. Nevertheless, I decided to proceed for the sake of completeness. To my surprise, when I completed the application, I found the results to be quite interesting. Additionally, I added a mode that computes the rating using a simple O(1) formula: $ delt...
will be eligible for Div 2 if and only if your rating is less than 2100 (The same applies to Div 2

Full text and comments »

  • Vote: I like it
  • +404
  • Vote: I do not like it

232.
Educational Codeforces Round 104 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 104 [Rated for Div. 2] Hello Codeforces! On [contest_time:1487] [contest:1487] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2021-02-14] Glazov, Adilbek [user:adedalic,2021-02-14] Dalabaev, Vladimir [user:vovuh,2021-02-14] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +158
  • Vote: I do not like it

233.
Useless CP Information #6: How Much Harder is Div 1 vs Div 2?
By greateric, history, 4 months ago, In English
Useless CP Information #6: How Much Harder is Div 1 vs Div 2? Hey guys it's your favorite <strike>purple</strike> not anymore CF shitposter here. We're back to hopefully non-controversial useless information lol I think anecdotally we all have this gut feeling that it's harder to get a X perf in a div 2 than a div 3, and in turn harder to get X perf in a div 1 than a div 2. Is this urban legend or a real phenomenon? Methodology ------------------ I took several of the most recent separated div 1 and div 2 rounds where the div 1 round has the same problems shifted by 2 positions. For each contestant in the div 2 round, we'll: - Calculate and record their div 2 perf - Convert to estimated div 1 score by dropping problem A/B, adjusting timestamps on the rest of the problems, and recalculating the score based on the problem values for div 1. (We will discard anyone who solves C/D/E/F before A/B) - Calculate and record their div 1 perf from the new score we calculate. ### Calculating performance (CP lesson time!) Using FFT, our...
You may also have a gut feeling that a 2100-rated div 3/4 problem is easier than a2100-rated div 1

Full text and comments »

  • Vote: I like it
  • +55
  • Vote: I do not like it

234.
"YAY I'M GM!!!" blog
By Noobish_Monk, history, 23 months ago, In English
"YAY I'M GM!!!" blog So recently I became red on CF and my happiness knows no boundaries. For achieving the red color, I would like to thank those who helped me the most. [user:dmikhalin,2024-12-01], my first informatics teacher who inspired me to do competitive programming [user:gmusya,2024-12-01], teacher in B parallel of the main programming club in Russia, who answered many of my questions and helped my a lot And all the teachers of parallel A! I'd like to tell a timeline of my progression. Three years ago when I ended 8th grade I got a giant boost of motivation after I learned segment tree and dsu from CF EDU (that's actually useful try it). In summer school I got to expert (that was so cool, I still remember how I solved problem F from div 3, back then it was difficult). Then I continued to grind CF. Before 9th class I learned that there is a strong programming club from Tinkoff, so I decided to try to get there. Easily the best decision, this club gave me a gigantic boost during these ...
to get Master before school and bit by bit I crawled in the 2100 zone, getting Master on 5th August

Full text and comments »

  • Vote: I like it
  • +248
  • Vote: I do not like it

235.
Educational Codeforces Round 45 [Rated for Div. 2]
By awoo, history, 8 years ago, In English
Educational Codeforces Round 45 [Rated for Div. 2] Hello Codeforces! On [contest_time:990] Educational Codeforces Round 45 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM ICPC rules. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2018-06-09] Dalabaev, Roman [user:Ajosteen,2018-06-09] Glazov, Ivan [user:BledDest,2018-06-09] Androsov, Mike [user:MikeMirzayanov,2018-06-09] Mirzayanov and me. Good luck to all particip...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +213
  • Vote: I do not like it

236.
Codeforces Round #803 (Div. 2)
By flamestorm, 4 years ago, In English
Codeforces Round #803 (Div. 2) Hi Codeforces! [user:ScarletS,2022-07-25] and I are glad to invite you to [contest:1698] which will be held on [contest_time:1698]. **The round will be rated for participants with rating lower than 2100**. The theme of the round will be _déjà vu_! (Wait, wasn't that already a theme before?) Thanks to the people who made this round possible: - [user:errorgorn,2022-06-25], for his fantastic coordination of the round; - [user:MikeMirzayanov,2022-06-25], for creating the amazing Codeforces and Polygon platforms; - [user:KAN,2022-06-25], for translation of the statements into Russian; - [user:antontrygubO_o,2022-06-25], [user:AmShZ,2022-06-25], [user:Sexpert,2022-06-25], [user:MagentaCobra,2022-06-25], [user:AlperenT,2022-06-25], [user:satyam_343,2022-06-25], [user:Vladithur,2022-06-25], [user:polarity-,2022-06-25], [user:fishy15,2022-06-25], [user:epicxtroll,2022-06-25], [user:Surprise_Me,2022-06-25], [user:jampm,2022-06-25], [user:Yangster,2022-06-25], [user:Il9,2022-06-25], [...
[contest_time:1698]. **The round will be rated for participants with rating lower than2100**. The

Full text and comments »

  • Vote: I like it
  • +494
  • Vote: I do not like it

237.
Refact.ai Match 1 (Codeforces Round 985) Editorial
By Error_Yuan, history, 2 years ago, In English
Refact.ai Match 1 (Codeforces Round 985) Editorial Thank you all for participating in the round! We apologize for the wrong checker in problem E at the beginning of the contest, as well as the weak tests in problem B. To be honest, all the hacked submissions have similar logic and codes in B, which made me suspicious. Anyway, we are sorry for the inconvenience! >_< <spoiler summary="Rating Predictions"> | |A|B|C|D|E|F|G|H|I| |:--:|:--:|:--:|:--:|:--:|:--:|:--:|:--:|:--:|:--:| |[user:Error_Yuan,2024-11-7]|800|1200|**1600**|**2100**|**2300**|2600|**3000**|3400|**3500**| |[user:sszcdjr,2024-11-7]|800|1100|1600|2000|2300|**2600**|2900|**3300**|3500| |[user:wyrqwq,2024-11-7]|800|**1000**|1400|2200|**2300**|2600|**3000**|3500|3500| |[user:Otomachi_Una,2024-11-7]|**800**|1000|1600|2200|2400|2600|3200|3500|3500| |[user:dxqwq,2024-11-7]|900|1100|1700|2200|2400|2600|3200|3500|3500| |[user:Kubic,2024-11-7]|800|1000|1600|2400|2200|2800|3000|3500|3300| |[user:wsc2008qwq,2024-11-7]|800|1100|1600|1900|2200|2700|3100| | | |[user:chroma...
| 1580 | 2090 | 2289| 2611 | 3033 | 3450 | 3467 | |Actual| 800 | 1100 | 1700 | 1900 |2100 | 2500

Full text and comments »

  • Vote: I like it
  • +136
  • Vote: I do not like it

238.
Codeforces Round #848 (Div. 2)
By Shefin_, 4 years ago, In English
Codeforces Round #848 (Div. 2) Hello, Codeforces! [user:adnan_toky,2023-01-23] and I are super thrilled to invite everyone to participate in [contest:1778], which will be held on [contest_time:1778]. This round is rated for the participants with ratings strictly **lower than 2100**. You will be given **6 problems** and **2 hours** to solve them. All the problems are authored and prepared by [user:adnan_toky,2023-01-25] and me. To get the 6 problems approved, we needed to propose 12 problems in total <a href="https://emoji.gg/emoji/6390-sneaky-wink-catto"><img src="https://cdn3.emoji.gg/emojis/6390-sneaky-wink-catto.png" width="16px" height="16px" alt="sneaky_wink_catto"></a>. **UPD:** Score distribution: $500-1000-1250-1750-2250-2750$ We would like to thank: - [user:darkkcyan,2022-02-12] for incredible coordination and help with the problem preparation - [user:Alexdat2000,2022-07-16] for the Russian translations and precious help regarding the statements and limits - [user:KAN,2023-01-30] for upgrad...
This round is rated for the participants with ratings strictly **lower than 2100 **. You will be

Full text and comments »

  • Vote: I like it
  • +417
  • Vote: I do not like it

239.
Educational Codeforces Round 128 [Rated for Div. 2]
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 128 [Rated for Div. 2] Hello Codeforces! On [contest_time:1680] [contest:1680] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2022-05-12] Dalabaev, Vladimir [user:vovuh,2022-05-12] Petrov, Ivan [user:BledDest,2022-05-12] Androsov, Mak...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +169
  • Vote: I do not like it

240.
Educational Codeforces Round 68 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 68 [Rated for Div. 2] Hello Codeforces! On [contest_time:1194] [contest:1194] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2019-07-13] Glazov, Adilbek [user:adedalic,2019-07-13] Dalabaev, Vladimir [user:Vovuh,2019-07-13] Petrov, Ivan [user:Bl...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +227
  • Vote: I do not like it

241.
Educational Codeforces Round 186 [Rated for Div. 2]
By awoo, history, 10 months ago, translation, In English
Educational Codeforces Round 186 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Computer Science and Artificial Intelligence (CSAI)] (https://lp.jetbrains.com/academy/csai-program/) program at [Neapolis University Pafos](https://www.nup.ac.cy/), with scholarships provided by JetBrains. [contest:2182] will start on [contest_time:2182]. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6-7 problems** and **2 hours** to solve them. The problems were invent...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +377
  • Vote: I do not like it

242.
Educational Codeforces Round 80 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 80 [Rated for Div. 2] Hello Codeforces! On [contest_time:1288] [contest:1288] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-01-13] Glazov, Adilbek [user:adedalic,2020-01-13] Dalabaev, Vladimir [user:Vovuh,2020-01-13] Petrov, Ivan [user:Bl...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +210
  • Vote: I do not like it

243.
Educational Codeforces Round 56 [Rated for Div. 2]
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 56 [Rated for Div. 2] Hello Codeforces! On [contest_time:1093] [contest:1093] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Ajosteen,2018-12-14] Glazov, Adilbek [user:adedalic,2018-12-14] Dalabaev, Vladimir [user:Vovuh,2018-12-14] Petrov, Ivan...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +142
  • Vote: I do not like it

244.
Educational Codeforces Round 83 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 83 [Rated for Div. 2] Hello Codeforces! On [contest_time:1312] [contest:1312] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-03-08] Glazov, Adilbek [user:adedalic,2020-03-08] Dalabaev, Vladimir [user:vovuh,2020-03-08] Petrov, Ivan [user:Bl...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +207
  • Vote: I do not like it

245.
Educational Codeforces Round 76 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 76 [Rated for Div. 2] Hello Codeforces! On [contest_time:1257] [contest:1257] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2019-10-23] Glazov, Adilbek [user:adedalic,2019-10-23] Dalabaev, Vladimir [user:Vovuh,2019-10-23] Petrov, Ivan [user:Bl...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +204
  • Vote: I do not like it

246.
Codeforces Round #948 (Div. 2)
By Stefan2417, 2 years ago, translation, In English
Codeforces Round #948 (Div. 2) Привет, Codeforces! Спустя год ожиданий и нескольких полных изменений набора задач я рад пригласить вас принять участие в [contest:1977], который состоится в воскресенье, [contest_time:1977]. Раунд будет **рейтинговым для участников с рейтингом менее 2100**. Участники из первого дивизиона приглашены принять участие в раунде вне конкурса. Вам будет дано **5 задач и 2 часа**, чтобы их решить. Все задачи раунда придуманы и подготовлены [user:Stefan2417,2024-05-23] и [user:alexchist,2024-05-23]. **В раунде может встретиться 1 или более интерактивных задач**. Рекомендуем прочитать этот [пост](https://codeforces.me/blog/entry/45307). Также я хочу поблагодарить: - [user:vladithur,2024-05-23] за отличную координацию раунда! - [user:A_G,2024-05-23], [user:justnik77,2024-05-23], [user:AgafonovArtem,2024-05-23], [user:MADKIRUS,2024-05-23], [user:AndreyPavlov,2024-05-23], [user:PBBx0,2024-05-23], [user:Alexdat2000,2024-05-23], [user:RP-1,2024-05-23], [user:mwen,2024-05-25], [u...
will be rated for participants whose rating is below 2100**. Participants with higher ratings may, для участников с рейтингом менее 2100**. Участники из первого дивизиона приглашены принять участие в

Full text and comments »

  • Vote: I like it
  • +273
  • Vote: I do not like it

247.
Codeforces Round 1022 (based on LCOSHP, Div. 2)
By eugenechka.boyko.2_0-0, 18 months ago, translation, In English
Codeforces Round 1022 (based on LCOSHP, Div. 2) こんにちは, Codeforces! ======================== Со времени нашего первого раунда мы многому научились, и поэтому рады пригласить вас принять участие в [Codeforces Round 1022 (Div. 2)](https://codeforces.me/contest/2108), который пройдет в [contest_time:2108]. Раунд будет состоять из **6 OR 7 задач** <s>на реализацию с Leetcode</s>, где **OR** означает операцию побитового «мы не знаем», и **2 часа** на их решение. Некоторые из задач раунда могут быть интерактивными, с их более подробным описанием можно ознакомиться [здесь](https://codeforces.me/blog/entry/45307). Раунд будет рейтинговым **для всех участников с рейтингом ниже 2100**, однако все участники с более высоким рейтингом могут принять участие вне конкурса. Раунд полностью основан на задачах Липецкой командной олимпиады школьников (ЛКОШП), прошедшей недавно в, внезапно, Липецке, поэтому **мы настоятельно просим всех участников олимпиады воздержаться от написания раунда**. Все задачи были придуманы и подготовлены [user:...
The round will be rated **for all participants with a rating below 2100**, but everyone is welcome, Раунд будет рейтинговым **для всех участников с рейтингом ниже 2100**, однако все участники с более

Full text and comments »

  • Vote: I like it
  • +179
  • Vote: I do not like it

248.
Educational Codeforces Round 154 [Rated for Div. 2]
By awoo, history, 3 years ago, translation, In English
Educational Codeforces Round 154 [Rated for Div. 2] Hello Codeforces! On [contest_time:1861] [contest:1861] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="https://mirror.codeforces.com/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2023-08-30] Dalabaev, Ivan [user:BledDest,2023-08-30] Androsov, Maksim [user:Neon,2023-08-30] Mesch...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +112
  • Vote: I do not like it

249.
Correlation between Math and CP skill results
By SlavicG, 5 years ago, In English
Correlation between Math and CP skill results Hello Codeforces! Here are the results of the [poll](https://codeforces.me/blog/entry/99335) I made a week ago! Because of the small sample size of 500 responses and a lot of other factors I am pretty sure the results aren't the most accurate, so take them with a grain of salt. Anyway, let's start with the direct correlation table, for each of these items in the table, you can see the dependency level on the items represented as numbers between in the range [-1, 1], -1 meaning complete inverse correlation and 1 complete correlation, as the absolute value decreases the correlation decreases as well. ![ ](https://media.discordapp.net/attachments/705371983650619454/937802246064865341/bandicam_2022-01-31_22-10-56-716.jpg?width=773&height=255) As we can see, there isn't that strong of a correlation, the strongest for rating being the people who practiced for math Olympiads and participated in national ones. Now, here are results individual for rating ranges: <spoiler s...
#### Math level:

Full text and comments »

  • Vote: I like it
  • +64
  • Vote: I do not like it

250.
Codeforces Round 1026 (Div. 2)
By PvPro, history, 18 months ago, translation, In English
Codeforces Round 1026 (Div. 2) ### Привет, Codeforces! Мы рады пригласить Вас на [contest:2110], который состоится [contest_time:2110]. Этот раунд будет рейтинговым для всех участников с рейтингом меньше 2100. У вас будет 2 часа для решения 6 задач. Задачи были подготовлены [user:XaRDKoDblCH,2025-05-20] и [user:PvPro,2025-05-20]. Мы хотели бы поблагодарить всех, кто сделал этот раунд возможным: - [user:FairyWinx,2025-05-20], за координирование нашего раунда и подготовкой задач. - [user:MikeMirzayanov,2025-05-20], [user:KAN, 2025-05-20] за системы Codeforces и Polygon. - Нашу армию тестеров: [user:N_z__,2025-05-21], [user:BurnedChicken,2025-05-20], [user:triple__a,2025-05-20], [user:makrav,2025-05-20],[user:Noobish_Monk,2025-05-20], [user:mainyutin,2025-05-20], [user:k1r1t0,2025-05-20], [user:Nil2007,2025-05-20], [user:zhiganov_v,2025-05-20], [user:sputn1k,2025-05-20], [user:lewc,2025-05-20], [user:larionov_kirill,2025-05-20], [user:Kmes,2025-05-20], [user:Dimozavr,2025-05-20], [user:potalov.m,2025-05...
will be rated for all participants with a rating below 2100. You will have 2 hours to solve 6 problems, рейтинговым для всех участников с рейтингом меньше 2100. У вас будет 2 часа для решения 6 задач

Full text and comments »

  • Vote: I like it
  • +419
  • Vote: I do not like it

251.
ICPC : GO FOR GOLD
By Enigma27, history, 2 years ago, In English
ICPC : GO FOR GOLD Announcing GO For Gold Campaign (Powered by NST) ---------------------------------------------------- ![ ](/predownloaded/73/25/7325e581ded85161dadf5db1850f01addfd00938.png) #### Greeting Indian ICPC contestants !! -------------------------------- India is home to some of the brightest minds in the world, and our potential is undeniable. Yet we have a long way to go regarding Competitive Programming at ICPC. While Indian teams have shown great promise by reaching to World Finals but getting a medal is still something which we are still trying to achieve. But with our current talent and potential, we can and will achieve this. At NST, we believe the potential exists, and what’s needed is structured guidance, consistent mentorship, and a platform to hone these skills under expert supervision. That’s why we created Go For Gold, a program focused on building a culture of competitive programming excellence in India, not just for one college or a year, but as a long-term init...
**2. Average rating of your team (~1800+ for div2 and ~2100+ for div1 with some advantage for 2nd

Full text and comments »

  • Vote: I like it
  • +167
  • Vote: I do not like it

252.
Educational Codeforces Round 130 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 130 [Rated for Div. 2] Hello Codeforces! On [contest_time:1697] [contest:1697] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2022-06-11] Dalabaev, Vladimir [user:vovuh,2022-06-11] Petrov, Ivan [user:BledDest,2022-06-11] Androsov, Mak...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +150
  • Vote: I do not like it

253.
Educational Codeforces Round 69 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 69 [Rated for Div. 2] Hello Codeforces! On [contest_time:1197] [contest:1197] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2019-07-13] Glazov, Adilbek [user:adedalic,2019-07-13] Dalabaev, Vladimir [user:Vovuh,2019-07-13] Petrov, Ivan [user:Bl...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +172
  • Vote: I do not like it

254.
Educational Codeforces Round 58 [Rated for Div. 2]
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 58 [Rated for Div. 2] Hello Codeforces! On [contest_time:1101] [contest:1101] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2019-01-10] Glazov, Adilbek [user:adedalic,2019-01-10] Dalabaev, Vladimir [user:Vovuh,2019-01-10] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +215
  • Vote: I do not like it

255.
Codeforces Round #721 (Rated for Div2)
By the_nightmare, history, 5 years ago, In English
Codeforces Round #721 (Rated for Div2) Hi, Codeforces! I'm glad to invite you to take part in [Codeforces Round #721 (Div. 2)](https://codeforces.me/contests/1527), which will take place on [contest_time:1527]. The round will be **rated for the participants with a rating lower than 2100**. Participants from the first division are also welcomed to take part in the competition but it will be unrated for them. You will be given **2 hours** to solve **5-6 problems**. Problems were created by members of Club of Programmers IIT (BHU)- [user:rivalq,2021-05-18], [user:sharabhagrawal25,2021-05-18], [user:loud_mouth,2021-05-18], [user:DenOMINATOR,2021-05-18], [user:Bignubie,2021-05-19], [user:mallick630,2021-05-18], [user:shikhar7s,2021-05-18], [user:CoderAnshu,2021-05-19] and Me. Huge thanks to those who helped make this round possible: - [user:Aleks5d,2021-05-18] and [user:KAN,2021-05-18] for their excellent coordination and for providing priceless feedback during contest creation. - [user:1-gon,2021-05-18], [u...
participants with a rating lower than 2100**. Participants from the first division are also welcomed to take

Full text and comments »

  • Vote: I like it
  • +314
  • Vote: I do not like it

256.
Google Code Jam Difficulty Estimation — 2021 Round 1A
By areo, history, 6 years ago, In English
Google Code Jam Difficulty Estimation — 2021 Round 1A **td,dr**: A1 800, A2 1500, B1 1500, B2 1700, B3 2000, C1 1900, C2 2100, C3 3000. You needed around 2000 rating to have a 50% prob of advancing to round 2. Hi everyone. GCJ round 1A took place yesterday. If you didn't participate, you may be wondering how hard it was, and what are your chances to pass round 1B or 1C and qualify for round 2. I provide below my estimate of the difficulty of the problems. The data and methods are the same I described in my previous [post](https://codeforces.me/blog/entry/89276). I am sure there is room for improvement, so again I welcome any feedback. ### Method 1: The 50% Bucket #### Approach and Data Please see my previous [post](https://codeforces.me/blog/entry/89276) for an explanation. In short, I use the fact that you have a 50% probability to solve a problem with difficulty equal to your rating. I divide the contestants into buckets of rating, wide 100 points, and I check for which bucket 50% of the coders solved the p...
A1 800, A2 1500, B1 1500, B2 1700, B3 2000, C1 1900, C2 2100, C3 3000.

Full text and comments »

  • Vote: I like it
  • +246
  • Vote: I do not like it

257.
Codeforces Round #662 (Div. 2)
By AlFlen, 6 years ago, translation, In English
Codeforces Round #662 (Div. 2) Hello, Codeforces! [user:74TrAkToR,2020-08-05] and I are glad to invite you to our [contest:1393], which will be held at [contest_time:1393]. <b>The round will be rated for all the participants with rating strictly less than 2100.</b> The problems were created and prepared by [user:AlFlen,2020-08-05] and [user:74TrAkToR,2020-08-05]. We would also like to thank everyone who helped us a lot with round preparation. <ul style="list-style-type:square"> <li>Our coordinator [user:300iq,2020-08-05] for patience and help with ideas.</li> <li>Our dear friend [user:lapochka_queen,2020-08-05] for the idea of one of the tasks.</li> <li>Our testers [user:isaf27,2020-08-05], [user:Astralpirate,2020-08-05], [user:sava-cska,2020-08-05], [user:Siberian,2020-08-05], [user:voventa,2020-08-05], [user:romanasa,2020-08-05], [user:antontrygubO_o,2020-08-05], [user:DIvanCode,2020-08-05], [user:_overrated_,2020-08-05], [user:Mlxa,2020-08-05], [user:gerasikov.fml31,2020-08-05], [user:Prokhor08,2020-0...
less than 2100.

Full text and comments »

  • Vote: I like it
  • +229
  • Vote: I do not like it

258.
Codeforces Round #956 (Div. 2) and ByteRace 2024
By MrSavageVS, history, 2 years ago, In English
Codeforces Round #956 (Div. 2) and ByteRace 2024 Hello, Codeforces! NJACK — the Computer Science Club of IIT Patna is excited to invite you to [contest:1983] under Celesta — the annual Techno-Management Fest of IIT Patna. The contest will take place on [contest_time:1983]. This round will be rated for participants with rating lower than 2100. ![ ](https://images-ext-1.discordapp.net/external/L1xYMgPtJP9oVmm36rEiuofGwkP2O4yWmiT4UIzvRjU/https/i.imgur.com/v8rvBEJ.png?format=webp&quality=lossless) Many thanks to all the people who made this round possible: - The problems were autho<span style="color:#e31919;">r</span>ed and prepared by [user:AwakeAnay,2024-07-05], [user:ShivanshJ,2024-07-05], [user:TimeWarp101,2024-07-05], [user:DC17,2024-04-12], [user:BlazingDragon,2024-07-05], [user:Swap-nil,2024-07-05], [user:Pew_Pew.,2024-07-05] and [me](https://codeforces.me/profile/MrSavageVS). - Spec<span style="color:#e31919;">i</span>al thanks to [user:ScarletS,2024-06-01] for <span style="color:#e31919;">c</span>oordinating ...
rating lower than 2100.

Full text and comments »

  • Vote: I like it
  • +211
  • Vote: I do not like it

259.
Codeforces Round 1063 (Div. 2) Announcement
By SpyrosAliv, 12 months ago, In English
Codeforces Round 1063 (Div. 2) Announcement <h5>Καλησπέρα, Codeforces!</h5> I am very excited to invite you to participate in [contest:2163], which will take place on [contest_time:2163]. <b>Please note the unusual starting time (30 minutes after the standard starting time)</b>. You will be given 5 problems and 2 hours to solve them.<b> At least one problem will be interactive</b>, so please make sure to read the <a href="https://codeforces.me/blog/entry/45307">guide for interactive problems</a> before the contest. This round will be rated for all participants with rating below 2100. The problems were authored by me, and prepared by [user:Proof_by_qed,2025-11-03] and me. We are also excited to announce that: <h5>This will be the first rated round to feature a <b>communication problem</b>.</h5> Make sure that you are familiar with the problem format of communication problems. Recently, [contest:2168] was held in order to introduce this new type of problems. Please read the <a href="https://codeforces.me/blog/entry...
below 2100. The problems were authored by me, and prepared by [user:Proof_by_qed,2025-11-03] and me

Full text and comments »

  • Vote: I like it
  • +304
  • Vote: I do not like it

260.
Educational Codeforces Round 156 [Rated for Div. 2]
By awoo, history, 3 years ago, translation, In English
Educational Codeforces Round 156 [Rated for Div. 2] Hello Codeforces! On [contest_time:1886] [contest:1886] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="https://mirror.codeforces.com/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2023-10-08] Dalabaev, Ivan [user:BledDest,2023-10-08] Androsov, Maksim [user:Neon,2023-10-08] Mesch...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +101
  • Vote: I do not like it

261.
Educational Codeforces Round 192 [рейтинговый для Div. 2]
By BledDest, 4 months ago, translation, In English
Educational Codeforces Round 192 [рейтинговый для Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 150px; margin: 10px; max-width:40%;"/> Привет, Codeforces! Благодаря поддержке [Neapolis University Pafos](https://www.nup.ac.cy/bsc-in-computer-science-and-artificial-intelligence), продолжается серия образовательных раундов. Университет предлагает получение степени бакалавра в области компьютерных наук и искусственного интеллекта со [стипендиями JetBrains](https://lp.jetbrains.com/academy/csai-program/). Получите передовые навыки в области искусственного интеллекта и машинного обучения, которые подготовят вас к востребованным техническим карьерам. Доступно ограниченное количество стипендий. Не упустите свой шанс учиться в Европе бесплатно! В [contest_time:2242] состоится [contest:2242]. Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет проводиться по немного расширенным правилам ICPC. Штраф за ...
Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +111
  • Vote: I do not like it

262.
Codeforces Round 1003 (Div. 4) Editorial
By Proof_by_QED, 21 month(s) ago, In English
Codeforces Round 1003 (Div. 4) Editorial <spoiler summary="Rating Predictions"> | Predictor | A | B | C1 | C2 | D | E | F | G | H | |--------------------------------------------|------|------|------|------|------|------|------|------|------| | [user:Proof_By_QED,2025-02-04] | 800 | 800 | 900 | 1300 | 1200 | 1500 | 1700 | 1800 | 2100 | | [user:DivinePunishment,2025-02-04] | 800 | 1000 | 900 | 1400 | 1400 | 1400 | 1600 | 1700 | | | [user:poi,2025-02-04] | 800 | 800 | 800 | 1000 | 1200 | 1200 | 1700.223 | 1600 | Didn't solve so $\infty$ | | [user:mathtsai,2025-02-04] | 800 | 900 | 1000 | 1200 | 1400 | 1500 | 1700 | 1600 | | | [user:macaquedev,2025-02-04] | 800 | 800 | 800 | 900 | 1200 | 1300 | 1400 | 1400 | | | [user:Intellegent,2025-02-04] | 800 | 800 | 900 | 1100 | 1300 | 1500 | 1700 | 1800 | 2100 | | [user:cry,2025-01-15] | 800 | 800 | 900 | 1100 | 1300 | ...
] | 800 | 800 | 900 | 1300 | 1200 | 1500 | 1700 | 1800 | 2100 | | [user:DivinePunishment,2025

Full text and comments »

  • Vote: I like it
  • +38
  • Vote: I do not like it

263.
Codeforces Round 951 (Div. 2)
By iNNNo, history, 2 years ago, In English
Codeforces Round 951 (Div. 2) <h2>Привет, Codeforces!</h2> ------------------ Я рад пригласить вас принять участие в [contest:1979], который состоится в [contest_time:1979]. Этот раунд будет **рейтинговым** для участников, чей рейтинг ниже 2100. Участники с более высоким рейтингом могут принять участие вне конкурса. Вам будет предложено **6 задач** и **2 часа** на их решение! В раунде могут быть **интерактивные задачи**. Рекомендуем прочитать этот [пост](https://codeforces.me/blog/entry/45307). Все задачи были придуманы и подготовлены мной. Хочу выразить особенную благодарность [user:Greg908,2024-06-05] за обсуждение новых идей по задачам и незаменимую обратную связь. Я хочу поблагодарить: - [user:Artyom123,2024-06-05] за чудесную координацию раунда! - [user:74TrAkToR,2024-06-05] за первоначальную помощь в подготовке раунда. - [user:isaf27,2024-06-05] за черно-красное тестирование раунда. - [user:dorijanlendvaj,2024-06-05], [user:A_G,2024-06-05], [user:Mangooste,2024-06-05], [user:andre...
This round will be **rated** for participants with a rating below **2100**. Participants with a, Этот раунд будет **рейтинговым** для участников, чей рейтинг ниже 2100. Участники с более высоким

Full text and comments »

  • Vote: I like it
  • +179
  • Vote: I do not like it

264.
Codeforces Round 1115 (Div. 2)
By Bufu, 3 months ago, In English
Codeforces Round 1115 (Div. 2) # *Hello, Codeforces!* We are excited to invite you to participate in [Codeforces Round 1115 (Div. 2)](https://codeforces.me/contest/2252), which will take place on [contest_time:2252]. The round will be **rated for all participants with a rating below 2100**. Participants from Division 1 are warmly welcome to participate unofficially. You will be given **6 problems** and **2 hours** to solve them. The round was prepared by [user:TomitaMatei,2026-07-30] and me, [user:ItsBufu,2026-07-30]. We would like to express our deepest gratitude to everyone who made this round possible: * [user:cry,2026-07-30] for their excellent coordination and infinite patience while reviewing the problems! * [user:Alexdat2000,2026-08-04] for translating the statements to Russian. * [user:Um_nik,2026-07-30] and [user:KAN,2026-07-30] for pre-reviewing the round! * Our wonderful team of testers for solving the problems and providing highly valuable feedback: [user:Intellegent,2...
The round will be **rated for all participants with a rating below 2100**. Participants from

Full text and comments »

  • Vote: I like it
  • +184
  • Vote: I do not like it

265.
Nebius Round 2 and Codeforces Round 1088 Editorial
By Proof_by_QED, 7 months ago, In English
Nebius Round 2 and Codeforces Round 1088 Editorial <spoiler summary="Rating Predictions"> | Predictor | A | B | C | D | E | F | G | H | |----------------------------------|-----|-----|-----|------|------|------|------|------| | [user:Proof_by_QED,2026-03-27] | 800 | 1300 | (1400-2000) | 1700 | 2100 | 2400 | 2600 | 3500| | [user:nifeshe,2026-03-27] | 800 | 1400 | (1400-1900) | 1800 | 2200 | 2600 | 3000 | 3500| | [user:dinohaur,2026-03-27] | 800 | 1200 | (1400-1700) | 2100 | 2300 | 2600 | 2900 | 3300 | | [user:_istil,2026-03-27] | 800 | 1200 | (1300-1800) | 1900 | 2300 | 2500 | 2800 | 3300 | | [user:Dragos,2026-03-27] | 800 | 1400 | (1400-1900) | 1800 | 2100 | 2400 | 2800 | 3500 | | [user:Argentum47,2026-03-27] | 800 | 1300 | (1400-2000) | 1900 | 2200 | 2500 | ? | ? | | [user:simplelife,2026-03-27] | 800 | 1200 | (1200-1800) | 1600 | 2000 | 2500 | 6700 | 6700 | | [user:AksLolCoding,2026-03-27] | 800 | 1000 | (1100-1800) | 1600 | 1900 | 2400 | ? | ? | | [user:nik_exists,2026-03-27]...
,2026-03-27] | 800 | 1300 | (1400-2000) | 1700 | 2100 | 2400 | 2600 | 3500| | [user:nifeshe,2026-03

Full text and comments »

  • Vote: I like it
  • +48
  • Vote: I do not like it

266.
Educational Codeforces Round 47 [Rated for Div. 2]
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 47 [Rated for Div. 2] Hello Codeforces! On [contest_time:1009] Educational Codeforces Round 47 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM ICPC rules. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Ivan [user:BledDest,2018-07-13] Androsov, Vladimir [user:Vovuh,2018-07-13] Petrov, Maksim [user:Ne0n25,2018-07-13] Mescheryakov, Aslan [user:ag2cidk,2018-07-13] Tamaev and me. Good luck to all participants! ...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +168
  • Vote: I do not like it

267.
Codeforces Round #682 (Div. 2)
By shashwatchan, 6 years ago, In English
Codeforces Round #682 (Div. 2) Good Evening Codeforces! ^_^ This round is unrated; please read [this](https://codeforces.me/blog/entry/84595) to know why. I invite you to participate in [Codeforces Round #682 (Div.2)](https://codeforces.me/contests/1438) taking place on [contest_time:1438]. The round, authored by [user:Anti-Light,2020-11-11] and me, is rated for users rated less than 2100, while other users can participate non-competitively. The round features six problems, and you have 2 hours to solve them. There may, or may not, be an interactive problem; regardless, you should [know](https://codeforces.me/blog/entry/45307) how to deal with them. I would, now, like to thank– - [user:antontrygubO_o,2020-07-31] for coordination. - [user:AwakeAnay,2020-07-31] and [user:AsleepAdhyyan,2020-07-31] for helping me solve one of the problems. - [user:BRCode,2020-08-03] for making [3b1b-style](https://youtube.com/channel/UCSQmpb_K_I37JN-QLArZbFw) video editorials of the problems! - [user:knightron00,...
, is rated for users rated less than 2100, while other users can participate non-competitively.

Full text and comments »

  • Vote: I like it
  • +240
  • Vote: I do not like it

268.
Educational Codeforces Round 120 [Rated for Div. 2]
By awoo, history, 5 years ago, translation, In English
Educational Codeforces Round 120 [Rated for Div. 2] Hello Codeforces! On [contest_time:1622] [contest:1622] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2021-12-26] Dalabaev, Vladimir [user:vovuh,2021-12-26] Petrov, Ivan [user:BledDest,2021-12-26] Androsov, Mak...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +422
  • Vote: I do not like it

269.
Educational Codeforces Round 193 [рейтинговый для Div. 2]
By BledDest, 3 months ago, translation, In English
Educational Codeforces Round 193 [рейтинговый для Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 150px; margin: 10px; max-width:40%;"/> Привет, Codeforces! Благодаря поддержке [Neapolis University Pafos](https://www.nup.ac.cy/bsc-in-computer-science-and-artificial-intelligence), продолжается серия образовательных раундов. Университет предлагает получение степени бакалавра в области компьютерных наук и искусственного интеллекта со [стипендиями JetBrains](https://lp.jetbrains.com/academy/csai-program/). Получите передовые навыки в области искусственного интеллекта и машинного обучения, которые подготовят вас к востребованным техническим карьерам. Доступно ограниченное количество стипендий. Не упустите свой шанс учиться в Европе бесплатно! В [contest_time:2253] состоится [contest:2253]. Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет проводиться по немного расширенным правилам ICPC. Штраф за ...
Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +103
  • Vote: I do not like it

270.
Educational Codeforces Round 157 [Rated for Div. 2]
By awoo, history, 3 years ago, translation, In English
Educational Codeforces Round 157 [Rated for Div. 2] Hello Codeforces! On [contest_time:1895] [contest:1895] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="https://mirror.codeforces.com/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2023-11-02] Dalabaev, Ivan [user:BledDest,2023-11-02] Androsov, Maksim [user:Neon,2023-11-02] Mesch...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +107
  • Vote: I do not like it

271.
Codeforces Round #809 Editorial
By BucketPotato, history, 4 years ago, In English
Codeforces Round #809 Editorial ## Some stats about the round <spoiler summary="Pre-contest predictions"> | Person | A | B | C | D1 | D2 | E | | ----- | ------ | -------- | -------- | -------- | -------- | -------- | | [user:BucketPotato,2022-07-17] | 900 | 1200 | 1400 | 1600 | 2000 | 2200 | | [user:lunchbox,2022-07-17] | 800 | 1300 | 1200 | 2000 | 2400 | 2300 | | [user:lce4113,2022-07-17] | 1000 | 1400 | 1400 | | | | | [user:lethan3,2022-07-17] | 800 | 1000 | 1200 | 1500 | 2000 | | | [user:Apple_Method,2022-07-17] | 800 | 1200 | 1200 | 2100 | 2500 | 2400 | | [user:izhang,2022-07-17] | 800 | 1200 | 1400 | 1600 | 2200 | | | [user:EnDeRBeaT,2022-07-17] | 800 | 1300 | 1500 | 1700 | 2000 | 2200 | | [user:Runtime-Terr0r,2022-07-17] | 800 | 1200 | 1400 | 1800 | | | | [user:AlperenT,2022-07-17] | 800 | 1100 | 1400 | 1900 | 2400 | 2200 | | | A | B | C | D1 | D2 | E | | ----- | ------ | -------- | -------- | -------- | -------- | -------- | | Average | 833 | 1211 | 1344 | 1775 | 2214 | 2260 | | Actual | 80...
| 1000 | 1200 | 1500 | 2000 | | | [user:Apple_Method,2022-07-17] | 800 | 1200 | 1200 |2100 | 2500

Full text and comments »

  • Vote: I like it
  • +291
  • Vote: I do not like it

272.
Good Bye 2024: 2025 is NEAR Editorial
By _istil, 2 years ago, In English
Good Bye 2024: 2025 is NEAR Editorial Thank you for participating in this round! Problems A and G are authored by [user: Cocoly1990,2024-11-23] and the rest by me. Currently, I'm not sure if the editorials are fine enough. Please feel free to tell me where I can improve. <spoiler summary=" Rating Predictions"> | | A | B | C | D | E | F | G | H | I | | :--------------------------------: | :--: | :---------: | :--: | :----------: | :--: | :--: | :----------: | :--: | :----------: | | [user:wyrqwq,2024-12-20] | 800 | 1200 | 1400 | 1700 | 1900 | 2500 | [2800, 3300] | 3200 | [800, 3000] | | [user:Cocoly1990,2024-12-20] | 800 | 1300 | | | | | 3000 | | | | [user:TheScrasse,2024-12-20] | 800 | 1200 | ? | 1800 | | 2500 | 3000 | 3000 | 3500 | | [user:LMydd0225,2024-12-20] | 800 | ...
| 3500 | | [user:LMydd0225,2024-12-20] | 800 | 1300 | 1600 | 1900 | 2100

Full text and comments »

  • Vote: I like it
  • +59
  • Vote: I do not like it

273.
Educational Codeforces Round 148 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 148 [Rated for Div. 2] Hello Codeforces! On [contest_time:1832] [contest:1832] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://mirror.codeforces.com/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2023-05-11] Dalabaev, Ivan [user:BledDest,2023-05-11] Androsov, Maksim [user:Neon,2023-05-11] Mesche...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +68
  • Vote: I do not like it

274.
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + 2) Editorial
By omsincoconut, 3 weeks ago, In English
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + 2) Editorial <spoiler summary="Rating predictions"> | Predictor | A | B | C | D1 | D2 | E | F1 | F2 | G | H | |-----------|---|---|---|----|----|---|----|----|---|---| | Predicted | 486 | 927 | 839 | 1160 | 2236 | 1694 | 2406 | 3639 | 2607 | 3250 | | [user:nifeshe,2026-10-18] | 800 | 900 | 1100 | 1400 | 2600 | 2000 | 2500 | 3500 | 2900 | 3400 | | [user:ttamx,2026-10-18] | 800 | 1000 | 1200 | 1400 | 2500 | 1800 | 2100 | 3500 | 2800 | 3100 | | [user:ItzSleepyXD,2026-10-18] | ? | ? | 1000 | ? | ? | ? | 2100 | 2800 | ? | ? | | [user:simplelife,2026-10-18] | 800 | 1000 | 1100 | 1500 | ? | 1900 | 2300 | 3500 | ? | 3000 | | [user:wakanda-forever,2026-10-18] | 900 | 1000 | 1100 | ? | ? | 2000 | 2100 | ? | ? | ? | | [user:Marszpace,2026-10-18] | 800 | 1000 | 1100 | 1500 | ? | 1900 | ~2200 | ? | ? | ? | | [user:Argentum47,2026-10-18] | 800 | 1200 | 1200 | 1600 | ? | 1900 | 2300 | ? | ? | 2700 | | [user:omsincoconut,2026-10-18] | 800 | 1100 | 1300 | ? | ? | ? | 2400 | 3500 | 2600 | 3100 | | [user:...
| 1800 | 2100 | 3500 | 2800 | 3100 | | [user:ItzSleepyXD,2026-10-18] | ? | ? | 1000

Full text and comments »

  • Vote: I like it
  • +135
  • Vote: I do not like it

275.
USACO Division vs. Codeforces Rating
By ezraft, 4 years ago, In English
USACO Division vs. Codeforces Rating Recently, I put out a poll in the unofficial USACO server to collect data about which USACO divisions correspond to each Codeforces rating (and vice versa). This blog contains the results of that study. General Thoughts ---------------- In total, I collected data from 116 survey participants across all 4 divisions. The data was collected after the February USACO contest, so it may not be fully up to date; I had planned to release the results earlier, but it took about a month total to get the results <strike>(and then I didn't really have time to compile the results for a few weeks)</strike>. I only got about 5 responses from the Bronze division, so I chose not to make any estimates from those responses. Since Bronze is the lowest division, it is possible that many Bronze competitors don't even have Codeforces accounts (or do not compete regularly in contests). Some bias in the survey could come from ratings that had not converged yet or the method of sampling (I wasn't abl...
campers appear to be between $2100$ and $2600$ Codeforces rating.

Full text and comments »

  • Vote: I like it
  • +115
  • Vote: I do not like it

276.
Educational Codeforces Round 66 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 66 [Rated for Div. 2] Hello Codeforces! On [contest_time:1175] [contest:1175] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2019-06-04] Glazov, Adilbek [user:adedalic,2019-06-04] Dalabaev, Vladimir [user:Vovuh,2019-06-04] Petrov, Ivan [user:Bl...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +181
  • Vote: I do not like it

277.
Educational Codeforces Round 141 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 141 [Rated for Div. 2] Hello Codeforces! On [contest_time:1783] [contest:1783] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2023-01-07] Dalabaev, Vladimir [user:vovuh,2023-01-07] Petrov, Ivan [user:BledDest,2023-01-07] Androsov, Ma...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +89
  • Vote: I do not like it

278.
Educational Codeforces Round 175 [Rated for Div. 2]
By awoo, history, 20 months ago, translation, In English
Educational Codeforces Round 175 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Neapolis University Pafos](https://www.nup.ac.cy/). On [contest_time:2070] [contest:2070] will start. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2025-02-26] Dalabaev, Ivan [user:BledDest,2025-02-26] Androsov, Maksim [user:Neon,2025-02-26] Mescheryakov and...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +61
  • Vote: I do not like it

279.
Codeforces Round #807 (Div. 2)
By MarkBcc168, 4 years ago, In English
Codeforces Round #807 (Div. 2) Hello Codeforces, We are glad to invite you to [contest:1705], which will be held on [contest_time:1705]. As usual, the round will be rated for participants with ratings lower than 2100, while those who have higher ratings are encouraged to participate unofficially. **Please note the unusual start time.** You will be given **6 problems** to be solved in **2 hours and 15 minutes**. There may or may not be interactive problems, so you are encouraged to prepare in case they do appear by reading [this guide](https://codeforces.me/blog/entry/45307). The round is authored by [user:abc241,2022-07-12] and me, while joining us is also [user:inwbearX,2022-07-12] who contributed significantly to the preparation. This is our first time setting rounds in Codeforces, and it wouldn't be possible if there were no support from the following people. - [user:errorgorn,2022-07-12] for fantastic coordination. - [user:KAN,2022-07-12], [user:lackadaisical_lad,2022-07-15], [user:geranazavr555,20...
, the round will be rated for participants with ratings lower than 2100, while those who have higher

Full text and comments »

  • Vote: I like it
  • +280
  • Vote: I do not like it

280.
Educational Codeforces Round 169 [рейтинговый для Div. 2]
By awoo, history, 2 years ago, translation, In English
Educational Codeforces Round 169 [рейтинговый для Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 150px; margin: 10px; max-width:40%;"/> Привет, Codeforces! Благодаря поддержке [Neapolis University Pafos](https://www.nup.ac.cy/bsc-in-computer-science-and-artificial-intelligence), продолжается серия образовательных раундов. Университет предлагает получение степени бакалавра в области компьютерных наук и искусственного интеллекта со [стипендиями JetBrains](https://lp.jetbrains.com/academy/csai-program/). Получите передовые навыки в области искусственного интеллекта и машинного обучения, которые подготовят вас к востребованным техническим карьерам. Любопытно? Ознакомьтесь с [учебной программой](https://drive.google.com/file/d/19I776O8NG07ie2Q14wwBspuh3De4kbHc/view) прямо сейчас. Доступно ограниченное количество стипендий. Не упустите свой шанс учиться в Европе бесплатно! В [contest_time:2004] состоится [contest:2004]. Этот раунд будет **ре...
Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +90
  • Vote: I do not like it

281.
Educational Codeforces Round 82 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 82 [Rated for Div. 2] Hello Codeforces! On [contest_time:1303] [contest:1303] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-02-11] Glazov, Adilbek [user:adedalic,2020-02-11] Dalabaev, Vladimir [user:Vovuh,2020-02-11] Petrov, Ivan [user:Bl...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +167
  • Vote: I do not like it

282.
Codeforces Round #1078 (Div.2, based on Moscow Olympiad for Young Students, rated)
By TheEvilBird, 9 months ago, translation, In English
Codeforces Round #1078 (Div.2, based on Moscow Olympiad for Young Students, rated) Hello, Codeforces! This Sunday there will be a Moscow Olympiad for Young Students. This contest is prepared by Moscow Olympiad Scientific Committee that you may know by Moscow Open Olympiad, Moscow Team Olympiad, Metropolises Olympiad and All-Russian olympiad in the name of Keldysh. We are glad to invite you to [contest:2194] based on the problems of this olympiad, which will take place on [contest_time:2194]. **Note the unusual time of the round.** The round will be held according to the Codeforces rules and will be rated for all participants with rating below 2100. Problems of this competition were prepared by [user:silvvasil,2026-02-06], [user:Semen07,2026-02-06], [user:allvik66,2026-02-06], [user:dope,2026-02-06], [user:teraqqq,2026-02-06] guided by [user:TheEvilBird,2026-02-06], [user:grphil,2026-02-06] and Helen Andreeva. Thanks to [user:FairyWinx,2026-02-06] for the round coordination, and also thanks for [user:MikeMirzayanov,2026-02-06] и [user:KAN,2026-02-06] for C...
according to the Codeforces rules and will be rated for all participants with rating below2100.

Full text and comments »

  • Vote: I like it
  • +267
  • Vote: I do not like it

283.
Educational Codeforces Round 99 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 99 [Rated for Div. 2] Hello Codeforces! On [contest_time:1455] [contest:1455] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2020-11-29] Glazov, Adilbek [user:adedalic,2020-11-29] Dalabaev, Vladimir [user:vovuh,2020-11-29] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +146
  • Vote: I do not like it

284.
Codeforces Round 907 (Div. 2)
By 127.0.0.1, history, 3 years ago, translation, In English
Codeforces Round 907 (Div. 2) Привет, Codeforces! [user:max0000561,2023-10-26], [user:a.nasretdinov,2023-10-26] и я приглашаем вас на наш [contest:1891], который пройдет в [contest_time:1891]. <b>Он будет рейтинговым для всех участников, чей рейтинг будет ниже 2100</b>. От лица всей нашей команды хочу поблагодарить: <ul style="list-style-type:square"> <li>Координатора [user:74TrAkToR,2023-10-26] за бесценную помощь в подготовке раунда.</li> <li>Тестеров [user:maomao90,2023-10-26], [user:LeoPro,2023-10-26], [user:SomethingNew,2023-10-26], [user:maks_matiupatenko,2023-10-26], [user:max0000561,2023-10-26], [user:yaroslav_n,2023-10-26], [user:glebustim,2023-10-26], [user:aone_A1,2023-10-26], [user:Murinh0,2023-10-26], [user:Topperoo,2023-10-26], [user:Alarick,2023-10-26], [user:priyanshu.p,2023-10-26], [user:Greg908,2023-10-26], [user:buffering,2023-10-26], [user:ventilator13,2023-10-26], [user:medved,2023-10-26], [user:zwezdinv,2023-10-26], [user:Rodionno,2023-10-26] за качественное тестирование раунда и по...
будет ниже 2100.

Full text and comments »

  • Vote: I like it
  • +232
  • Vote: I do not like it

285.
Educational Codeforces Round 176 [Rated for Div. 2]
By awoo, history, 20 months ago, translation, In English
Educational Codeforces Round 176 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 200px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Neapolis University Pafos](https://www.nup.ac.cy/). On [contest_time:2075] [contest:2075] will start. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2025-03-16] Dalabaev, Ivan [user:BledDest,2025-03-16] Androsov, Maksim [user:Neon,2025-03-16] Mescheryakov, Al...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +60
  • Vote: I do not like it

286.
Infoleague Spring 2022 Round Editorial
By Gheal, 5 years ago, In English
Infoleague Spring 2022 Round Editorial <spoiler summary="Vote your favourite problem"> <spoiler summary="Div 2"> Div 2A &mdash; The Hatchet Div 2B &mdash; Floor Or Xor Div 2C &mdash; Yet Another Constructive Problem Didn't participate, idc </spoiler> <spoiler summary="Div 1"> Div 1A &mdash; Bamboo Coloring Div 1B &mdash; Xor Or Floor Div 1C &mdash; Jump Didn't participate, idc </spoiler> </spoiler> [103633A &mdash; The Hatchet](https://codeforces.me/gym/103633/problem/A) ------------------ Author: [user:tibinyte,2022-03-30] <spoiler summary="Rate Problem"> 1700 or less 1800 1900 2000 2100 or more Didn't solve it, idk </spoiler> <spoiler summary="Solution"> ### Subtask 1 : $N \le 10^2$ This subta...
2100 , 2100 , 2100 or more , 2100 or more

Full text and comments »

  • Vote: I like it
  • +30
  • Vote: I do not like it

287.
Educational Codeforces Round 136 [Rated for Div. 2]
By awoo, history, 4 years ago, translation, In English
Educational Codeforces Round 136 [Rated for Div. 2] Hello Codeforces! On [contest_time:1739] [contest:1739] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Adilbek [user:adedalic,2022-09-28] Dalabaev, Vladimir [user:vovuh,2022-09-28] Petrov, Ivan [user:BledDest,2022-09-28] Androsov, Mak...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +111
  • Vote: I do not like it

288.
Codeforces Round #720 (Div. 2)
By karavaiev, 6 years ago, In English
Codeforces Round #720 (Div. 2) Hi, Codeforces! I'm glad to invite you to take part in [contest:1521], which will take place on [contest_time:1521]. The round will be **rated for the participants with a rating lower than 2100**. Participants from the first division are also welcomed to take part out of competition. You will be given **2 hours 15 minutes** to solve **5 problems**. All the problems were created and prepared by me. One of the problems is interactive, please read [the guide of interactive problems](https://codeforces.me/blog/entry/45307) before the contest. Huge thanks to those who helped make this round possible: - [user:Fliahin,2021-05-05] for being the first who gave feedback and helped with ideas on some problems. - [user:Denisov,2021-05-05] for providing priceless feedback during the entire creation of the round. - [user:KAN,2021-05-05] and [user:Aleks5d,2021-05-05] for their excellent coordination. - [user:Valera_Grinenko,2021-05-05], [user:rkm62,2021-05-07], [user:PurpleCrayon,202...
]. The round will be **rated for the participants with a rating lower than 2100 **. Participants from

Full text and comments »

  • Vote: I like it
  • +273
  • Vote: I do not like it

289.
Educational Codeforces Round 60 [Rated for Div. 2]
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 60 [Rated for Div. 2] Hello Codeforces! On [contest_time:1117] [contest:1117] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extented ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2019-02-17] Glazov, Adilbek [user:adedalic,2019-02-17] Dalabaev, Vladimir [user:Vovuh,2019-02-17] Petrov, Ivan [user:B...
This round will be **rated for the participants with rating lower than 2100**. It will be held on, Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. Соревнование будет

Full text and comments »

  • Vote: I like it
  • +144
  • Vote: I do not like it

290.
Codeforces Round 1083 (Div. 2) Editorial
By Leftist_G, 9 months ago, In English
Codeforces Round 1083 (Div. 2) Editorial Thank you for participating and accompanying Simons! We hope you enjoyed the problems. <spoiler summary="Rate the contest!"> - Horrible contest - Bad contest - Average contest - Good contest - Epic contest </spoiler> <spoiler summary="Rate the difficulty!"> - Impossible contest - Hard contest - Average contest - Simple contest - Trivial contest </spoiler> <spoiler summary="Rating Predictions"> | | A | B | C | D | E | F | G | |-----| ----- | -----| -----| -----| -----| -----| -----| | [user:Leftist_G,2026-02-25] | 800 | 800 | 1400 | 2000 | 2400 | 2600 | 2900 | | [user:cool_milo,2026-02-25] | 800 | 800 | 1400 | 1800 | 2400 | 2700 | 3300 | | [user:StayAlone,2026-02-25] | 800 | 900 | 1500 | 1900 | 2300 | 2200 | 2800 | | [user:liuhangxin,2026-02-25] | 800 | 900 | 1000 | 1300 | | 2500 |...
| 1600 | 2100 | 2400 | 2600 | | [user:Error_Yuan,2026-02-25] | 800 | 1000 | 1400 | 1800 |2100 | 2400

Full text and comments »

  • Vote: I like it
  • +110
  • Vote: I do not like it

291.
Possibly Useful CP Information #3: Min/Max Abuse
By greateric, history, 5 months ago, In English
Possibly Useful CP Information #3: Min/Max Abuse I'm writing this while there's a tornado warning at Purdue but I refuse to die until I reach orange Wanted to share an idea that comes up reasonably often in my opinion. Essentially, you can take advantage of some property of the minimum or maximum of an array or some other structure to construct/calculate the answer starting from there. [2129B/2130D](https://codeforces.me/contest/2130/problem/D) &mdash; Difficulty: 1600 <spoiler summary="Hint 1"> For the index $j$ where $p_j = 1$, you must set $a_j$ to $1$ or $2n-1$. </spoiler> <spoiler summary="Hint 2"> In other words, $a_j$ will either be the minimum or maximum of the entire array. </spoiler> <spoiler summary="Hint 3"> So $a_j$ will be part of an inversion with every element to the left, or every element to the right. </spoiler> <spoiler summary="Answer"> For the index $j$ where $p_j = 1$, greedily set $a_j$ to $1$ or $2n-1$ depending on whether there would be less inversions to the left or to the right. ...
: 2100

Full text and comments »

  • Vote: I like it
  • +37
  • Vote: I do not like it

292.
Codeforces Round 1060 (Div. 2) Editorial
By Intellegent, 13 months ago, In English
Codeforces Round 1060 (Div. 2) Editorial Thank you for participating! Special thanks to [user:reirugan,2025-10-16] for writing the analysis for **B, D, E** and to [user:Proof_by_QED,2025-10-16] and [user:LMeyling,2025-10-16] for helping to optimise **F1**, leading to the creation of **F2**. <spoiler summary="Rating Predictions"> | Problem | A | B | C1 | C2 | D | E | F1 | F2 | | :--- | :---: | :---: | :---: | :---: | :---: | :---: | :---: | ---: | | [user:reirugan,2025-10-19] | 800 | 1100 | 1200 | 1600 | 1700 | 2000 | 2200 | ¯\\_(ツ)_/¯ | | [user:eric899,2025-10-19] | 800 | 1000 | 1300 | ¯\\_(ツ)_/¯ | 1600 | ¯\\_(ツ)_/¯ | ¯\\_(ツ)_/¯ | ¯\\_(ツ)_/¯ | | [user:Proof_by_QED,2025-10-19] | 800 | 1100 | 1500 | 1900 | 1600 | 2100 | 2300 | 2600 | | [user:_istil,2025-10-19] | 800 | 1100 | 1400 | 1800 | 1800 | 2100 | 2000 | 2500 | | [user:anango,2025-10-19] | 800 | 1100 | 1300 | 1900 | 1800 | 2200 | 2400 | 2700 | | [user:FzArK,2025-10-19] | 800 | 1100 | 1400 | 1800 | 1900 | ¯\\_(ツ)_/¯ | 2400 | ¯\\_(ツ)_/¯ | | [user:intel...
-19] | 800 | 1100 | 1500 | 1900 | 1600 | 2100 | 2300 | 2600 | | [user:_istil,2025-10-19] | 800

Full text and comments »

  • Vote: I like it
  • +178
  • Vote: I do not like it

293.
Codeforces Round 1075 (Div. 2)
By Fakewave, history, 10 months ago, In English
Codeforces Round 1075 (Div. 2) ### Привет, Codeforces! **<img src="/predownloaded/ad/b2/adb204ca4791dc3deabdfcd7262c867745be499e.jpg" style="width: 200.0px;float: right;margin: 0 1.0em 1.0em 1.0em;max-width: 100.0%;max-height: 100.0%;">** Мы очень рады анонсировать, что [contest:2189] пройдет в [contest_time:2189]. Раунд будет рейтинговым для всех участников с рейтингом строго меньшим $2100$. У вас будет $2$ часа, чтобы решить $6$ задач, некоторые из которых разделены на подзадачи. <strike>Раунд основан на Международной Олимпиаде по Геометрии имени Шарыгина</strike> Все задачи придуманы и подготовлены [user:yanb0,2026-01-20], [user:furt1ve,2026-01-20] и мной. Мы хотим выразить специальную благодарность этим замечательным людям: - [user:Akulyat,2026-01-20] за координирование раунда и помощь в подготовке задач; - Тестерам: [user: Wansur,2026-01-20], [user:__baozii__,2026-01-20], [user: k1r1t0,2026-01-20], [user: Mark_Pr,2026-01-20], [user:_istil,2026-01-20], [user: OG_Matveychick1,2026-01-20], [user: T...
рейтинговым для всех участников с рейтингом строго меньшим $2100$. У вас будет $2$ часа, чтобы решить $6

Full text and comments »

  • Vote: I like it
  • +176
  • Vote: I do not like it

294.
Codeforces Round #868 (Div.2)
By Igor_Parfenov, history, 4 years ago, In English
Codeforces Round #868 (Div.2) Привет! В [contest_time:1823] состоится [contest:1823]. Задачи написал и подготовил [user:Igor_Parfenov,2023-04-21]. Я хотел бы поблагодарить всех, кто сделал этот раунд возможным: - [user:awoo,2023-04-21], [user:madlogic,2023-04-21], [user:_Israel_,2023-04-21], [user:Vectors_Master,2023-04-21], [user:BabaVoss,2023-04-21], [user:AlperenT,2023-04-21], [user:FzArK,2023-04-21], [user:Dominater069,2023-04-21], [user:m0t9_,2023-04-21], [user:rui_er,2023-04-21], [user:aryan12,2023-04-21], [user:purp4ever,2023-04-21], [user:mahersefo,2023-04-21], [user:Shawerma,2023-04-21], [user:maomao90,2023-04-21], [user:satyam343,2023-04-21], [user:errorgorn,2023-04-21], [user:Glemhel,2023-04-21] за тестирование раунда и обратную связь по задачам - [user:adedalic,2023-04-21], за координацию раунда - [user:MikeMirzayanov,2023-04-21], за системы Codeforces и Polygon - Всех участников Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**. У вас будет **2 часа для решения...
Этот раунд будет **рейтинговым для участников с рейтингом менее 2100**.

Full text and comments »

  • Vote: I like it
  • +350
  • Vote: I do not like it

295.
Educational Codeforces Round 106 [Rated for Div. 2]
By awoo, history, 6 years ago, translation, In English
Educational Codeforces Round 106 [Rated for Div. 2] Hello Codeforces! On [contest_time:1499] [contest:1499] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 or 7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2021-03-17] Glazov, Adilbek [user:adedalic,2021-03-17] Dalabaev, Vladimir [user:vovuh,2021-03-17] Petrov, Ivan [us...
This round will be **rated for the participants with rating lower than 2100**. It will be held on

Full text and comments »

  • Vote: I like it
  • +132
  • Vote: I do not like it

296.
Educational Codeforces Round 75 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 75 [Rated for Div. 2] Hello Codeforces! On [contest_time:1251] [contest:1251] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2019-10-23] Glazov, Adilbek [user:adedalic,2019-10-23] Dalabaev, Vladimir [user:Vovuh,2019-10-23] Petrov, Ivan [user:Bl...
This round will be **rated for the participants with rating lower than 2100**. It will be held on

Full text and comments »

  • Vote: I like it
  • +158
  • Vote: I do not like it

297.
Codeforces Round #997 (Div. 2) Editorial
By nifeshe, 22 months ago, In English
Codeforces Round #997 (Div. 2) Editorial <spoiler summary = "Rating predictions"> | | A | B | C | D | E | F1 | F2 | |----------------------|------|-----------|---------|------|------|------|---------------| | [user:nifeshe,2025-01-17] | 800 | 1200 | 1400 | 2000 | 2200 | 2700 | 2800 | | [user:Intellegent,2025-01-17] | 800 | 1200 | 1600 | 2000 | 2300 | | | | [user:mwen,2025-01-17] | 800 | 1200 | 1300 | 1800 | 2300 | | | | [user:Markadiusz,2025-01-17] | 800 | 1100 | 1300 | 1800 | 2300 | 2500 | 2800 | | [user:_istil,2025-01-17] | 800 | | [1600, 2000] | 2000 | | 2400 | 2700 | | [user:hazzlek,2025-01-17] | 1000 | 1200 | 1500 | 2000 | 2100 | | | | [user:iLoveIOI,2025-01-17] | 800 | 1100 | 1600 | 2000 | 2400 | | | | [user:A_G,2025-01-17] | 800 | 1100 ...
| 1500 | 2000 | 2100 | | | | [user:iLoveIOI,2025-01-17] | 800 | 1100

Full text and comments »

  • Vote: I like it
  • +96
  • Vote: I do not like it

298.
Educational Codeforces Round 77 [Rated for Div. 2]
By awoo, history, 7 years ago, translation, In English
Educational Codeforces Round 77 [Rated for Div. 2] Hello Codeforces! On [contest_time:1260] [contest:1260] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 problems** and **2 hours** to solve them. The problems were invented and prepared by ZiXuan Yan [user:RDDCCD,2019-11-26], Roman [user:Roms,2019-11-26] Glazov, Adilbek [user:adedalic,2019-11-26] Dalabaev, Vladimir [user:Vo...
This round will be **rated for the participants with rating lower than 2100**. It will be held on

Full text and comments »

  • Vote: I like it
  • +92
  • Vote: I do not like it

299.
Educational Codeforces Round 62 [Rated for Div. 2]
By awoo, history, 8 years ago, translation, In English
Educational Codeforces Round 62 [Rated for Div. 2] Hello Codeforces! On [contest_time:1140] [contest:1140] will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were invented and prepared by Roman [user:Roms,2019-03-04] Glazov, Adilbek [user:adedalic,2019-03-04] Dalabaev, Vladimir [user:Vovuh,2019-03-04] Petrov, Ivan [user:Bl...
This round will be **rated for the participants with rating lower than 2100**. It will be held on

Full text and comments »

  • Vote: I like it
  • +167
  • Vote: I do not like it

300.
Codeforces Round #870 (Div. 2)
By okwedook, 4 years ago, In English
Codeforces Round #870 (Div. 2) Привет, Codeforces! Я рад пригласить вас принять участие в [Codeforces Round #870 (Div. 2)](https://codeforces.me/contest/1826), который состоится в [contest_time:1826]. Раунд будет **рейтинговым для участников с рейтингом менее 2100**. Участники из первого дивизиона могут принять участие в раунде вне конкурса. Вам будет предложено **6 задач** и **2 часа** чтобы их решить. Все задачи раунда придуманы и подготовлены мной. Одна из задач будет интерактивной, пожалуйста ознакомьтесь с [гайдом для интерактивных задач](https://codeforces.me/blog/entry/45307) перед контестом. Я также хочу поблагодарить: <ul> <li> [user:Akulyat,2023-05-04] за отличную координацию и помощь в улучшении задач! </li> <li> [user:arzhantsev64,2023-05-04], [user:InversionSpaces,2023-05-04], [user:Aleks5d,2023-05-04], [user:PO3OBAR_Bblnb,2023-05-04], [user:DanWallgun,2023-05-04], [user:Dominater069,2023-05-04], [user:AlperenT,2023-05-04], [user:Sert,2023-05-04], [user:sdl,2023-05-04], [user:Daryusz,20...
рейтингом менее 2100**. Участники из первого дивизиона могут принять участие в раунде вне конкурса.

Full text and comments »

  • Vote: I like it
  • +136
  • Vote: I do not like it

301.
Educational Codeforces Round 46 [Rated for Div. 2]
By BledDest, 8 years ago, translation, In English
Educational Codeforces Round 46 [Rated for Div. 2] Hello, Codeforces! On [June 27, 17:35 MSK](https://www.timeanddate.com/worldclock/fixedtime.html?day=27&month=6&year=2018&hour=17&min=35&sec=0&p1=166) Educational Codeforces Round 46 will start. Series of Educational Rounds continue being held as [Harbour.Space University](https://harbour.space/) initiative! You can read the details about the cooperation between [Harbour.Space University](https://harbour.space/) and Codeforces in the <a href="http://codeforces.me/blog/entry/51208">blog post</a>. As usual, the round will be **rated for the participants with rating lower than 2100**. It will be held on extented ACM ICPC rules. After the end of the contest you will have **12 hours** to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **7 problems** and **2 hours** to solve them. The problems were prepared by Adilbek [user:adedalic,2018-06-26] Dalabaev, Roman [user:Ajosteen,2018-06-26] Glazov, Mikhail [user:PikMik...
As usual, the round will be **rated for the participants with rating lower than 2100**. It will be

Full text and comments »

  • Vote: I like it
  • +182
  • Vote: I do not like it

302.
Educational Codeforces Round 177 [Rated for Div. 2]
By FelixArg, history, 19 months ago, translation, In English
Educational Codeforces Round 177 [Rated for Div. 2] <img alt="Neapolis University Pafos" src="/predownloaded/9a/33/9a332fadbb47050ba9405057df022a6e37eaf5c0.png" style="float:right;height: 150px; margin: 10px; max-width:40%;"/> Hello Codeforces! The series of Educational Rounds continues thanks to the support of the [Neapolis University Pafos](https://www.nup.ac.cy/bsc-in-computer-science-and-artificial-intelligence). On [contest_time:2086] [contest:2086] will start. This round will be **rated for the participants with rating lower than 2100**. It will be held on extended ICPC rules. The penalty for each incorrect submission until the submission with a full solution is 10 minutes. After the end of the contest, you will have 12 hours to hack any solution you want. You will have access to copy any solution and test it locally. You will be given **6 problems** and **2 hours** to solve them. The round is based on the problems from the Open Championship of Karelia in competitive programming. The problems were invente...
This round will be **rated for the participants with rating lower than 2100**. It will be held on

Full text and comments »

  • Vote: I like it
  • +199
  • Vote: I do not like it