Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official. ×

By JATC, history, 5 weeks ago, In English,

Hi everyone. I'm glad to announce that the Codeforces Round #520 (Div. 2) will be held on 14.11.2018 18:35 (Московское время).

The round will be rated for Div 2 participants (whose ratings are lower than 2100). However, all the other participants can compete as well, without worrying about ratings being changed.

You will be given 2 hours to solve 6 problems. It's better to read all the problems. The scoring distribution will be announced soon before the contest starts.

All the problems were prepared by myself, with some help from my friend GiraffeCoder. I want to thank _kun_ for coordinating me in preparing the problems, gritukan, isaf27, demon1999 and Arpa for testing my solutions. I also want to thank csacademy for their graph editor tool. You can check it out at this link.

This is the first round I propose. I put a lot of work into it so I hope that you will enjoy it (smiley face).

Wish you do your best and get a high rating!

Update 1: If you want to discuss about the problems after the contest, here is the link to the CP Community on Discord. Please make sure that you don't give the solutions to other participants during the contest.

Update 2: The score distribution will be the standard one: 500 1000 1500 2000 2500 3000.

Update 3: Congrats to the winner

Official participants:

  1. I_Love_Kirino

  2. Dark_Warlock

  3. wcysai

  4. coriander

  5. fcwwww

Unofficial participants:

  1. BudAlNik

  2. HIR180

  3. KrK

  4. ayaze

  5. FCB1234

Tutorial UPDATED

Read more »

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

By PikMike, history, 5 weeks ago, translation, In English,

On Nov/12/2018 17:35 (Moscow time) Educational Codeforces Round 54 (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 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 Ajosteen Glazov, Adilbek adedalic Dalabaev, Vladimir Vovuh Petrov, Ivan BledDest Androsov and me.

Good luck to all participants!

UPD: There certainly will be a discussion of the problems on the local Discord server shortly after the contest ends. I might join it as well)

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 FCB1234 7 266
2 HIR180 6 129
3 mrscherry 6 152
4 Vergara 6 158
5 Jeel_Vaishnav 6 185

Congratulations to the best hackers:

Rank Competitor Hack Count
1 teapotd 100:-4
2 vlad.raw 52:-5
3 Marcosk 32
4 tataky 28:-5
5 knotValid 23
721 successful hacks and 668 unsuccessful hacks were made in total!

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

Problem Competitor Penalty
A Dalgerok 0:01
B Nasic_number_one 0:03
C neal 0:03
D TAMREF 0:14
E shadowatyy 0:13
F killer_god 0:34
G HIT_Jerry 1:03

UPD2: There was an error in problem D which caused some incorrect solutions to get accepted. We will investigate the number of users who were affected by this issue and decide whether the round is rated.

UPD3: We discussed the issue and came up with the following decision:

Those who got accepted earlier and get WA now won't be affected by rating changes. For everyone else (for those who got correct verdict) the contest will be rated.

UPD4: Editorial is out

Read more »

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

By Kuyan, 5 weeks ago, translation, In English,

Hi all!

I'm happy to invite everyone to a combined for Div.1 and Div.2 Mail.Ru Cup 2018 Round 2, that is starting at this time: Nov/10/2018 17:35 (Moscow time). The problems were prepared by Kuyan and Jacob. Thanks to _kun_ and 300iq for coordination and help in preparation.

Also huge thanks to majk, lewin, gritukan, demon1999 for testing, and also to MikeMirzayanov for Codeforces and Polygon platforms.

This round is the second round in the new championship called Mail.Ru Cup, you can learn more about it following the link. The round will be rated for everybody!

The championship feature the following prizes:

  • First place — Apple MacBook Air
  • Second and third place — Apple iPad
  • Fourth, fifth, sixth places — Samsung Gear S3
  • Traditionally, the top 100 championship participants will get cool T-shirts!

In each round, top 100 participants get prize points according to the table. The championship's result of a participant is the sum of the two largest results he gets on the three rounds.

There will be 7 problems for two and a half hours. The scoring will be available later.

I hope you will like the problems and wish you a rating increase!

UPD1: Scoring distribution:

500 1000 1500 2250 2750 3500 4000

The round is over, congratulations to the winners!

  1. aid
  2. LHiC
  3. V--o_o--V
  4. mnbvmar
  5. tourist

The current results of Mail.Ru Cup (summing up the two rounds) are published.

The analysis is also published.

Read more »

Announcement of Mail.Ru Cup 2018 Round 2
 
 
 
 
  • Vote: I like it  
  • +180
  • Vote: I do not like it  

By skywalkert, 5 weeks ago, In English,

Hello, Codeforces!

We intend to share some ACM-ICPC regional contests with you! Here is one of them.

An online-mirror contest of 2018-2019 ACM-ICPC, Asia Nanjing Regional Contest will start on Saturday, November 17, 2018 at 18:00 (UTC+8). You may register for this contest 6 hours before it starts, but it is temporarily inaccessible before registration starts.

By the way, this contest will consist of 13 problems and you can solve them within 5 hours.

Wish you will learn great experience through that time!

Waaaaait!

There is another online-mirror contest, The 2018 ACM-ICPC Asia Qingdao Regional Contest (Mirror), which will be held at acm.zju.edu.cn on Saturday, November 10, 2018 at 12:00 (UTC+8), a week before the contest on Gym!

This contest is prepared by our friends from Zhejiang University and indeed a very interesting contest. If you are eager to participate, please do not hesitate to register a handle on it and take part in time!

P.S. Please do not discuss any solution before contests are finished. Thanks for your cooperation.


UPD1: Ranking that suits for Gym has been parsed from data provided by the host school (Nanjing University of Aeronautics and Astronautics). Enjoy it.

UPD2: Registration starts. You may view this page to register.

UPD3: In order to be consistent with the onsite one, the duration is extended by 10 minutes.

Read more »

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

By MikeMirzayanov, 6 weeks ago, translation, In English,

Hi Codeforces.

I am glad to share a small but useful update of Polygon, which was fully developed by me in the walls of ITMO. Now preparing problems with unusual I/O will become a little easier.

Now in the new problems you will get examples in the statements without any transformations by LaTeX/HTML. If earlier you had difficulties with the correct formatting of empty lines or the fact that a double hyphen is replaced with a dash, now there are no such difficulties. The enhancement works for both PDF and HTML statements.

For example, to have such I/O examples just add such a test and use the appropriate output from the model solution.

Note that the feature to overwrite the examples is stayed working (custom content of input or output data for statements). It seems that there are almost no reasons to use it for an input now (apparently, only for interactive problems).

Previously created problems use the old approach, so this innovation should not break existing problems.

How do you like the feature?

Read more »

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

By arsijo, 6 weeks ago, In English,

Hi,

I am happy to announce that Lyft Level 5 Challenge 2018 — Final Round will be held in Palo Alto on Nov/04/2018 21:10 (Moscow time). The official round contains six problems and will last for two hours.

Winners will receive:

  • First place: $2000
  • Second place: $1000
  • Third place: $500

Here is the list of onsite finalists:

tourist LHiC scott_wu ksun48 Marcin_smu
matthew99 ecnerwala Kostroma RomaWhite Errichto
ACRush *ikatanic ilyakor Arterm zxqfl
desert97 Fdg neal KADR liympanda
LiChenKoh qlmupi williamhu08 liymbear xiaowuc1
azneyes chenmark balakrishnan *YerzhanU

If you are interested in an internship or a job at Lyft, follow the link below.

Interested in an internship or a job at Lyft?

If you are not participating in the Final Round, you will be able to take part in rated open divisions. Each of them contains six problems and will last for two and a half hours.

This round was prepared by aitch, lewin, majk, Noam527, StasyaCat, and I.

Thank you to 300iq, _kun_, BigBag, danya.smelskiy, Fekete, MrDindows, Nasic_number_one, Sonechko, winger, zubec for help with testing.

Special thanks to KAN for helping me with coordinating, MikeMirzayanov for Polygon and Codeforces, and Lyft for organizing this competition.

If you have never solved interactive problems before, please read this.

Scoring distribution:

Div1 and onsite:

750-1250-1500-2000-2750-3000

Div2:

500-1000-1750-2250-2500-3000

We have onsite issues, the contest was postponed by at least 5 minutes.

Because of the onsite round, the system testing will be in an hour after the round.

Contest is over!

Congratulations to the winners!

Onsite competition:

1 tourist
2 scott_wu
3 ecnerwala
4 RomaWhite
5 Errichto
6 ACRush
7 Arterm

Div 1:

1 Radewoosh
2 mnbvmar
3 Benq
4 CongLingDanPaiShang3k5
5 Reyna

Div 2:

1 mrscherry
2 Kekmaster
3 brandonzhang
4 MAUZER
5 ---Grigor---

Editorial is available here.

Are you looking for photos from the onsite round? It is here.

Read more »

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

By MikeMirzayanov, 7 weeks ago, translation, In English,

Hi Codeforces!

Meet a small innovation on Codeforces — difficulties of problems (and at the same time a new widget filtering problems in the archive). For all the problems of the archive, I’ve calculated the difficulties in the scale of the rating of participants. Approximately this means that if the rating of the problem is equal to yours, then on a typical round you would solve the problem with a probability of 0.5. And, in general, if your rating is ri, and the problem rating is rj, then the problem during the round can be solved approximately with probability:

For example, if the rating of a problem is less than yours by 200, then the expected probability of solving the problem is 0.75. With a difference of 400 rating points, the probability increases to 0.9.

For convenient search of problems in the archive, you can now use a special widget:

With it, you can find not only problems that have all the chosen tags, but also which have at least one tag from the list.

A difficulty of a problem is also displayed when choosing problems in a mashup.

I hope that now you will be able to do more effective practice, and the process of making new mashups for trainings will become easier.

UPD: Have you already noticed new pop-ups about judgment verdicts of your submissions?

Read more »

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

By snarknews, history, 7 weeks ago, In English,

UPDATE: The form for team registration appeared. Data will be transfered to ICPC database. Teams who filled similar form for the fixed site, do not need to fill this form twice..

Teams Registration

Coordinators of sites, allowing only teams from host university already received the links to similar forms with the pre-selected site.

The 2018 ICPC Uzbekistan Subregional Contest will take place in multi-host mode at Sunday, November 11, 2018. The universities may register as sites of the 2019 ICPC Uzbekistan Subregional using this form.

Register the Site

The form for teams registration will be posted later.

P.S. Breaking news: the hosts from Tajikistan and Turkmenistan are welcome to register and participate in Uzbekistan Multi-Site Subregional. Teams from those two countries — time to join ICPC now!

Read more »

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

By FCB1234, 7 weeks ago, In English,

I would like to invite you to participate in the rated Codeforces Round #519 by Botan Investments. Date and time of the round: Oct/28/2018 18:35 (Moscow time).

This is a combined round having 7 problems and lasting 2 hours, and it will be rated.

Tasks for you were prepared by FCB1234, Grzmot, isaf27 and Mateuszrze. Also thanks for:

KAN and _kun_ for help in preparing the problems; pavel.savchenkov, Nerevar, map, GR1n, rutsh, AlexFetisov and winger for testing the round; MikeMirzayanov for Codeforces and Polygon platforms.

The round is supported by Botan Investments.

Prizes! Top 50 participants and 20 random participants with rank from 51 to 500 will receive personalized hoodie with CF handle.

Scoring distribution will be announced later. I wish you a high rating and looking forward to see you at the competition!

UPD: I'll be on the community Discord server shortly after the contest to discuss the problems.

UPD: Scoring: 500 1000 1500 2000 2250 2750 3500

UPD: Editorial

The round is over, congratulations to the winners!

  1. scott_wu
  2. mnbvmar
  3. HIR180
  4. ksun48
  5. Benq
  6. geniucos
  7. Alex_2oo8
  8. Petr
  9. Um_nik
  10. V--o_o--V

Read more »

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