We invite you to participate in CodeChef’s July Long Challenge, this Friday, 2nd July, 3 PM IST onwards.
The contest is open for 10 days, i.e, from 2 — 12 July. Please note, this month’s long challenge will be rated only for Div 3 coders.
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.
Joining us on the problem setting panel are:
Setters: Daanish Mahajan, Bharat singlabharat Singla, Aryan Agarwala, Srikkanth srikkanthr R, Yuriy FairyWinx Fedorov, Akash Whiplash99 Bhalotia, Souradeep Paul, Vsevolod Pechalka Nagibin
Tester: Aryan aryanc403 Choudhary
Statement Verifier: Riley Monogon Borgard
Editorialist: Taranpreet taran_1407 Singh
Contest Admin: Daanish Mahajan
Head Admin: Alex Um_nik Danilyuk
Video Editorialists: Chirayu Chirayu Jain, Prachi agarwal19 Agarwal, Darshan darshancool25 Lokhande, Yashodhan ay21 Agnihotri, Shivam Bohra, Aryan Agarwala, Meet myth_gemphir Singh Gambhir, Rajarshi RestingRajarshi Basu
Mandarin Translator: Huang Ying
Russian Translator: Fedor Mediocrity Korobeinikov
Bengali Translator: Sakib SakibAbrar Abrar
Vietnamese Translator: Team VNOI
Prizes:
The winners will receive CodeChef laddus with which they can claim cool CodeChef goodies. Know more here.
The video editorials of the problems will be available on our YouTube channel as soon as the contest ends. Subscribe to get notifications about our new editorials.
Hope to see you participating.
Good Luck!
Not for Division 1 again.. Whyyy?
Weren't there like a lot of suggestions to make the Long Challenges Unrated? Due to the rampant cheating that was taking place in them. Maybe they finally listened to these demands.
Then they should completely remove long challenges, it seems useless to make it rated for Div3 only(not even for Div2).
Why not just keep them for educational purposes? Without any rating changes. Because that was the true purpose of having Long Contests in the first place.
In fact if the ratedness and prize distribution is completely out of the equation, these can truly promote open discussions, people exchanging ideas and a whole collaborative nature to it. No incentive to cheat because the ranks would no longer mean anything (in fact even get rid of ranks). Then those who are actually interested to learn would give these and they'd sort of become practice contests — places to learn new/non-routine algorithmic concepts.
lol, they just started giving money incentives, I don't know what they are thinking smh.
Not enough difficult problems that aren't too standard would be my guess. I knew it was a problem a few months ago, and it seems to be worse now. Nearly all of the Medium+ problems in the last 2 Lunchtimes came from IOITC iirc, so all medium+ problems are probably going to Cookoff.
Even unrated for div2 as well.
As a setter i post the
Obligatory question to ask, Sauce?
I haven't watched it but it looks like Violet Evergarden.
Yes, you are right (and watch this anime, it's amazing)
She's got Major problems.
Good to see Codechef's plan going forward is to remove all rated contests that aren't intended for Div 3.
I should go back to div3...
it looks like now every competition is only rated for div.3 and that is not so good
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.Hmm, how much time it takes for an accepted problem to be used in a contest??
Similar case
Have you prepared problem on Campus Codechef ?
Yes but, how this relate here? Actually, they have to at least ask the setter to prepare the problem, or be ready with it.
So, I'm new to CodeChef. Can you please tell me how much competition there is in comparison to codeforces?? I was able to solve the first 3 problems in about 20 min and got stuck on problem 4 and I'm still there. Am I doing good or bad or ok??
Edit: I'm getting a lot of downvotes. Is there something wrong with my question??
Well it sure is better that someone who solved 1st 2 and copied rest 8
How to solvehttps://www.codechef.com/JULY21B/problems/LADCOMP .As it's official editorial is not out yet can someone share their approach.
Its basically something like HLD. Number of such chains will be not very large may be order of log(n). So you can start from the node added, climb up the entire chain using binary lifting in log(n) and go till you find some chain which belongs to node which is at a greater depth than current node. You can find the current node belongs to which chain using segment tree on euler tour to find the max distance node in the subtree.