Please, try EDU on Codeforces! New educational section with videos, subtitles, texts, and problems. ×

By vovuh, history, 4 hours ago, translation, In English,

<too-old-joke-about-copy-paste>

Hello! Codeforces Round #656 (Div. 3) will start at Jul/17/2020 17:35 (Moscow time). You will be offered 6 or 7 problems (or 8) with expected difficulties to compose an interesting competition for participants with ratings up to 1600. However, all of you who wish to take part and have rating 1600 or higher, can register for the round unofficially.

The round will be hosted by rules of educational rounds (extended ACM-ICPC). Thus, during the round, solutions will be judged on preliminary tests, and after the round it will be a 12-hour phase of open hacks. I tried to make strong tests — just like you will be upset if many solutions fail after the contest is over.

You will be given 6 or 7 (or 8) problems and 2 hours to solve them.

Note that the penalty for the wrong submission in this round (and the following Div. 3 rounds) is 10 minutes.

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participants of the third division, you must:

  • take part in at least two rated rounds (and solve at least one problem in each of them),
  • do not have a point of 1900 or higher in the rating.

Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you.

Thanks to MikeMirzayanov for the platform, help with ideas for problems and for coordination of my work. Thanks to my good friends Daria ZeroAmbition Stepanova, Mikhail pikmike Piklyaev, Maksim Ne0n25 Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round. Also thanks to Artem Rox Plotkin and Dmitrii _overrated_ Umnov for the discussion of ideas and testing the round!

Good luck!

</too-old-joke-about-copy-paste>

Read more »

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

By pashka, 4 days ago, In English,

Hello everyone!

I just published a new lesson in the EDU section. This is the first part of the lesson about the segment tree.

In this lesson, we will learn how to build a simple segment tree (without mass modifications), and how to perform basic operations on it. We will also discuss some tasks that can be solved using the segment tree.

Go to EDU →

More about EDU section you can read in this post.

Hope it will be helpful, enjoy!

Read more »

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

By MikeMirzayanov, 4 days ago, In English,

Hello.

Unfortunately, the Educational Codeforces Round 91 round will be unrated and, actually, it was completely ruined. I don’t understand what happened yet. At some point in time, all systems began to work unstably and actually stopped working. So far I have no understanding what happened. You may have to change the schedule for future rounds. Sorry. We have such a black stripe. Very upset and demotivated.

Mike.

Read more »

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

By pikmike, history, 5 days ago, translation, In English,

Hello Codeforces!

On Jul/12/2020 17:45 (Moscow time) Educational Codeforces Round 91 (Rated for Div. 2) will start.

Series of Educational Rounds continue being held as Harbour.Space University initiative! You can read the details about the cooperation between Harbour.Space University and Codeforces in the blog post.

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 Roms Glazov, Adilbek adedalic Dalabaev, Vladimir vovuh Petrov, Ivan BledDest Androsov, Maksim Ne0n25 Mescheryakov and me. Also huge thanks to Mike MikeMirzayanov Mirzayanov for great systems Polygon and Codeforces.

Good luck to all the participants!

UPD: The contest is delayed by 10 minutes.

UPD: Editorial is out

Read more »

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

By MagentaCobra, 12 days ago, In English,

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!

UPD: Scoring Distribution:

500—1000—1500—2000—2500—3000

UPD: Due to long queue, the round will be unrated. We're extremely sorry this happened, and all of us are sad about it. We hope you will at least enjoy the problems.

UPD: Editorial

Read more »

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

By xoposhiy, history, 9 days ago, translation, In English,

TL;DR: ICFP Programming Contest starts next Friday, on July 17. It's an annual open online competition originally developed by functional programmers. It feels like an entertaining 72-hour marathon with unpredictable tasks and experience one could barely express (though participants write long write-ups describing theirs). If you haven't participated in ICFP Contest — definitely give it a try this year. Register at the website and follow on Twitter.

Unlike other competitions, to participate in ICFP Contest one gathers a team of any size. In 2019, there were teams up to 12 people with a median of 3. The team has 72 hours to crack a single task which is always unpredictable, complicated, and versatile.

For example, in 2018 the task was to optimize 3D printing conducted by a swarm of nano bots, Here's an impressive solver visualization by team WILD BASHKORD MAGES (Ripatti, LinesPrower et al.):

Read more »

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

By Ari, 2 weeks ago, In English,

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

Read more »

Announcement of Codeforces Global Round 9
 
 
 
 
  • Vote: I like it
  • +2711
  • Vote: I do not like it

By ICPCNews1, history, 3 weeks ago, In English,

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!

Read more »

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

By physics0523, history, 2 weeks ago, In English,

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

Read more »

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

By MikeMirzayanov, 2 weeks ago, In English,

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!

Read more »

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