Hi everyone, it's me again!↵
↵
[Codeforces Round #372 (Div. 1 + Div. 2)](http://codeforces.me/contests/715,716) will take place on [17 September 2016 at 16:35 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?day=17&month=9&year=2016&hour=16&min=35&sec=0&p1=166),↵
↵
After [my last round](http://codeforces.me/contest/711), this will be my second round on Codeforces. I believe you'll find the problems interesting and I hope you'll enjoy the round.↵
↵
This round would not be possible without [user:dans,2016-09-15] who improved one of the problems that made this round possible, and also helped in preparing and testing the round. Also, thanks to all the testers (I'll announce them later) and [user:MikeMirzayanov,2016-09-15] for the awesome Codeforces and Polygon platforms.↵
↵
ZS the Coder and Chris the Baboon's trip in Udayland is over. In this round, you'll help ZS the Coder solve the problems he have randomly came up with randomly. Do you have what it takes to solve them all?↵
↵
The problems are sorted by difficulty but as always it's recommended to **read all the problems**.↵
↵
We wish you'll have many  solutions and enjoy the problems. :) ↵
↵
As usual, the scoring will be published right before the contest.
↵
[Codeforces Round #372 (Div. 1 + Div. 2)](http://codeforces.me/contests/715,716) will take place on [17 September 2016 at 16:35 MSK](http://www.timeanddate.com/worldclock/fixedtime.html?day=17&month=9&year=2016&hour=16&min=35&sec=0&p1=166),↵
↵
After [my last round](http://codeforces.me/contest/711), this will be my second round on Codeforces. I believe you'll find the problems interesting and I hope you'll enjoy the round.↵
↵
This round would not be possible without [user:dans,2016-09-15] who improved one of the problems that made this round possible, and also helped in preparing and testing the round. Also, thanks to all the testers (I'll announce them later) and [user:MikeMirzayanov,2016-09-15] for the awesome Codeforces and Polygon platforms.↵
↵
ZS the Coder and Chris the Baboon's trip in Udayland is over. In this round, you'll help ZS the Coder solve the problems he have randomly came up with
↵
The problems are sorted by difficulty but as always it's recommended to **read all the problems**.↵
↵
We wish you'll have many  solutions and enjoy the problems. :) ↵
↵
As usual, the scoring will be published right before the contest.
