The contest will be open for 10 days, i.e., until 15th February.

The February Long Challenge is going to have ByteDance and Codenation as the official contest recruiters! Yep, TikTok’s parent company is going to be looking to hire for multiple positions for their Singapore office, including - Algorithm Engineers, Backend Engineers, Data Engineers, Data Scientist, Machine Learning Engineers, Research Scientists, Frontend Engineers, Quality Assurance Engineer, Research Engineers, Software Engineer, and Site Reliability Engineers. Codenation Innovation Labs is hiring programmers for the Software Development Engineer role and its Junior Trilogy University (Intern Programme).

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.

Top 20 performers in the Indian category and top 10 performers in the Global category will get CodeChef laddus, with which the winners can claim cool CodeChef goodies. First to solve each problem except challenge - 100 laddus. 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.

I guess that the constraints are extremely tight for the sumxor2 problem to pass with python/pypy in the time limit. I don’t see any complete AC submission for this problem with python in any division.

Wouldn’t relatively smaller constraints be better so that the problem can be solvable with any language with optimal algorithm ? I don’t think this would lead to permitting suboptimal algorithms to pass. Problems on codeforces keep somewhat relatively smaller constraints on all their problems(for same time complexity questions compared to codechef) and most of the time all the problems can be solved in any language with the optimal algorithm without requiring any time multiplier as well(and sub optimal algorithm in any language fails as well).

In your division only, there is an AC submission in python and is fast enough for it.
If I had to reduce the constraints, I would have also reduced the time limit. So, it won’t matter.
Also, how do you know your algorithm is optimal?

Oh my bad I overlooked it. I’m not saying my algorithm is necessarily optimal, just based on the submissions. Also I didn’t mean to just point out this one problem, most of the problems on codechef follow this trend.

Pretty interesting, because I and most others have the opposite experience that Codeforces does not give any multiplier, so the chance of bad solutions passing is higher in C++ compared to Python there, but not here. I even had a case where I just read input in python and did nothing and it still TLEd on Codeforces in hacking phase because i was using input() function.

It is perfectly possible that your algorithm is optimal asymptotically and can still fail some test case because of some constant factor. That constant factor can come in from the data structures you are using, the times you are copying objects, etc. etc. Some things in Python are proven to be very slow way beyond the 5x factor and Codechef, Codeforces or anything will not help if you are having that.

Suggestions:

If problem has a limit if size N, try to find some K such that the code for N/K runs without a TLE. (you can find this by actually ignoring the input and solving a smaller problem), then depending on the value of K you can judge if you need to optimize your algorithm or implementation. (you can do this during Long as there is no penalty for wrong answer)

Of course, if you are confident, it might also be wise to just learn basic c++ syntax and rewrite it in c++

Can someone recheck the scoring of CUTCAKE? It’s mentioned that the minimum score attainable is 6e8 (600000000) after modified judge but someone has a score lower than that.

I did there as well. There was no response so just posted here for more visibliity. It’s reasonable to say that with less than 44 hours left for the contest, how this is resolved will determine the strategy how people approach the problem with the remaining time. Many won’t even try if they get 0 regardless of what they submit

It has been written to get partial points in the challenge.
Where I flip the first edge and remove the next (M-R) edges.

As testcases are randomly generated, I am not randomly removing the edges. And only the first (M-R) edges.

The output should not be 12. At best, 10^8 should have been added. And please correct it.

Also, would like if Codechef makes better checker in next contests. As after seeing full AC, I stopped working on the problem and did not have time at the end of contest. Might have actually done something to get better solution if error was not at checker’s end. And maybe would have gotten some points.

It is a weird error, your implementation doesn’t print a valid output. Also it has an undefined behaviour. When I run it in the testing page it always gives wrong answer.

I didn’t find bugs in the checker. My guess is that under some circunstances one of the SPOJ servers is not running the spoj_asserts. We’ll rejudge submissions and update ratings in div2.