I’d like you to invite for February Lunchtime that will start at 19:35 IST of 25-th February 2017 and will last 3 hours.
The contest starts 5 minutes later than usually to avoid a clash with a contest on another online platform (AtCoder Mujin Contest).
I am an author of problems and editorials, while niyaznigmatul is a tester.
I want to thank dpraveen (who is a contest admin) and suraj_sharma for their technical help.
Translators: xcwgf666 (Russian), huzecong (Mandarin) and VNOI team (Vietnamese). Language verification: arjunarul.
As usually, there is no registration required — anybody with a CodeChef handle can participate.
Top school participants can win CodeChef laddus (details on the contest page).
You will be provided 4 problems with subtasks (IOI-style grading), all featuring bear Limak. Ties are broken by time of reaching your final score. I honestly think that all problems are interesting and valuable — some for beginners and some for experiences competitors (IMO one particular problem is so new and beautiful). Remember about subtasks if you can’t solve a problem for the full score, and read the editorial after the contest.
I wish you great fun and no frustrating bugs. Hope to see a lot of you in the leaderboard!
PS.
Starting with this Lunchtime, every regular contest (Challenge, Cook-off and Lunchtime) will have its announcement in the forum.
Here you can give us your feedback about problems, express your feelings (brag about your victory for example) or just discuss the contest.
There still exist editorial topics though, so it’s better to ask a particular question about a problem there.
We hope you will like this idea.
1 quick Q tho, in case someone finds discrepancy/doubt in a Q, will he now have to ask it here(cause its also ‘feedback’ in a way) or in the comments of the problem?
@vijju123: If the discrepancy/doubt in a question is during the live contest, you should ask that to the moderators by writing comments on the problem.
However, you can discuss that up after the end of contest here also.
Questions related to the statement (e.g. understanding of some definition or not clear example test) should be posted in comments under a problem. The forum should be used before and after the contest, generally.
Lunchtime is basically meant for school students but as codechef allows everyone to participate in this competition, how are school students gonna win exiting prizes through this?
I am too a beginner in programming, could solve one or two problems among the four, when will I be enable to win prizes through Lunchtime or even Cookoff?
Only school students are eligible for prizes so it doesn’t matter that everybody is allowed to participate. It’s up to you how much you learn and train. For sure participating in contests is one of things that will make you stronger and thus closer to winning prizes eventually.
The problem I liked the most was QHOUSE and the least was OVERPNT. I don’t think OVERPNT was a bad problem. Infact it was a good one but it was surely not meant for me.
can anyone write more detailed editorial for Bear and bribing tree problem from the February lunch time. I had looked at it’s editorial and I found it very difficult to understand. Can anyone explain it with the proper DP approach including overlapping sub problems and brute force solution, how that problem fits in that problem, everything in very detailed way so that it could be even understood by beginners. The problem with the official editorial is that it directly talks about the dp solution and I am still not able to realize how it is a DP problem.
can anyone write more detailed editorial for Bear and bribing tree problem from the February lunch time. I had looked at it’s editorial and I found it very difficult to understand. Can anyone explain it with the proper DP approach including overlapping sub problems and brute force solution, how that problem fits in that problem, everything in very detailed way so that it could be even understood by beginners. The problem with the official editorial is that it directly talks about the dp solution and I am still not able to realize how it is a DP problem.
The problems were really delicious(as expected by codechef and good for an intermediate beginner like me.
There is lot to learn from this contest, especially the problem with application of binary search. I am having fun by upsolving the problems. After contest I have seen Gennady’s solution, he writes very clean and elegant code.
