We invite you to participate in CodeChef’s Starters 177, this Wednesday, 12th March, rated upto 5 stars (i.e. for users with rating < 2200).
Time: 8:00 PM — 10:00 PM IST
Joining us on the problem setting panel are:
Contest Admin and Statement Verifier :Shreyan Dominater069 Ray.
Text Editorialist — Nishank IceKnight1093 Suresh.
Tester: Sushil SmolBrain Raaja.
Setters:Shreyan Dominater069 Ray, hashman.
Written editorials will be available for all on discuss.codechef.com. Pro users can find the editorials directly on the problem pages after the contest. The video editorials of the problems will be available only to Pro users.
Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here. Hope to see you participating.
Good Luck!
UPD : The number of problems in each division is as follows:
- Division $$$1$$$ : $$$6$$$ problems
- Division $$$2$$$ : $$$7$$$ problems
- Division $$$3$$$ & $$$4$$$ : $$$8$$$ problems
UPD 2 : Congratulations to the winners:
Dominater round after so long
korbo lorbo jeetbo re
Contest starts in ~30min.
hope to have some fun with the problems .
is the problem blocktree , perfect subset sum ?
$$$k = 0$$$ or $$$n$$$ : You can achieve $$$score = 1$$$
$$$score = 2$$$ : Achievable iff there exists subtree of size either $$$k$$$ or $$$n - k$$$
$$$score = 3$$$ : Always achieveable, colour any connected set of $$$K$$$ nodes as $$$1$$$. It can be shown that a path will be $$$0..01...10...0$$$ in the worst case.
Thanks
i am sorry for the weak samples on Matching Arrays.
I expected the problem to be much easier than it ended up being. The correct decision was indeed a stronger sample.