We invite you to participate in CodeChef’s Starters 186, this Wednesday, 14th May, rated for 6 stars (i.e. for users with rating < 2500).
Time: 8:00 PM — 10:30 PM IST
Joining us on the problem setting panel are:
Contest Admin , Statement Verifier: Shreyan Dominater069 Ray.
Text Editorialist : Nishank IceKnight1093 Suresh.
Tester: Sushil SmolBrain Raaja.
Setters: chromate00, Shreyan Dominater069 Ray, BitWizz.
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!
Here is the breakup of problems division wise:
- Division $$$1$$$ : $$$6$$$ problems.
- Division $$$2$$$ : $$$6$$$ problems.
- Division $$$3$$$ : $$$7$$$ problems.
- Division $$$4$$$ : $$$8$$$ problems.
Congratulations to the Top $$$5$$$ in Division $$$1$$$:
Contest starts in under an hour. Hope to see you participate.
The contest (more precisely, Lighthouses) ended up harder than expected.
I want to mention that XOR with Add X is one of my top $$$2$$$ self-created favourite problems.
For "XOR with Add X", I was able to move forward for steps like dividing 2, n = 1, and n = 2.
After thinking for all these cases, my head was already full of mess and could not be able to figure out the case for n >= 3, but from the experience of n = 2, I guess things should be working, so I guessed a 0. To my surprise, it passed :)
https://discuss.codechef.com/t/xoraddx-editorial/123483 Feel free to take a look at the proof here :)
why O( X * N * log(N) ) passes for problem Mod and Make Y ?