September Lunchtime starts in under 2 hours, and I am the editorialist for the whole contest.
Problems are exceptionally interesting - big thanks to Sergey Kulik. You will have to deal with fancy pattern matching, some palindroms, maintain a collections of sets, and decide when is it best time to drink a cup o coffee
This lunchtime will be probably slightly harder than usual, so I advice to read all the problems very carefully, and stick to the details. Remember, as always on CodeChef, each problem has a few subtasks, and if you do not know how to solve it for the original constraints, we encourage you to solve as many subtasks as you can.
Techniques used it the problems are extremely useful, and I strongly recommend to solve all of them, even after the contest. I hope that my editorial will be helpful to explain intended solutions as well as solutions to each subtask. They will be published just after the contest, so stay tuned
UPDATE: All editorials are available here: September Lunch Time Editorials
One more thing worth to mention is that, AngryBacon, who is a tester in the contest, solved one of the problems faster than the indented solution was, so we decided to add another subtask to this problem, with even higher constraints. I am curious if you can spot that subtask during the contest
See you on leaderboards!