Invitation to Coders' Legacy 2018 (Rated)

Hello CodeChef community,

On behalf of KeyGEnCoders, the programming club and CodeChef Campus Chapter of Kalyani Government Engineeing College, I would like to invite you all to Coders’ Legacy 2018. The contest will be rated for both divisions.


The contest will start on Sunday 15 April at 21:30 IST and the duration will be of 3 hours. It will have an ACM style ranklist with the penalty set to 10 minutes. There will be 6 problems of varying difficulty.

The problem setting team includes @avijit_agarwal, @sarthakmanna, @mayukh45, and myself. I would also like to thank Arjun Arul from CodeChef for helping out with the problems.

Top 5 Indian and top 5 non-Indian winners will get 300 CodeChef laddus each.

Good luck to all and wish you high rating :slight_smile:

UPDATE: The contest starts in 30 mins.

UPDATE 2: The contest has ended. Check out final standings and editorials. Hope everyone enjoyed the problems! The cakewalk problem turned out a little harder than we expected, we apologize for that :confused: Thank you for your participation.


the level of the contest is too hard :frowning:

For the Fibonacci problem sorting the frequencies and checking the condition didn’t work for me. Did it work for others? If no, why?

Thank You very much for bringing up the Editorials as soon as the contest ended.

One of the best contest i too part in!!

I thought it was tough for me in the beginning but was little surprised when I looked on the number of submissions. I kept trying and managed to get one correct answer at the end. The clock question was very well set, easy to code but tricky logic. Thanks for publishing editorials so fast :slight_smile:

Also why is the rating predictor tool showing

Error: No contest predictions found for such contest!

Is it because there is some mistake in link?

when Rating will be update for this contest

1 Like

Hello, I did not get the laddus for this contest.

Maybe the triangle problem was a bit too hard; and the cakewalk problem turned out somewhat not ‘cakewalk’. Other than these two, were the questions too hard?

1 Like

Please refer to the editorial

That is because in a permutation that satisfies the condition, F_i > F_{i-1} for all i \ge 3. But F_2 > F_1 is a wrong assumption.

Thanks for replying! Could you give me an example of frequencies where sorting them does not find a solution?

Sure, (1, 2, 3, 4) for example. The permutation that satisfies the relation is (2, 1, 3, 4).

Wow :smiley: I see, didn’t think about this. Thanks!

A lot of people didn’t think about this :stuck_out_tongue:

Including me!

You’re welcome :slight_smile:
use the databread rating predictor.

It deviates a lot from original ratings.