By Dalgerok, history, 41 hour(s) ago, translation, In English,

Hi, Codeforces!

Codeforces Round #553 (Div. 2) will be held on Apr/18/2019 18:35 (Moscow time). Round will be rated for second division (rating below 2100). As usual, participants from the first division can participate in the contest out of competition.

My gratitude to arsijo and KAN for coordinating the round, Markellonchik (special thanks for the help in preparing one of the tasks), mohammedehab2002, Jeel_Vaishnav for testing, and also 300iq for the idea and preparation of one of the tasks, aleks5d and isaf27 for testing it, and of course MikeMirzayanov for Codeforces and Polygon systems.

In this round you will help the residents of the Kingdom of Kremland. I strongly recommend you to read the statements of ALL tasks (and of course, try to solve them).

Good luck!

UPD: Scoring distribution: 500-750-1250-1750-2250-2750.

Read more »

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

By Vovuh, history, 3 days ago, translation, In English,

This time I have nothing to say except that this round will consist of 7 different problems!

<almost-copy-pasted-part>

Hello! Codeforces Round #552 (Div. 3) will start at Apr/16/2019 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. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. 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 Mikhail PikMike Piklyaev, Maksim Ne0n25 Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round.

Good luck!

I also would like to say that participants who will submit wrong solutions on purpose and hack them afterwards (example) will not be shown in the hacking leaders table.

</almost-copy-pasted-part>

UPD: Thanks to le.mur for idea of one of the problems.

UPD2: Editorial is published now!

UPD3:

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 ysluo2000 7 229
2 fake_delete_pls2 7 251
3 KefaKuma 6 178
4 Zhao-L 6 222
5 haimiaoyuzhao 6 240

Congratulations to the best hackers:

Rank Competitor Hack Count
1 wzw19991105 49:-4
2 ScreaMood 42:-1
3 I_love_Maria_Krylova 35:-5
4 Hacked_ 31:-1
5 Zombie358 30:-7
949 successful hacks and 502 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A MinatoYukina 0:01
B MinatoYukina 0:04
C Chess_fan 0:08
D nikizakr 0:07
E FluffyTT 0:21
F FluffyTT 0:09
G 1tst 0:14

Read more »

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

By Aleph-0, 6 days ago, In English,

Hi Codeforces!

We are glad to invite you to our first Codeforces Round Codeforces Round #551 (Div. 2) which will be held on Apr/13/2019 17:05 (Moscow time). 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 bzh and me. We hope you will enjoy the round. :P

Great thanks to 300iq for coordination of this round, isaf27, gritukan, KAN, mohammedehab2002, learner99, aleks5d and Um_nik for testing our rounds, and MikeMirzayanov 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 pay attention that there will be an interactive problem in this round, so learn more about interactive problems here before the contest.

Good luck & Have fun! :D

UPD: Scoring distribution is: 500-1000-1500-1750-2250-2750.

UPD2: Thank you for your participation in this round! Congratulations to the winners!

Div. 2

  1. ihdignite
  2. NiroBC
  3. waaaaadreamer
  4. kidddddddddddddddddddddd
  5. xianhaoming
  6. __Ressed__
  7. nikolapesic2802
  8. xiaowuc1
  9. ei133333
  10. Kho0007

Div. 1 + Div. 2

  1. ihdignite
  2. kefaa2
  3. NiroBC
  4. uwi
  5. step_by_step
  6. waaaaadreamer
  7. mmmod_lqs
  8. teja349
  9. RDDCCD
  10. quailty

UPD3: Sorry for the delay. The editorial is available.

Read more »

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

By 300iq, 2 weeks ago, translation, In English,

Hi!

At Apr/06/2019 14:35 (Moscow time) we will host Codeforces Global Round 2.

It is the second round of a new series of Codeforces Global Rounds supported by XTX Markets. The rounds are open for everybody, the rating will be updated 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 2019:

  • 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.

The problems of this round were developed by a team of authors: 300iq, cyand1317, Aleks5d, RDDCCD, KAN, gen.

Thanks KAN for his help in the round's coordination, and also isaf27, lewin, osaaateiasavtnl., Errichto, arsijo, _kun_ for testing the round!

Удачи!

Congratulations the winners!

1) ecnerwala

2) tourist

3) Um_nik

4) Endagorion

5) Petr

Editorial.

Read more »

Announcement of Codeforces Global Round 2
Announcement of Codeforces Global Round 2
 
 
 
 
  • Vote: I like it  
  • +351
  • Vote: I do not like it  

By MikeMirzayanov, 2 weeks ago, In English,

ICPC World Finals 2019 will begin on April 4, 2019 at 11:00 (UTC). This event is the main event of the year in the world of sports programming!

In the past 20 years alone, ICPC participation has increased by more than 2000%. The contest evolved into its present form as a multi-tier competition in 1977, with the first finals held in conjunction with the ACM Computer Science Conference. Last year, ICPC Regional participation included 52,709 of the finest students and faculty in computing disciplines from 3,233 universities in 110 countries. We remind you that in the current world champion is the team of Moscow State University.

Codeforces wishes the teams to show a vivid and interesting contest. We wish to find beautiful solutions, write without bugs and enjoy many accepted problems!

Links:

ICPC World Finals 2019 English Broadcast:
Legends Live Stream (Endagorion + Petr + tourist):

Read more »

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

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

Hey all!

We'll be running ICPC Connections this year at World Finals! ICPC Connections is powered by Lunchclub and is a way for contestants, coaches, and alums at World Finals to get to meet one another. We first ran Lunchclub at ICPC last year (thanks M.Mahdi for the shoutout!) and are excited to be back.

If you're in Porto this week and would be interested to meet fellow attendees, sign up at lunchclub.ai/icpc! And if you're curious to learn more about what we're working on, check out our main product here :)

Read more »

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

By Nickolas, 3 weeks ago, translation, In English,

The contest is over; I hope at least some of you enjoyed it :-) The editorial is published here.


The 7th April Fools Day Contest will take place on Monday April 1st. This is a joke competition in which solving the problem is often easier than figuring out what the actual task is.

In this round you'll be given several weird problems and 2 hours to solve them. The contest will use ACM ICPC rules (no hacks, the standings are decided by the number of solved problems and penalty time earned on them), and it will be unrated. You can submit solutions in any language allowed by Codeforces. To get an idea of what the contest will look like, you can check out the contests of the past years: 2012, 2013, 2014, 2016, 2017, 2018.

As usual, to enjoy competing in this round you'll need a sense of humor compatible with mine. Good luck, and have fun!

Read more »

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

By Vovuh, 3 weeks ago, translation, In English,

Hello! Hope you missed me :) As far as some people say, because of copy-pasted announcement this round wouldn't be interesting. But the real thing is that I'm very sick now and I'm very glad that I prepared this round at all. Hope you will enjoy it. Good luck to all!

<copy-pasted-part>

Hello! Codeforces Round #550 (Div. 3) will start at Mar/31/2019 17:05 (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. Probably, participants from the first division will not be at all interested by this problems. And for 1600-1899 the problems will be too easy. 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 Mikhail PikMike Piklyaev, Maksim Ne0n25 Mescheryakov and Ivan BledDest Androsov for help in round preparation and testing the round.

Good luck!

I also would like to say that participants who will submit wrong solutions on purpose and hack them afterwards (example) will not be shown in the hacking leaders table.

</copy-pasted-part>

UPD: Editorial is published!

UPD2:

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 WNSGB 7 206
2 kaixinqi 7 335
3 _sysjuruo 6 188
4 Moririn2528 6 206
5 CarusoX 6 212

Congratulations to the best hackers:

Rank Competitor Hack Count
1 wanderer163 21
2 tokitsukaze 14
3 nazarov.shohrukh 6
4 SMit_mangukiya 4
5 VikasChandak 4
93 successful hacks and 132 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:

Problem Competitor Penalty
A anurag918273 0:02
B probIem-solving 0:07
C ProPan_without_Pro 0:05
D vnquynh_hac_am 0:12
E probIem-solving 0:28
F sjcakioi 0:16
G izone 0:20

Read more »

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

By grphil, 3 weeks ago, translation, In English,

Hi Codeforces!

I'm glad to invite you to Codeforces Round #549 (Div. 1) and Codeforces Round #549 (Div. 2), which will be held on Mar/30/2019 20:10 (Moscow time). The round will be rated for both divisions.

Problems were prepared by me, Vladimir vekarpov Karpov, Daniil qoo2p5 Nikolenko, Askhat super_azbuka Sakhabiev and Mike MikeMirzayanov Mirzayanov.

Thanks to KAN and arsijo for helping us, and MikeMirzayanov for the great Codeforces and Polygon platforms.

UPD: You will be given 6 problems in the second division, 5 problems in first division and 2 hours to solve them.

Good luck and Have fun!

The scoring distribution will be announced later.

UPD1: Top 12 participants of div1 round, who are ICPC world finalists, will get branded Codeforces hats. Further details are here.

UPD2: The score distribution is 500-1000-1000-1500-2000-2500 for the second division and 500-1000-1500-2000-2500 for the first division.

List of the winners of the contest:

Div1

  1. Um_nik

  2. LaiMeiyun

  3. Benq

  4. dotorya

  5. ilyakor

Div2

  1. Infleaking

  2. lamejeck

  3. ZeroTwo

  4. LolKey

  5. 2qbingxuan

UPD3: Sorry for the delay, the editorial is available here

Read more »

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