We invite you to participate in CodeChef’s November Long Challenge, this Friday, 5th November, 3 PM IST onwards.
The contest is open for 10 days, i.e, from 5 — 15 November. Please note, this month’s long challenge will be rated only for Div 3 participants.
Joining me on the problem setting panel are:
Setters: Ashish Ashishgup Gupta, Soumyadeep Slayer_21 Pal, Jeevan JeevanJyot Jyot Singh, Manan mexomerf Grover, Srikkanth srikkanthr R, Daanish 7dan Mahajan, Abhinav abhinavvv306 Sharma, Chaithanya Dragonado Shyam, Surya evilbuggy Prakash
Statement Verifier: Nishank IceKnight1093 Suresh
Editorialist: Taranpreet taran_1407 Singh
Contest Admins: Utkarsh Utkarsh.25dec Gupta, Nishant nishant403 Shah
Video Editorialists: Chirayu Chirayu Jain, Prachi agarwal19 Agarwal, Darshan darshancool25 Lokhande, Yashodhan ay21 Agnihotri, Meet myth_gemphir Singh Gambhir, Bharat Singla, Kartikeya IWishYourNameCouldBeHere Srivastava
Mandarin Translator: Qingchuan qingczha Zhang
Russian Translator: Kostia lkosten Yarmash
Bengali Translator: Mohammad solaimanope Solaiman
Vietnamese Translator: Team VNOI
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.
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!
Still weird staff happening with pypy3:
We are looking into it
Can someone tell me what should be the Expected CF rating of Convex Hulk problem . I am asking this because it's one of the very few problem of Geometry I ever solved and it took a half day of mine .
And also that is This solution (Mine) Hackable ? I used Graham-Scan + Greedy , first made a convex hull of given points let it be S1 , then removed those point and with the left over points and made another Convex Hull let it be S2. Then for each point in S1 found the closest points in S2 and considered three adjacent points of it . And from S1 took mid point of each side . And then used this point to generate the final convex hull . It ran well within the Time Limit.
Journey of every Competitive Programmer —
Hackerrank -> CodeChef -> CodeForces
You forgot to write Indian btw , and I didn't used Hackerrank much .