We invite you to participate in CodeChef’s Starters124, this Wednesday, 6th March, rated for till 5-Stars(ie. for users with rating < 2200).This contest is organized by Udyam’24, IIT BHU.
Time: 8:00 PM — 10:00 PM IST
Joining us on the problem setting panel are:
Setters: Mamalesh Rajkumar SunQuest Hake, Shubham shubhamgrg1000 Garg.
Tester: Nishank IceKnight1093 Suresh.
Text Editorialists:Nishank IceKnight1093 Suresh.
Statement Verifier:Nishank IceKnight1093 Suresh.
Contest Admin : Shreyan Dominater069 Ray.
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.
Udyam'24 is the technical fest of the Electronics Engineering Society of IIT BHU, and this contest is conducted under its Competitive Programming and Web Development event, Devbits!!
So what are you waiting for? fill the form, register for the event.
Should you have any queries about the event, feel free to reach out to me SunQuest or ryokou.
Hope to see you participating.
Good Luck!
UPD : You can find the editorial here
please don't keep the duration of contests more than 135 minutes
Auto comment: topic has been updated by SunQuest (previous revision, new revision, compare).
Auto comment: topic has been updated by SunQuest (previous revision, new revision, compare).
Me waiting for "Starters (Rated for All)" after becoming a 7* coder:
Amazing round
yeah the problems were good, specifically i liked the 4th problem
speedforces
every codechef round is speedforces because at the end almost all users solve the same number of problems except some dumb people who don't cheat and keep trying.
Reminder!!
Can we solve "It is a tree?" by using segment tree? I got till the point that the queries needed count of elements who occur only once in $$$(tin_u + 1, tout_u)$$$, but with updates happening I don't really know how to solve further.
You can solve for $$$100$$$ pts with MO-updates in $$$O(N + Q * (N^{2/3} + logQ))$$$
omg, 42000 participants. It's even more than cf
Auto comment: topic has been updated by SunQuest (previous revision, new revision, compare).