We invite you to participate in CodeChef’s Starters126, this Wednesday, 20th March, rated for till 6-Stars(ie. for users with rating < 2500).
Time: 8:00 PM — 10:00 PM IST
Joining us on the problem setting panel are:
Setters: Yash yash_daga Daga, Manan mexomerf Grover, Ronit bronit Bhatt,Sushil SmolBrain, Prajwal procodgok Singh, Adithya Practice_Track Sunil,
Tester: Jay JaySharma1048576 Sharma.
Text Editorialists:Nishank IceKnight1093 Suresh.
Statement Verifier: Kanhaiya notsoloud1 Mohan.
Contest Admin : Yash yash_daga Daga.
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!
First Contest in cc div.1
Hope to remain 5 star after the contest.
Why was the constraint so low in problem — "TREEDISTSET"(Link) ,it has a simple O(n) solution.
I'm guessing the verifier probably runs in O(n^2)
Problem B(div.2) FREEDOM Video Editorial (Audio : Hindi)
YOUTUBE EDITORIAL LINK --Click Here
Uncommon cycles was a nice one, enjoyed a lot
why does this polynomial hash solution fail for triangular swaps?
submission
I was able to pass using 2 hashes instead of 1, link
i see, thank you very much