Hello!
Today (20.3.), another monthly Cook-off takes place. It should last for 2.5 hours (21:30 to 00:00 IST) — starting time.
Contest link: https://www.codechef.com/COOK68
There will be 5 problems of varying difficulties — I think they aren't that hard (not for lack of trying on my part), there should be a lot more full scores than last month :D. Feel free to discuss the problems / provide feedback in the comments (after the contest ends).
In order to participate, you only need to have a CodeChef account. If you don't have one, you can register here.
Problem Setter: me
Problem Tester & Russian Translator: Antoniuk (Vasya Antoniuk)
Editorialist: PraveenDhinwa (Praveen Dhinwa)
Mandarin Translator: huzecong (Hu Zecong)
Vietnamese Translator: Team VNOI
Language Verifier & Contest Admin: PraveenDhinwa (Praveen Dhinwa)
Prizes: The prize system has changed this month. The top 10 performers in Global and Indian category will get CodeChef laddus; with them, you can claim CodeChef goodies. You can find out more here: https://www.codechef.com/laddu. (If you didn't get your previous goodies, you can contact [email protected].)
BTW, Codechef is celebrating its 7th birthday this month.
Hopefully, there won't be any technical difficulties this time! Good luck!
The contest is over!
Very simple hints for someone who doesn't want to read editorials yet:
A harder and nicer problem set is understood as the writer is you! :D
Auto comment: topic has been updated by Xellos (previous revision, new revision, compare).
Auto comment: topic has been updated by Xellos (previous revision, new revision, compare).
Auto comment: topic has been updated by Xellos (previous revision, new revision, compare).
Fine tasks :)
I realized 30 minutes before the end of contest that we don't have to use all points as vertex in the fourth task, than the task is much easier :(
Can someone write solution for the fifth?
Hello, seeing time of question, I'm afraid I'm kinda late, anyway here's one solution I've written: my code (anyway — it is not optimal (the time is .. well I'm wondering why not TLE) + not exactly "self-documenting" code + there are already solution for this problem on editorial) The thought is I guess similar to the editorial. I used bitsets to find cycles of length 3 + connected all triangles together (so they made graph) and used DP (main thought was elimination of adjanced triangles together). [as I said, the code is not self-documenting so I'll answer any questions about it] Good Luck man! :)
I hadn't joined CodeChef contests for a while. Does it usually take this long to update the rating? :)
A few days most of the time. It used to take longer.
I participated my first cook-off contest 5 months ago, but I never get my rating updated :((
It must have been August Cook Off 2015 ( Cook 61 ). It was unrated because CC servers were very slow that day.
Yes, thanks so much, you solved my puzzle.
I am waiting for Cook68 to update ;)
I am glad, I could help. :) The ranking have been updated.