Please note the unusual day of the week for the contest.
We invite you to participate in CodeChef’s Starters 194, this Sunday, 13th July, rated for all.
Time: 8:00 PM — 11:00 PM IST
Joining us on the problem setting panel are:
Setters: Dominater069, DarkSparkle, jtnydv25, ExplodingFreeze.
Contest Admin: Shreyan Dominater069 Ray
Text Editorialist: Nishank IceKnight1093 Suresh.
Tester: Sushil SmolBrain Raaja.
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.
Note:
The contest is on a Sunday instead of the usual Wednesday, due to it being a more convenient time for some users. Only the rated for all contests may be held on Sundays instead (but upto the discretion of contest admin), the other contests on the usual Wednesday.
The contest is yet again based off the IOITC Camp in India. If you have participated there or seen the problems otherwise, please refrain from participating.
There may be a number of unusual problems, or problems with subtasks.
Good Luck!
Congratulations to Top $$$5$$$ in Division $$$1$$$.
Rank $$$1$$$ : Nachia
Rank $$$2$$$ : 244mhq
Rank $$$3$$$ : kotatsugame
Rank $$$4$$$ : potato167
Rank $$$5$$$ : yydtq
Only the rated for all contests may be held on Sundays instead (but upto the discretion of contest admin), the other contests on the usual Wednesday ????? Is slightly unclear ??
the normal contests will be happening on Wednesday only, as is the usual Codechef schedule.
Only the rated for all contests may happen on Sunday (or it may happen on Wednesday as well). This is due to several high rated users commenting that they cannot participate due to not being free on a weekday.
Contest starts in ~25mins.
site down?
Facing issue while loading the contest page.
For this problem Munchys Modulo I thought there should be better solution than N^2, but I could not find it. After the contest I found out from editorial that actual solution is N ^ 2, got accepted right away. I could think easier approach from beginning
could somebody explain why in the problem D (terminal states) the following logic doesnt work : compute the number of increasing subsequences after removing all numbers that can't be deleted with the operations at all?
You are close but this is not correct.
Let's say permutation is 2,1,4,3 you can delete all elements but you can't delete both (2,1) or (4,3)
oh i see, thanks
Speedrunning was nice, atleast the easy/medium version.
can somebody hint on how to approach the non cyclic version
dp
very very good round. appreciate..