I have nothing to say this time, so meet yet another Div. 3 round :)

<almost-copy-pasted-part>

Hello! Codeforces Round #560 (Div. 3) will start at May/14/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**: I also would like to thank nhho, chenjb and ksun48 for testing the round.

**UPD2**: I also would like to thank my friend Adilbek adedalic Dalabaev for valuable suggestions about the contest and testing it!

**UPD3**: Editorial is published!

**UPD4**:

Congratulations to the winners:

Rank | Competitor | Problems Solved | Penalty |
---|---|---|---|

1 | nuoyanli | 7 | 368 |

2 | Vaseline_Warrior | 7 | 437 |

3 | adimiclaus15 | 7 | 446 |

4 | 1716638489 | 7 | 604 |

5 | leo990629 | 6 | 335 |

Congratulations to the best hackers:

Rank | Competitor | Hack Count |
---|---|---|

1 | Java | 68:-2 |

2 | figdan | 63:-13 |

3 | makjn10 | 44:-1 |

4 | csts.21 | 40 |

5 | yashi2552 | 27 |

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

Problem | Competitor | Penalty |
---|---|---|

A | Tokisaki-Kurumi | 0:03 |

B | CoolAttacks | 0:03 |

C | igniubi | 0:08 |

D | foool | 0:13 |

E | maverick_10 | 0:15 |

F1 | cunt | 0:27 |

F2 | cunt | 0:26 |