We invite you to participate in CodeChef’s Starters 160, this Wednesday, 13th November, 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
Tester: Sushil SmolBrain Raaja
Text Editorialists: Nishank IceKnight1093 Suresh
Setters: Nishank IceKnight1093 Suresh, Shreyan Dominater069 Ray, 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.
The number of problems in each division is as follows :
- Division 1 : 4 problems + 1 subtask
- Division 2 : 5 problems + 1 subtask
- Division 3 : 6 problems + 1 subtask
- Division 4 : 7 problems + 1 subtask
Good Luck!
UPD 1 : The contest has been postponed for 30minutes and will now start at 8:30 PM IST due to a technical error. We apologize for any conveniences.
UPD 2 : The top $$$5$$$ standings are here. Congratulations to the winners!
the contest is delayed by 30minutes
You guys always reject every single problem idea I propose without any feedback.
These guys also reject every submission I make
Its most likely a scam. I dont think they are interested in actually paying people.
a lot of people, both international and indians, have been involved in codechef setting before. Please do not make such wild accusations.
For me they accepted the problem last december.
Some back and forth communication and aren't replying now.
how exactly is second character in S an 'a'? lol.
i am sorry i made an error
it should be 1st character
Codechef never disappoints in disappointing
GuesStarters
I gave div 2, the question A felt a bit harder than B and even C!
Div 3 B was a good question. I had this approach pruning the unnecessary 'b's out after 'a' to match it with regex b*(a(b*))* and then equating them, but took long time in implementing it.
It's actually easier than that. Just make sure that the total number of a's and the number of initial b's are equal.
Just make sure the number of
a'sin both are equal and if so then the first occurrence ofashould be same, as we can't add morebelse before that.