**UPD**: [Editorial](https://codeforces.net/blog/entry/72132) is published!↵
↵
<almost-copy-pasted-part>↵
↵
Hello!↵
[contest:1272] will start at [contest_time:1272]. 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] (/blog/entry/59228) that only the <i>trusted participants of the third division</i> 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 <i>trusted participants of the third division</i>, 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.↵
↵
<b>Regardless of whether you are a <i>trusted participant of the third division</i> or not, if your rating is less than 1600, then the round will be rated for you.</b>↵
↵
Thanks to [user:MikeMirzayanov,2018-10-11] for the platform, help with ideas for problems and for coordination of my work. Thanks to my good friends Daria [user:ZeroAmbition,2019-11-03] Stepanova, Mikhail [user:PikMike,2018-10-11] Piklyaev, Maksim [user:Ne0n25,2018-10-11] Mescheryakov and Ivan [user:BledDest,2018-10-11] 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](https://codeforces.net/contest/1006/submission/40432115)) will not be shown in the hacking leaders table.↵
↵
</almost-copy-pasted-part>↵
↵
**UPD**: Great thanks to Artem [user:rox,2019-12-12] Plotkin and Dmitrii [user:opukittpceno_hhr,2019-12-12] Umnov for testing the round and help with bugs fixing! Artem is also proposed one of the problems for today's round!
↵
<almost-copy-pasted-part>↵
↵
Hello!↵
[contest:1272] will start at [contest_time:1272]. 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] (/blog/entry/59228) that only the <i>trusted participants of the third division</i> 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 <i>trusted participants of the third division</i>, 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.↵
↵
<b>Regardless of whether you are a <i>trusted participant of the third division</i> or not, if your rating is less than 1600, then the round will be rated for you.</b>↵
↵
Thanks to [user:MikeMirzayanov,2018-10-11] for the platform, help with ideas for problems and for coordination of my work. Thanks to my good friends Daria [user:ZeroAmbition,2019-11-03] Stepanova, Mikhail [user:PikMike,2018-10-11] Piklyaev, Maksim [user:Ne0n25,2018-10-11] Mescheryakov and Ivan [user:BledDest,2018-10-11] 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](https://codeforces.net/contest/1006/submission/40432115)) will not be shown in the hacking leaders table.↵
↵
</almost-copy-pasted-part>↵
↵
**UPD**: Great thanks to Artem [user:rox,2019-12-12] Plotkin and Dmitrii [user:opukittpceno_hhr,2019-12-12] Umnov for testing the round and help with bugs fixing! Artem is also proposed one of the problems for today's round!
