Теперь раздел EDU доступен и на английском языке ×

Автор MagentaCobra, 5 дней назад, По-английски,

Hey everybody!

We (MagentaCobra, Tlatoani, golions, qlf9) are super excited to invite you to take part in Codeforces Round #655 (Div. 2), which will happen on Jul/11/2020 18:05 (Moscow time). 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:

There will be 6 problems and 2 hours to solve them.

We really hope you enjoy our first contest!

Полный текст »

 
 
 
 
  • Проголосовать: нравится
  • +795
  • Проголосовать: не нравится

Автор Ari, 8 дней назад, По-английски,

Hi!

On Jul/04/2020 17:45 (Moscow time) we will host Codeforces Global Round 9.

It is the third round of a 2020 series of Codeforces Global Rounds. The rounds are open and rated for everybody.

The prizes for this round:

  • 30 best participants get a t-shirt.
  • 20 t-shirts are randomly distributed among those with ranks between 31 and 500, inclusive.

The prizes for the 6-round series in 2020:

  • In each round top-100 participants get points according to the table.
  • The final result for each participant is equal to the sum of points he gets in the four rounds he placed the highest.
  • The best 20 participants over all series get sweatshirts and place certificates.

Thanks to XTX, which in 2020 supported the global rounds initiative!

The problems of this round were prepared by a team of authors: adamant, antontrygubO_o, Ari, dengyaotriangle, hugopm, Kuroni, MrDecomposition, and Ynoi. We would like to thank the following people:

You will be given 2 hours and 30 minutes to solve 9 problems, and we highly encourage you to read all of them :)

To save testers the work of writing their opinion in the comments, we have compiled some of their opinions for them!

Round Feedback

Good luck!

UPD: Score distribution:

500 — 750 — 1500 — 1750 — 2000 — 2000 — 2250 — 2750 — 4000

UPD2: Editorial

UPD3: System tests have finished, congratulations to the winners!

  1. tourist
  2. scott_wu
  3. yosupo
  4. Um_nik
  5. tEMMIE.w.
  6. lqs2015
  7. heno239
  8. Motarack
  9. zeronumber
  10. ltst

Полный текст »

 
 
 
 
  • Проголосовать: нравится
  • +2701
  • Проголосовать: не нравится

Автор ICPCNews1, история, 12 дней назад, По-английски,

text UPDATED

Dear participants!

Congratulations on joining the ICPC 2020 Graph Mining Challenge powered by Huawei! All were truly amazed by the participation and quality of the solutions. Congratulations to all of the winners! You will be contacted soon about your prizes.

The competition was so fierce that ICPC U and Huawei have decided to keep the fun going by starting a new, one-week challenge with all new prizes. The problem and graphs are the same, so you can build on your previous success. All are encouraged to participate in this challenge. You may only win one prize from the entire ICPC Graph Mining Challenge events (all combined). If you place in multiple challenges, you will be able to pick the prize you prefer.

Join ICPC Challenge: Marathon

Many of you might have been following the Challenge tutorials on ICPC U page. If you didn’t — we’re delighted to invite you to do so in order to sharpen your problem-solving skills and applying it during this additional ICPC challenge week.

As always, ICPC U invites everyone to Train, Practice, and Perform!

Полный текст »

 
 
 
 
  • Проголосовать: нравится
  • +124
  • Проголосовать: не нравится

Автор physics0523, история, 10 дней назад, По-английски,

Codeforcesの皆さん、こんにちは!(Hello, Codeforces!)

I'm glad to invite you to my first contest, Codeforces Round #654 (Div. 2) which will be held on Jul/01/2020 16:35 (Moscow time) (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:

The scoring distribution will be announced later.

Good luck, have fun and wish your high ratings :)

UPD: Scoring distribution : $$$500 - 1000 - 1250 - 1500 - (1500 + 1250) - 3000$$$

UPD: Editorial is out

Полный текст »

 
 
 
 
  • Проголосовать: нравится
  • +713
  • Проголосовать: не нравится

Автор MikeMirzayanov, 10 дней назад, По-английски,

Hello Codeforces!

In February, in the Russian-language interface, we announced a new educational subsection of the website. It's time to go international!

I am pleased to invite you to test the new section, which so far has the working title EDU. I hope that someday EDU will become a real educational hub for fans of programming competitions. It will be great to have in one place the collected educational content with text and video materials, with selected thematic problems.

At the moment, its functionality is still under development, and here is the current progress and β-testing preview. Write your comments and suggestions in the comments here.

Go to EDU →

So far, only a pilot course with the first lesson "Suffix Array" has been presented to your attention. The plans include expanding both the functionality of the section and filling it with new content.

Russian version already contains more lessons. At the moment, it is important for us to get the first feedback from international users. Many thanks to Pavel Mavrin (pashka) for preparing the first English lesson. Please support pashka to motivate him to translate more lessons!

I hope that in the future, using the materials in this section, you will be able to gain knowledge on an extensive set of topics that are used in contests and olympiads. According to the current plan, a group of ITMO lecturers and students will be engaged in a pilot course, a little later we will consider the possibility of opening the possibility of creating classes for a wider audience.

Thanks to ITMO University for the idea and support for the implementation of this initiative!

Полный текст »

 
 
 
 
  • Проголосовать: нравится
  • +2266
  • Проголосовать: не нравится

Автор misis, 2 недели назад, По-русски,

Welcome to the Summer Programming School "Volga Camp"! Volga Camp is a school targeting algorithms, data structures and special mathematical chapters for school students of the 7th grade and older. Here you can get invaluable experience and prepare for programming competitions.

The School was to be held near Kostroma, on "Berendeyevy Polyany" recreation department. But this year it will be held online from July 21 to August 4.

There will be 5 separate programs, each having a different difficulty level. The first 4 programs will be held in Russian and the 5th — in English. The registration for Russian programs is closed.

The School is conducted by the ACM MISIS competitive programming centre in collaboration with teachers and graduates of school 179, students and teachers of FCS HSE and DIHT MIPT.

To participate you need to get registered here and then go through a selection process in the form of online competition. The selection contest will be open for 48 hours on July 11-12 (you can write it at a time convenient for you). The Participation fee is 200 €. Find more information on our official web page: https://volgacamp.ru/en/school

Полный текст »

 
 
 
 
  • Проголосовать: нравится
  • +64
  • Проголосовать: не нравится

Автор vovuh, история, 12 дней назад, По-русски,

<almost-copy-pasted-part>

Привет! В 28.06.2020 17:35 (Московское время) начнётся Codeforces Round #653 (Div. 3) — очередной Codeforces раунд для третьего дивизиона. В этом раунде будет 6 или 7 задач (или 8), которые подобраны по сложности так, чтобы составить интересное соревнование для участников с рейтингами до 1600. Однако все желающие, чей рейтинг 1600 и выше могут зарегистрироваться на раунд вне конкурса.

Раунд пройдет по правилам образовательных раундов. Таким образом, во время раунда задачи будут тестироваться на предварительных тестах, а после раунда будет 12-ти часовая фаза открытых взломов. Я постарался сделать приличные тесты — так же как и вы буду расстроен, если у многих попадают решения после окончания контеста.

Вам будет предложено 6 или 7 (или 8) задач и 2 часа на их решение.

Штраф за неверную попытку в этом раунде (и последующих Div. 3 раундах) будет равняться 10 минутам.

Напоминаем, что в таблицу официальных результатов попадут только достоверные участники третьего дивизиона. Как написано по ссылке — это вынужденная мера для борьбы с неспортивным поведением. Для квалификации в качестве достоверного участника третьего дивизиона надо:

  • принять участие не менее чем в двух рейтинговых раундах (и решить в каждом из них хотя бы одну задачу),
  • не иметь в рейтинге точку 1900 или выше.

Независимо от того являетесь вы достоверными участниками третьего дивизиона или нет, если ваш рейтинг менее 1600, то раунд для вас будет рейтинговым.

Спасибо MikeMirzayanov за платформы, помощь с идеями для задач и координацию моей работы. Спасибо моим очень хорошим друзьям Дарье ZeroAmbition Степановой, Михаилу pikmike Пикляеву, Максиму Ne0n25 Мещерякову и Ивану BledDest Андросову за помощь в подготовке и тестирование раунда. Также спасибо Артему Rox Плоткину и Дмитрию _overrated_ Умнову за обсуждение идей и тестирование раунда!

Удачи!

</almost-copy-pasted-part>

UPD: Также спасибо ma_da_fa_ka за тестирование раунда и отдельное спасибо Дмитрию _overrated_ Умнову, Артему Rox Плоткину и, конечно же, Михаилу MikeMirzayanov Мирзаянову за обсуждение идей и помощь с подготовкой раунда!

UPD2: Разбор опубликован!

Полный текст »

 
 
 
 
  • Проголосовать: нравится
  • +447
  • Проголосовать: не нравится

Автор ICPCNews1, 3 недели назад, По-английски,

text

UPD: You can predownload tests as an encrypted zip-archive by the links https://test1.codeforces.com/icpc-challenge-2020-tests.zip or https://test4.codeforces.com/icpc-challenge-2020-tests.zip (~80MB). The password is 64e00d81811bbc463e1e636af.

Hello everyone!

Live broadcast

Announcing the ICPC Graph Mining Challenge, Powered by Huawei and brought to you by ICPC U. Graphs are a powerful mechanism for representing many aspects of our daily lives, from mobile call routing to disease tracking. Answering various graph-related questions enables solutions to some of the most challenging, modern problems. The ICPC Challenge presents a problem from some area in computing. The area and problem style may be very different from the standard ICPC problems. Previous contests included new programming languages, multi-agents, parallel programming, etc. The ICPC Challenge provides a platform for ICPC to experiment with new problem types. It also provides participants with experience in some new area and problem type.

The ICPC Graph Mining Challenge will take place online during ICPC Day Zero on 27 June, 2020, 11:00-14:00 UTC. This round is unrated for all participants. Day Zero is a celebration of the 2020 ICPC World Finals, hosted by the Moscow Institute of Physics and Technology (MIPT). Everybody is welcome to participate. This is an individual competition. Participants will be divided into three groups: 2020 ICPC World Finals Contestant, 2020 ICPC World Finals Coach (includes co-coaches), and Participants. The 2020 ICPC World Finals Contestants and Coaches with the best graph solutions will be recognized as ICPC Challenge Winners. The top-scoring participants will also receive great prizes.

Join ICPC Challenge Warm-up Join ICPC Challenge

Both rounds are unrated for all participants

Huawei will provide prizes to the 12 winners in each group accordingly:

  • Group 1: 3 hour Challenge — ICPC 2020 World Finalists
  • Group 2: 3 hour Challenge — ICPC Coaches and Co-Coaches
  • Group 3: 3 hour Challenge — All participants
Group 1-3 Winners Quantity per place Prize
ICPC Challenge / 1-4th place 1 HUAWEI P40 PRO
ICPC Challenge / 5-8th place 1 HUAWEI MATEPAD PRO LTE
ICPC Challenge / 9-12th place 1 HUAWEI WATCH GT 2E

Each participant may win at most one prize for this Challenge.

All participants must agree to follow the 2020 ICPC Graph Mining Challenge Rules.

Participation Instructions:

  1. Read and agree to follow the rules.
  2. Create a Codeforces account if you don’t already have one.
  3. Associate your Codeforces account with your ICPC account if you have one. Though optional, this is necessary if you want to compete as a 2020 ICPC World Finalist or Coach.
  4. Register for the contest here.
  5. Please, make sure to complete the Warm-up at least 24 hours before the event to test your access, etc.
  6. There will be large input files. They will be available here at least 24 hours in advance. We recommend you to download them before the event.
  7. Go here at least 20 minutes prior to the start of the contest.

Good luck to all participants!

Полный текст »

Анонс ICPC Challenge 2020
 
 
 
 
  • Проголосовать: нравится
  • +408
  • Проголосовать: не нравится

Автор pikmike, история, 2 недели назад, По-русски,

Привет, Codeforces!

В 25.06.2020 17:35 (Московское время) состоится Educational Codeforces Round 90 (рейтинговый для Див. 2).

Продолжается серия образовательных раундов в рамках инициативы Harbour.Space University! Подробности о сотрудничестве Harbour.Space University и Codeforces можно прочитать в посте.

Этот раунд будет рейтинговым для участников с рейтингом менее 2100. Соревнование будет проводиться по немного расширенным правилам ICPC. Штраф за каждую неверную посылку до посылки, являющейся полным решением, равен 10 минутам. После окончания раунда будет период времени длительностью в 12 часов, в течение которого вы можете попробовать взломать абсолютно любое решение (в том числе свое). Причем исходный код будет предоставлен не только для чтения, но и для копирования.

Вам будет предложено 6 или 7 задач на 2 часа. Мы надеемся, что вам они покажутся интересными.

Задачи вместе со мной придумывали и готовили Роман Roms Глазов, Адилбек adedalic Далабаев, Владимир vovuh Петров, Иван BledDest Андросов и Максим Ne0n25 Мещеряков. Также большое спасибо Михаилу MikeMirzayanov Мирзаянову за системы Polygon и Codeforces.

Удачи в раунде! Успешных решений!

Поздравляем победителей:

Место Участник Задач решено Штраф
1 Geothermal 7 130
2 ksun48 7 143
3 300iq 7 147
4 vepifanov 7 168
5 Radewoosh 7 175

Поздравляем лучших взломщиков:

Место Участник Число взломов
1 EduPeres 40
2 Grey_Matter 39:-3
3 lx430621 26:-1
4 killa_vanilla 25:-5
5 checkingagain 17:-1
Было сделано 351 успешных и 375 неудачных взломов.

И, наконец, поздравляем людей, отправивших первое полное решение по задаче:

Задача Участник Штраф
A Geothermal 0:01
B ksun48 0:01
C ksun48 0:03
D Noureldin 0:09
E Geothermal 0:22
F ElOrdyh 0:15
G dario2994 0:29

UPD: Разбор опубликован

Полный текст »

 
 
 
 
  • Проголосовать: нравится
  • +551
  • Проголосовать: не нравится

Автор DeadlyCritic, история, 3 недели назад, По-английски,
$$$~-\text{In the name of God}~-$$$

Hi community,

I'm glad to invite you to my first contest, Codeforces Round #652 (Div. 2) which will be held at Jun/23/2020 17:05 (Moscow time) ($$$\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 adedalic for coordinating and reviewing the round, as well as helping with many different things.

I'd like to thank antontrygubO_o, physics0523, McDic, Ashishgup, dannyboy20031204, Kuzey, Return_0, FieryPhoenix, ma_da_fa_ka, ITDOI, AM_I_Learning, pikmike, lynmisakura, JustasLe and ArimeZ for testing the round and giving valuable feedback.

Also I'd like to thank coauthors, amiralisalimi, AS.82 and davooddkareshki for helping me with inventing and choosing the problems.

Finally, thanks to MikeMirzayanov for very nice and convenient Codeforces and Polygon platforms.

I wish you all will find the problems interesting, thank you for participating, and good luck!

$$$\text{Scoring distribution : } \; 500 ~- 1000 ~- 1500 ~- 2000 ~- 2500 ~- 3000$$$

$$$\textbf{UPD}$$$ : Editorial is out

Полный текст »

 
 
 
 
  • Проголосовать: нравится
  • +1231
  • Проголосовать: не нравится