We invite you to participate in CodeChef’s Starters 80, this Wednesday, 8th March, rated till 5-stars Coders (ie. for users with rating < 2200).
Time: 8 PM — 11:00 PM IST
Joining us on the problem setting panel are:
- Setters: Nishank IceKnight1093 Suresh, Kanhaiya notsoloud1 Mohan, Ryan c8kbf Zhang, Prakhar Rook_Lift Jain, anky_301, Dilshodbek DilshodbekX Khujaev
- Testers: Satyam satyam343, wuhudsm
- Statement Verifier: Kanhaiya notsoloud1 Mohan
- Video Editorialists: Sundar K Letscode_sundar, Madhav jhamadhav Jha, Suraj jhasuraj01 Jha, Jwala jwalapc, Rohit ezo_tihor Oze
- Text Editorialist: Nishank IceKnight1093 Suresh
- Contest Admin: Nishank IceKnight1093 Suresh
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 for all users for 1 day as soon as the contest ends, after which they 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!
I hate tasks like matrix pain with a vengeance. The idea is obvious, just painful math debugging
There is no Long challenges in the Calendar. So this type of competitions is cancelled forever?
https://discuss.codechef.com/t/inquiry-about-february-long-challenge-2023/105372/2
There should have been a problem to fill the gap between 3rd (Permutation Subseq.) and 4th (Tree XOR).
Problem "Eat Rock!" is a brilliant problem, loved upsolving it, because I was not able to debug in time during the contest. The order of weights and the order of distances got me confused in the solution.
Edit: finally became 6* again.
Exactly, "Eat Rock!" was cool, dumb me couldn't debug my code in time.
Got Accepted now!
https://www.codechef.com/viewsolution/91734366
Can someone please point out why this code shows runtime errors?
I haven't seen the whole code, but it's probably because you're declaring a 2D vector of size NxN, which will exceed given memory.
The line,
vector<vector<int>> we(n+1,vector<int> (n+1,0));I guess you're doing this to store edge weights, so instead of that you can use vector of pairs, like in my submission.
The tree problem is actually quiet nice. Love the solution
Solution for c8kbf and Tree was uploaded on YouTube during the contest! CodeChef_admin please investigate
"If you want to report a Youtube channel, or Telegram group or something similar which is publishing solutions during a contest, please fill this form."
-- https://discuss.codechef.com/t/updates-on-curtailing-plagiarism/98350
Please add a "Report Cheating" button, as it is there on Leetcode. Like see this submission
"We request everyone to report plagiarism cases on [email protected] within 3 days of each contest."
-- https://discuss.codechef.com/t/updates-on-curtailing-plagiarism/98350
C8kbf and tree previously had t=100 and now it's 10. Not good
No idea what you're talking about.