We invite you to participate in CodeChef’s February Cookoff 2023, this Wednesday, 08th February, rated for all.
Time: 8 PM — 10:30 PM IST
From admins. We apologize for the absence of Div. 1 contests. In the first half of 2022, we were trying hard to hold them on a regular basis. This was already challenging, as the number of high-quality proposals, especially hard ones, was very small; we had to use our own problems in almost every contest. This couldn't continue for long.
We would like Codechef Div. 1 contests to come back, but for this, we need your help. The Div.1 problems of the next few contests will be based on The Leo Camp 2022, a Ukrainian programming camp that took place in the summer of 2022, and, possibly, our own problems. But we need your problems to continue making these contests. So, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, please, share them here.
If you participated in The Leo Camp 2022, please, don't participate in this contest.
Joining us on the problem setting panel are:
Setters: Kanhaiya notsoloud1 Mohan, anky_301, neerav_1, Danish danishiitp_24, M.Sohel, VladProg VladProg, KostasKostil KostasKostil, kostia244 kostia244, BigBag BigBag, Barichek Barichek, Mustang98 Mustang98, shanin shanin, RomaWhite RomaWhite, witua witua, Andrew_Makar Andrew_Makar
Testers: Nishank IceKnight1093 Suresh , Jatin rivalq Garg
- Statement Verifier: Kanhaiya notsoloud1 Mohan
- Video Editorialists: Sundar K Letscode_sundar, Madhav jhamadhav Jha, Suraj jhasuraj01 Jha, Jwala jwalapc , Rohit ezo_tihor Oze, Adhish ak2006 Kancharla
- Text Editorialists: Nishank IceKnight1093 Suresh
- Contest Admins: Anton antontrygubO_o Trygub, Yahor 244mhq Dubovik, Jatin rivalq Garg, 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.
Hope to see you participating. Good Luck!
You should not have mentioned contest will be based on Leo camp now I am sure that some cheaters will find questions and will definitely cheat on contest.
They should mention that at least to refrain official camp participants from competing here.
Great! Very Exciting!
Btw can you tell me why rating change (especially +ve delta) became too slow my codechef account was getting gradually increased although getting good ranks. My rating got decreased a lot when new rating system came and I'm getting too less +ve delta although the people who participate with their alt gets very huge +ve delta. When will I get normally deltas as one used to get 1 years back?
For experienced users, the new system rewards consistency. You might consistently be at a particular level, but do terribly in one contest, and the system won't punish you with a huge -ve delta for it. It will be treated as more of an outlier, and it'll give you more chances, so to speak. Similarly, just a single great contest won't spike your ratings by a lot. If you consistently do better than what the system expects you to, then it'll give you higher +ve deltas.
Just see the difference between the two rating graph tabs to get an idea of the difference in the systems. The old system is very chaotic, while the new system rewards you for consistently improving over time.
When did rank 80 become a terrible rank? Atleast give some positive delta to those who have 2 digit rank.
Not so many people take part in division 1 contests. I've checked and first problem was solved by 137 participants. So yes, 80th position isn't terrible rank, but it's not great as well
I did not see, that was a division 1 contest with only 5 star people. Sorry
what was the intended TC of Alice Potter and OWL???. My 180*180*q solution TLE'd how do I optimize it?
180 * N
For r-l+1>180 you can always find a segment with sum multiple of 180 so you can just traverse until you encounter previously occurred prefix sum. For the other case you can store the prefix sum values (mod 180) in an array and sort them and take minimum of difference between consecutive elements over all indices and print the corresponding indexes with the least prefix sum difference.
How to solve Pasha and Good Ones ?
Editorial.
Finally div 1 contest!But I my rating went down.