Make Codeforces not Coronaforces

In English По-русски
Enter | Register

Home
Top
Contests
Gym
Problemset
Groups
Rating
API
Calendar
Help
10 years!

→ Pay attention
Before contest
Codeforces Round #646 (Div. 2)
27:52:35
Register now »
*has extra registration

→ Top rated
# User Rating
1 MiFaFaOvO 3681
2 Um_nik 3544
3 maroonrk 3431
4 tourist 3409
5 apiadu 3397
6 300iq 3317
7 ecnerwala 3260
7 Benq 3260
9 LHiC 3229
10 TLE 3223
Countries | Cities | Organizations View all →

→ Top contributors
# User Contrib.
1 Errichto 193
2 antontrygubO_o 191
3 vovuh 178
4 pikmike 177
5 tourist 166
6 Um_nik 165
7 McDic 164
8 ko_osaga 163
9 Radewoosh 162
10 300iq 156
View all →

→ Find user
Handle:

→ Recent actions

Ashishgup → Codeforces Round #646 (Div. 2) New comment(s)

Endagorion → Solving KEYENCE Programming Contest for practice Text created or
updated
pikmike → Educational Codeforces Round 88 Editorial New comment(s)
JacobianDet → HOW TO SOLVE SPOJ ADAPANEL New comment(s)
MikeMirzayanov → Discussion: Rating Changes Caps New comment(s)
Sakudo → Do you need to be studying computer science in university to be good
at competitive programming? Text created or updated
Stepavly → Codeforces Round #644 (Div. 3) Editorial New comment(s)
coding_is_fun → How to add image in a blog or comment ? New comment(s)
DrSwad → A Beautiful Technique for Some XOR Related Problems New comment(s)
De.Wilde → Code For Athoy — Contest for Saving a Life New comment(s)
BledDest → Kotlin Heroes: Episode 4 New comment(s)
Ferrarixxx → Help, Can't understand why this approach is giving WA New
comment(s)
pikmike → Educational Codeforces Round 88 [Rated for Div. 2] New comment(s)
rng_58 → Rated range of AGC New comment(s)
garakchy → rng_58's hardest problem New comment(s)
sprkgoyal → Editorial of NITS Local #28 New comment(s)
FieryPhoenix → Codeforces Round #638 (Div. 2) Editorial New comment(s)
lordsaitama → Uncertainity with doubles New comment(s)
vovuh → Codeforces Round #627 (Div. 3) Editorial New comment(s)
BledDest → Kotlin Heroes: Episode 4 — Editorial New comment(s)
rohit_1402 → Bugs in GNU C++17 (64) New comment(s)
Nickolas → Codeforces Round #455 (Div. 2) Editorial New comment(s)
EbTech → How to Interpret Contest Ratings New comment(s)
DishonoredRighteous → Codeforces Round #643 (Div. 2) Editorial New comment(s)
Kelk1 → A Codeforces Round 88 Div. 2 — C O(1) solution which should have
worked... New comment(s)

Detailed →

Codeforces Round #646 (Div. 2)

By Ashishgup, 15 hours ago, In English, [Attach this blog to some contest as a
resource]

Hi everyone!

I would like to invite you to my fourth Codeforces Round, which I have made with my
friends FastestFinger and TheOneYouWant. In terms of problems, it is my favorite
among all my rounds.

With that said, I bring to your attention our new Codeforces Round #646 (Div. 2)
that will take place on Sunday, May 31, 2020 at 16:35UTC+2. 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:

 FastestFinger and TheOneYouWant for helping with preparing problems and giving
new ideas.
antontrygubO_o for coordinating our round
300iq, Jeel_Vaishnav, Ari, aryanc403, mahmoudbadawy, Vivek1998299 and
Nikhil_Medam for testing the problems.
MikeMirzayanov 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! :D

Read more »
Announcement of Codeforces Round #646 (Div. 2)

Vote: I like it
+762
Vote: I do not like it

Author Ashishgup
Publication date 15 hours ago
Comments 90

SIT STAR Contest

By MikeMirzayanov, 16 hours ago, In English, [Attach this blog to some contest as a
resource]

Hello!

Together with colleagues Schaffhausen Institute of Technology we hold such an

event. If you want to study in Switzerland, then perhaps this is your chance!

— Mike

Hello, Codeforces!
SIT

We are thrilled to announce a new SIT STAR Contest by the Schaffhausen Institute of
Technology in Switzerland. The winners will have a chance to get a fully-funded
Master’s scholarship in Computer Science and Software Engineering.

What is the SIT STAR Contest?

The goal of the SIT STAR Contest is to promote interest in the field of Computer
Science and Software Engineering, give students an opportunity to demonstrate their
knowledge of programming, and be considered for a fully-funded graduate
scholarship. You can apply to the contest here!

The SIT STAR Contest consists of:

June 1-7, 2020 | Practice: To familiarize yourself with the testing

environment, you will first be granted access to a practice round. You can practice
any time from 1st to 7th June 2020. This is an optional step but we highly
recommend to take part in it. The results of this round won’t affect the final
score.
June 17, 2020 | SIT STAR Contest: The final round will take place on 17th June.
The participants will be given 4 hours to complete it.
June — July, 2020 | Interviews and Winners announcement: Top participants with
the highest scores will be invited for the interviews with the professors from the
Schaffhausen Institute of Technology.

The SIT STAR Contest will include 8-12 problems of various levels of difficulty in
algorithmic programming.
APPLY→

Read more »
Tags sit

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

Author MikeMirzayanov
Publication date 16 hours ago
Comments 1

Kotlin Heroes: Episode 4

By BledDest, 2 days ago, In English, [Attach this blog to some contest as a
resource]

Hello, Codeforces!

First and foremost, we would like to say a massive thank you to everyone who
entered and submitted their answers to the first, second and third Kotlin Heroes
competitions which were held previously. Congratulations to the top 3 winners:

Episode 1

Petr
ecnerwala
eatmore

Episode 2

tourist
eatmore
Benq

Episode 3

Egor
tourist
Benq

Ready to challenge yourself to do better? The fourth "Kotlin Heroes" competition

will be hosted on the Codeforces platform on Friday, May 29, 2020 at 16:35UTC+2.
The contest will last 2 hours 30 minutes and will feature a set of problems from
simple ones, designed to be solvable by anyone, to hard ones, to make it
interesting for seasoned competitive programmers. Top three winners will get prizes
of $512, $256, and $128 respectively, top 50 will win a Kotlin Heroes t-shirt and
an exclusive Kotlin sticker, competitors solving at least one problem will enter
into a draw for one of 50 Kotlin Heroes t-shirts.

Registration is already open and available via the link. It will be available until
the end of the round.

The round will again be held in accordance with a set of slightly modified ICPC
rules:

The round is unrated.

The contest will have 9 problems of various levels of complexity.
You are only allowed to use Kotlin to solve these problems.
Participants are ranked according to the number of correctly solved problems.
Ties are resolved based on the lowest total penalty time for all problems, which is
computed as follows. For each solved problem, a penalty is set to the submission
time of that problem (the time since the start of the contest). An extra penalty of
10 minutes is added for each failed submission on solved problems (i.e., if you
never solve the problem, you will not be penalized for trying that problem). If two
participants solved the same number of problems and scored the same penalty, then
those of them who had previously made the last successful submission will be given
an advantage in the distribution of prizes and gifts.

REGISTER →

If you are still new to Kotlin we have prepared a tutorial on competitive

programming in Kotlin and a practice round, where you can try to solve a few simple
problems in Kotlin. All the solutions are open, which means that you can look at
the solution even if you haven't solved the problem yet. The practice round is
available by the link.

We wish you luck and hope you enjoy Kotlin.

UPD: The editorial can be found here. Thank you for participation! I hope you
enjoyed the problems.

Read more »
Announcement of Kotlin Heroes: Episode 4
Announcement of Kotlin Heroes: Practice 4

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

Author BledDest
Publication date 2 days ago
Comments 79

Educational Codeforces Round 88 [Rated for Div. 2]

By pikmike, history, 3 days ago, translation, In English, [Attach this blog to some
contest as a resource]
Hello Codeforces!

On Thursday, May 28, 2020 at 16:35UTC+2 Educational Codeforces Round 88 (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!

Our friends at Harbour.Space also have a message for you:

Codeforces and Harbour.Space

Hey Codeforces!

As you may remember, we have a free webinar series starring our all-star faculty
members who share valuable content and insiders’ knowledge that you don’t get to
learn about in traditional classrooms.

Join us tomorrow, Thursday, May 28 at 12h (BCN) / 17h (BKK) to watch Sergey
Gordeychik, CIO of the Inception Institute of Artificial Intelligence, share his
expertise and insights in his “Digital Lockdown: AI against COVID-19” session.
Sergey will discuss how AI is being used both positively and negatively during the
COVID-19 global pandemic. Tune in for some practical examples of how companies are
using AI to innovate and disrupt during a time of crisis, exploring topics like
Medical Imaging for CT analysis, diagnosis and mass surveillance.

By participating in this webinar you will get a certificate of participation, a

special digital gift from Sergey, and stand a chance to win a FREE 3-week module at
Harbour.Space University depending on the availability and prerequisites of the
course.

See you tomorrow, and good luck on your round!

Reserve your spot now!

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 kefaa2 6 174
2 bmerry 6 219
3 dlalswp25 6 233
4 hepth 6 238
5 Volkov_Ivan 6 251

Congratulations to the best hackers:

Rank Competitor Hack Count
1 Hideki_Ryuga_L 37
2 KonaeAkira 19:-1
3 ujjwalsingh30 18:-1
4 veteran_ 14
5 hashlib 13
318 successful hacks and 469 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:
Problem Competitor Penalty
A andryusha_na_knopke 0:01
B thech0sen1 0:03
C IAKWF 0:11
D Kerim.K 0:06
E HeHere 0:06
F user202729_ 0:44

UPD: Editorial is out

Read more »
Announcement of Educational Codeforces Round 88 (Rated for Div. 2)

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

Author pikmike
Publication date 3 days ago
Comments 538

Codeforces Round #645 (Div. 2)

By Alexdat2000, 11 days ago, translation, In English, [Attach this blog to some
contest as a resource]

Сoronavirus work, coronavirus school, coronavirus rest, coronavirus time spending,

coronavirus contest.

Hello, Codeforces!

Codeforces Round #645 (Div. 2) will start at Tuesday, May 26, 2020 at 16:35UTC+2.
This round will be rated for the participants with rating lower than 2100. You will
have 2 hours to solve 6 problems.

Problems of this round were prepared by Alexey Alexdat2000 Datskovskiy, Ilian

ilian04 Andrianov, Vsevolod Sevlll Lepeshov. We have made an effort to create
interesting problems, beautiful statements and strong tests. We wish you like
problems and your rating increase.

We would like to express our gratitude to:

MikeMirzayanov for wonderful platforms Codeforces and Polygon!

300iq for excellent coordination and helpful advices!

 Thanks to Siberian, mohammedehab2002, Degalat57, Kuroni, pajenegod, hugopm,
Dart-Xeyter, alexxela12345, FlameDragon, Monogon, YanikusGG, Mangooste, mbolgov,
Ziware, xiryss for delightful testing!

Special thanks to testers imachug, dorijanlendvaj, antontrygubO_o,_overrated_

and Allvik06 for help in finding errors in problems!

UPD 1: Scoring distribution: 500 — 750 — 1500 — 1500 — 2000 — 2500

UPD 2: editorial

UPD 3: Congratulations to winners!

Top 5 official participants:

Place Participant Problem solved =
1 OI_Blacksmith 6 6910
2 HackerDemon 6 6752
3 Potassium 5 5543
4 qwertz73355a 5 5478
5 SorahISA 5 5446

Top 5 all participants:

Place Participant Problem solved =
1 Egor 6 7821
2 kort0n 6 7495
3 Golovanov399 6 7365
4 nuip 6 7346
5 Geothermal 6 7332

Participants who sent the first correct solution to the problems:

Problem Participant Penalty
A Geothermal 0:00
B IgorI 0:02
C KostasKostil 0:04
D neal 0:11
E Geothermal 0:27
F chemthan 0:40

Read more »
Announcement of Codeforces Round #645 (Div. 2)

Vote: I like it
+366
Vote: I do not like it

Author Alexdat2000
Publication date 11 days ago
Comments 397

Codeforces: Soon We Will Change the Rating Calculation for New Accounts
By MikeMirzayanov, 6 days ago, In English, [Attach this blog to some contest as a
resource]

Hello everyone.
In the coming days I will finish the implementation of small changes in the rating
calculation for new accounts. Here are the main innovations.

The rating of the new account will be equal to 0

for display (but it will be equal to 1400

when calculating rating changes).
Suppose, after the first round, the participant gained d1
rating points (remember that the rating was considered equal to 1400 in such
calculations), then in the rating display after this round 500+d1 will be
displayed. Thus, after the first participation, the rating is likely to increase
from 0 to a value in the region of 500 (plus or minus 300
approximately).
Thus, before the second participation, the displayed rating is 500+d1
, and the rating for calculating changes is 1400+d1. Suppose a new change is d2,
then the displayed rating becomes 500+d1+350+d2
.
Thus, before the third participation, the displayed rating is 500+d1+350+d2
, and the rating for calculating changes is 1400+d1+d2. Suppose a new change is d3,
then the displayed rating becomes 500+d1+350+d2+250+d3
.
And so on the first 6
rounds. Promotions of the displayed rating will be equal to 500,350,250,150,100,50
(in total exactly 1400). Therefore, after participating in 6

rounds, the rating is “stabilized” and the displayed rating will be equal to
the one used to recalculate the changes.

Thus, on average, for new accounts at an early stage, the rating will increase,
getting closer to the real value. These innovations will help solve several issues:

We are reducing the starting rating from 1500

to 1400
, so that new accounts make a smaller contribution to the overall rating.
Currently, especially for inexperienced participants, there is an effect that their
rating at the beginning of participation is constantly falling (from 1500
to the value that is a true assessment of their skills). This, of course, leads to
discomfort: you try, participate, solve some problems, but the rating drops.
The previous paragraph gives additional motivation to create new accounts. If your
current rating is less than 1500

, then there is a temptation to start from scratch with a fresh account. After
the changes, such a start will require a noticeable long-term effort to climb at
least your current rating. It seems that the changes should slightly reduce the
motivation to create new accounts.

Apparently, a similar idea is used on AtCoder, but I don't know the details.

What do you think about such improvement? Sounds good?

Read more »
Tags codeforces, rating
 Vote: I like it
+2581
Vote: I do not like it

Author MikeMirzayanov
Publication date 6 days ago
Comments 190

Codeforces Round #644 (Div. 3)

By Supermagzzz, history, 8 days ago, translation, In English, [Attach this blog to
some contest as a resource]

Hello, Codeforces!

We have planned this round as a Div. 4, but testing showed us, that problems are
more suitable for Div. 3. Therefore, instead of the previously announced Div. 4 we
will hold Div. 3 round.

<almost-copy-pasted-part>

Hello! Codeforces Round #644 (Div. 3) will start at Sunday, May 24, 2020 at
15:35UTC+2. You will be offered 8 problems 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 a 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 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 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.

The problems for this round were invented by MikeMirzayanov and prepared by me and
Stepavly

Thanks to MikeMirzayanov for platforms and coordination of our work. Thanks to

antontrygubO_o, iankury, bfs.07, kocko, Ilya-bar, arsijo, pashka, Gassa, neal,
vovuh for help in round preparation and testing the round.

Good luck!

</almost-copy-pasted-part>
UPD: Editorial is out

Read more »
Announcement of Codeforces Round #644 (Div. 3)

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

Author Supermagzzz
Publication date 8 days ago
Comments 231

Announcement: Microsoft Q# Coding Contest – Summer 2020

By Nickolas, 12 days ago, In English, [Attach this blog to some contest as a
resource]

Microsoft's Quantum team is excited to announce the Q# Coding Contest – Summer

2020, the third in the series of Q# contests! In this contest you can put your
quantum programming skills to the test, solving quantum computing tasks in Q#. The
winners (as well as some lucky participants) will receive a Microsoft Quantum T-
shirt!

Quantum computing is a radically different computing paradigm compared to classical

computing. Indeed, it is so different that some tasks that are believed to be
classically intractable (such as factoring integers or simulating physical systems)
can be performed efficiently on a quantum computer. In December 2017 Microsoft
introduced the Quantum Development Kit which includes the Q# programming language.

In summer of 2018 we hosted the first quantum programming contest, which included
problems on introductory topics in quantum computing: superposition, measurement,
quantum oracles and simple algorithms. In winter of 2019 we hosted the second
quantum programming contest, which offered harder problems on those topics plus
some tasks on implementing unitary transformations. This contest will introduce new
types of tasks, as well as some twists on the previous ones.

The contest will run from June 19 to June 22. As usual, we will hold a warmup round
the weekend before the contest, from June 12 to June 15, to give you an opportunity
to get familiar with the contest environment and submission system before the main
contest. Participation in the warmup round is optional.

Good luck! We hope you enjoy the contest!

The rules of the contest are:

Read more »
Announcement of Microsoft Q# Coding Contest - Summer 2020 - Warmup
Announcement of Microsoft Q# Coding Contest - Summer 2020
Tags microsoft, quantum, quantum computing, q#
 Vote: I like it
+430
Vote: I do not like it

Author Nickolas
Publication date 12 days ago
Comments 63

Educational Codeforces Round 87 [Rated for Div. 2]

By pikmike, history, 2 weeks ago, translation, In English, [Attach this blog to
some contest as a resource]

Hello Codeforces!

On Sunday, May 17, 2020 at 11:20UTC+2 Educational Codeforces Round 87 (Rated for
Div. 2) will start.

Please notice the unusual time.

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.

Also thanks to Neal neal Wu for testing.

Good luck to all the participants!

Our friends at Harbour.Space also have a message for you:

Codeforces and Harbour.Space

Hi Codeforces!

We would like to invite you to a very special webinar called Digital Lockdown: AI
against COVID-19, by Sergey Gordeychik, director of our Cyber Security programme.

Sergey is CIO of Inception Institute of Artificial Intelligence, and former CTO at

Kaspersky.

During this webinar, Sergey will share his
being used both positively and negatively,
Tune in for some practical examples of how
disrupt during a time of crisis, exploring
analysis, diagnosis and mass surveillance.
expertise and insights on how AI is
during the COVID-19 global pandemic.
companies are using AI to innovate and
topics like Medical Imaging for CT
Join us on Thursday, May 28th at 12h (BCN) to gain knowledge and deepen your
understanding about how we can use AI to solve both operational and societal
problems.

By participating in this 1hour webinar you will get a certificate of participation,

a special digital gift from Sergey, and have the chance to win a FREE 3-week module
at Harbour.Space University, depending on the availability and prerequisites of the
course.
Reserve your spot now!

Congratulations to the winners:

Rank Competitor Problems Solved Penalty
1 square1001 8 294
2 Anadi 8 305
3 tfg 8 681
4 kefaa2 7 192
5 xay542I 7 248

Congratulations to the best hackers:

Rank Competitor Hack Count
1 qwscaln 29:-2
2 im_Ankit 5
3 lvao-x 3:-1
4 the_redback 3:-1
5 WICK_ED 2:-1
142 successful hacks and 828 unsuccessful hacks were made in total!

And finally people who were the first to solve each problem:
Problem Competitor Penalty
A fedoseev.timofey 0:02
B Ashishgup 0:03
C1 hitman623 0:04
C2 square1001 0:15
D Not-Afraid 0:10
E autumn_eel 0:17
F squarepants 0:47
G riantkb 0:37

UPD: Editorial is out

Read more »
Announcement of Educational Codeforces Round 87 (Rated for Div. 2)

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

Author pikmike
Publication date 2 weeks ago
Comments 746

← 1 2 3 ... 168 169 →

Codeforces (c) Copyright 2010-2020 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: May/30/2020 12:41:57UTC+2 (f3).
Desktop version, switch to mobile version.
Privacy Policy
Supported by
Telegram ИТМО