Hello CodeForces Community!↵
↵
I’d like to invite you to the [CodeChef August Cook-Off](https://www.codechef.com/COOK73). As usual, the CookOff will be on the second last Sunday of the month.↵
↵
Joining me on the problem setting panel are:↵
↵
- Problem Setter: [user:alei,2016-08-20] (Alei Reyes)↵
- Problem Tester: [user:kingofnumbers,2016-08-20] ( Hasan Jaddouh)↵
- Editorialist: [user:PraveenDhinwa,2016-08-20] (Praveen Dhinwa) ↵
- Russian Translator: [user:Cherrytree,2016-08-20] (Sergey Kulik)↵
- Mandarin Translator: [user:huzecong,2016-08-20] (Hu Zecong) ↵
- Vietnamese Translator: VNOI Team↵
- Contest Admin and Language Verifier: [user:PraveenDhinwa,2016-08-20] (Praveen Dhinwa) ↵
↵
Especial thanks go to [user:Miyukine,2016-08-20] for his appreciation of the problem-set before I send it to CodeChef, he have a good taste in programming contests so I'm glad he found the problems interesting.↵
↵
The contest theme is based on Lewis Carroll's book Alice's Adventures in Wonderland.↵
Problems are not sorted by difficulty, so I highly recommend to read all of them.↵
This is my second time as problem setter, you can see my previous round at <a href="http://mirror.codeforces.com/contest/592">CF328</a>.↵
↵
I hope you will enjoy solving the problem set. Please give your feedbacks in the comments below after the contest. You can find the rest of the details about the contest below.↵
↵
**Time:** 21st August 2016 (2130 hrs) to 22nd 2016 (0000 hrs). (Indian Standard Time — +5:30 GMT) — Check your [timezone](http://www.timeanddate.com/worldclock/fixedtime.html?msg=CodeChef%3A+August+Cook-Off+2016&iso=20160821T2130&p1=44&ah=2&am=30). ↵
↵
**Details:** https://www.codechef.com/COOK73↵
↵
**Registration:** You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to [register](https://www.codechef.com/signup) in order to participate.↵
↵
**Prizes:** Top 10 performers in Global and Indian category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. Know more here: https://www.codechef.com/laddu. (For those who have not yet got their previous winning, please send an email to winners@codechef.com)↵
↵
Good Luck and Have Fun! Hope to see you participating!!↵
↵
<hr></hr>↵
↵
**UPD.** My sad story: I wake up very early to take part on AtCoder, and then to moderate the CodeChef contest, but just before the start of AtCoder there was a power outage on my city :(. Fortunately the contest admin, translators, and tester were able of handling the contest all by themselves :).↵
↵
**UPD.** Congrats to the winners!↵
↵
 [user:ksun48,2016-08-22]↵
↵
 [user:anta,2016-08-22]↵
↵
 [user:uwi,2016-08-22]↵
↵
Here are some hints and bonus to all problems:↵
↵
<spoiler summary="Alice">↵
Draw lines of the form (k,k+1)↵
</spoiler>↵
↵
**BONUS.** What is the minimum number of lines that we have to draw to cut every cell?↵
↵
↵
<spoiler summary="Tweedle-Dee and Tweedle-Dum">↵
Dum can always remove stones from non-empty heaps.↵
Dee can't always remove stones from non-empty heaps.↵
</spoiler>↵
↵
**BONUS.** Solve the problem when Dee can remove only a number of stones multiple of $x$, and when Dum can remove only a number of stones multiple of $y$↵
↵
**BONUS.** Solve the problem when Dee can remove only a number of stones of the form $k \cdot x + r_1 $, and when Dum can remove only a number of stones of the form $k \cdot x + r_2 $↵
↵
↵
<spoiler summary="Math Hatter">↵
Can you determine who is the student with the highest IQ?↵
</spoiler>↵
↵
**BONUS.** Find the lexicographically smallest solution.↵
↵
↵
<spoiler summary="Mock Turtle">↵
The problem is equivalent to the number of dyck paths that touches the diagonal a fixed number of times.↵
</spoiler>↵
↵
↵
<spoiler summary="Queen of Hearts">↵
The number of connected components in a pseudoforest can be determined by the number of vertices, edges and cycles.↵
</spoiler>↵
↵
**BONUS.** Can the problem solved efficiently for a general graph? for a planar graph?↵
↵
↵
↵
↵
↵
I’d like to invite you to the [CodeChef August Cook-Off](https://www.codechef.com/COOK73). As usual, the CookOff will be on the second last Sunday of the month.↵
↵
Joining me on the problem setting panel are:↵
↵
- Problem Setter: [user:alei,2016-08-20] (Alei Reyes)↵
- Problem Tester: [user:kingofnumbers,2016-08-20] ( Hasan Jaddouh)↵
- Editorialist: [user:PraveenDhinwa,2016-08-20] (Praveen Dhinwa) ↵
- Russian Translator: [user:Cherrytree,2016-08-20] (Sergey Kulik)↵
- Mandarin Translator: [user:huzecong,2016-08-20] (Hu Zecong) ↵
- Vietnamese Translator: VNOI Team↵
- Contest Admin and Language Verifier: [user:PraveenDhinwa,2016-08-20] (Praveen Dhinwa) ↵
↵
Especial thanks go to [user:Miyukine,2016-08-20] for his appreciation of the problem-set before I send it to CodeChef, he have a good taste in programming contests so I'm glad he found the problems interesting.↵
↵
The contest theme is based on Lewis Carroll's book Alice's Adventures in Wonderland.↵
Problems are not sorted by difficulty, so I highly recommend to read all of them.↵
This is my second time as problem setter, you can see my previous round at <a href="http://mirror.codeforces.com/contest/592">CF328</a>.↵
↵
I hope you will enjoy solving the problem set. Please give your feedbacks in the comments below after the contest. You can find the rest of the details about the contest below.↵
↵
**Time:** 21st August 2016 (2130 hrs) to 22nd 2016 (0000 hrs). (Indian Standard Time — +5:30 GMT) — Check your [timezone](http://www.timeanddate.com/worldclock/fixedtime.html?msg=CodeChef%3A+August+Cook-Off+2016&iso=20160821T2130&p1=44&ah=2&am=30). ↵
↵
**Details:** https://www.codechef.com/COOK73↵
↵
**Registration:** You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to [register](https://www.codechef.com/signup) in order to participate.↵
↵
**Prizes:** Top 10 performers in Global and Indian category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. Know more here: https://www.codechef.com/laddu. (For those who have not yet got their previous winning, please send an email to winners@codechef.com)↵
↵
Good Luck and Have Fun! Hope to see you participating!!↵
↵
<hr></hr>↵
↵
**UPD.** My sad story: I wake up very early to take part on AtCoder, and then to moderate the CodeChef contest, but just before the start of AtCoder there was a power outage on my city :(. Fortunately the contest admin, translators, and tester were able of handling the contest all by themselves :).↵
↵
**UPD.** Congrats to the winners!↵
↵
 [user:ksun48,2016-08-22]↵
↵
 [user:anta,2016-08-22]↵
↵
 [user:uwi,2016-08-22]↵
↵
Here are some hints and bonus to all problems:↵
↵
<spoiler summary="Alice">↵
Draw lines of the form (k,k+1)↵
</spoiler>↵
↵
**BONUS.** What is the minimum number of lines that we have to draw to cut every cell?↵
↵
↵
<spoiler summary="Tweedle-Dee and Tweedle-Dum">↵
Dum can always remove stones from non-empty heaps.↵
Dee can't always remove stones from non-empty heaps.↵
</spoiler>↵
↵
**BONUS.** Solve the problem when Dee can remove only a number of stones multiple of $x$, and when Dum can remove only a number of stones multiple of $y$↵
↵
**BONUS.** Solve the problem when Dee can remove only a number of stones of the form $k \cdot x + r_1 $, and when Dum can remove only a number of stones of the form $k \cdot x + r_2 $↵
↵
↵
<spoiler summary="Math Hatter">↵
Can you determine who is the student with the highest IQ?↵
</spoiler>↵
↵
**BONUS.** Find the lexicographically smallest solution.↵
↵
↵
<spoiler summary="Mock Turtle">↵
The problem is equivalent to the number of dyck paths that touches the diagonal a fixed number of times.↵
</spoiler>↵
↵
↵
<spoiler summary="Queen of Hearts">↵
The number of connected components in a pseudoforest can be determined by the number of vertices, edges and cycles.↵
</spoiler>↵
↵
**BONUS.** Can the problem solved efficiently for a general graph? for a planar graph?↵
↵
↵
↵
↵
