We invite you to participate in CodeChef’s Starters 102, this Wednesday, 27th September, rated till 6-stars (ie. for users with rating < 2500).
Time: 8:00 PM — 10:00 PM IST
Read about the recent judge migration here.
Joining us on the problem setting panel are:
Setters: Kanhaiya notsoloud1 Mohan, Ronit ro27 Bhatt, Aditya Aditya_Mittal_31 Mittal, Ansh ansh_321 Varshney, Aniruddh Chimpanzee Patil, Souradeep souradeep.99 Paul
Tester: Mridul MridulAhi Ahi
Community Testers — Manan mexomerf Grover
Statement Verifier: Kanhaiya notsoloud1 Mohan
Text Editorialists: Nishank IceKnight1093 Suresh
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!
Text editorial are also for pro users only?
CodeChef is gradually losing it's regular users..
greedy unacademy tryin to monetize everything.
Codechef is no longer owned by Unacademy.
They're available for non pro users also, on discuss.codechef.com. Direct contest editorial link is there on contest homepage when contest ends.
Light The Bulb was identical to recent problem from Hackerearth September Circuits. Link
Thanks for pointing this out. We are looking into it, and will update.
It was indeed a Notorious Coincidence. We apologize for the oversight. The proposer has been banned from the platform.
What does exactly mean in problem C?
You have to do 2 moves,no more no less even if the strings are equal initially.
Casework: At the position where t[i]!=s[i], we have to definitely apply a single operational and at the position where characters are equal, we can apply no operational or two operations. Consider 1 when t[i]=s[i] otherwise 0. Then count the number of continuous 0 and 1. Let them be c1 and c2 then:
x=total number of 1 and y=total number of 0
Can anyone tell my mistake in this code for " Chef Segment " problem
https://www.codechef.com/viewsolution/1023144006
My solution to problem Array Sum relied on taking the max element if possible starting from 1e5, regardless of value of N. I expected it to TLE, if there are lot of tests with small value of sum required. Wherein, I will start from 1e5 in each one of them. But my solution got Accepted. Can someone explain why this works or are the test cases weak?
Edit : I think it passed because there are only 1000 test cases max. If there were more, I expect it to TLE, at least with strong tests cases.
Really enjoyed the problem set today.CHESSELO was so cute.Magnus orz.
Couldn't agree more. Hikaru Orz.
Loved Parity Permutation.