Invitation to CodeChef May Long Challenge 2018!

general
,
14

Hello all,

In view of delay of editorials, I had a discussion with @mgch and @admin , and we decided that due to issues with current Editorialist, Problem Tester (Suchan Park) will now write the editorials. I assure you that this task is at highest priority for contest admin @mgch and @admin and they will try their best to provide you guys with quality editorials of the problems.

Regards
@vijju123

1 Like
15

Looking forward to some great problems!!! :smiley:

1 Like
16

Haha you forgot my name in the authors’ list :stuck_out_tongue:

17

@nileshjha19 but you don’t have access to the problem setting panel, cause you will participate in Div1 :stuck_out_tongue:

P.S. Added :slight_smile:

1 Like
18

Yo sure!

P.S. You take care of the comments xD

19

LOLOLOLOLOL XD. Nice one @nileshjha19 XD

1 Like
20

4th May to 14th February? CodeChef problem setters can reverse time wow :slight_smile:

4 Likes
21

@swetankmodi You are an observer! :wink:

1 Like
22

Or perhaps-

4th May 2018 to 14th February, 2019.

I notice how the contest is ending abruptly at Valentines day. Chef will be busy or what? :stuck_out_tongue:

23

@swetankmodi 14th February is a very nice day :slight_smile: Not only time :smiley:

Thanks, fixed.

1 Like
24

Very true @mgch . There are usually back to back 3-4 contests in a row that day. Very nice day indeed :slight_smile: :stuck_out_tongue: :stuck_out_tongue:

25

@vijju123 you should prevent time travel before the blog will be posted for the next time! :smiley:

1 Like
26

XDXDXD.

I’ll do whatever is in my power to stop that :stuck_out_tongue: XD :slight_smile:

27

@vijju123 it’s fun to take part on the contests that day since most of us are free :stuck_out_tongue:

@mgch Welcome :slight_smile:

2 Likes
28

never got that opportunity :stuck_out_tongue:

29

Solving div2 Questions from div1 will not affect your ratings. In case they do, it will be a bug and you can get opportunity of getting codechef laddus from @admin :stuck_out_tongue: X)

1 Like
30

Besides, @vijju123, @mgch, @admin, please add problems to practice section.

31

@l_returns, How did u reduce the given problem to max sum subsequence such that no two adjacent elements are taken? Can u explain in bit detail?

32

There are multiple issues with your code, i won’t tell you the exact issues. But i would recommend you to clean your code first and use MOD whenever required. Read each expression in your code and ask yourself whether the MOD operation is really required.
One example is this line:
base_f[i] = (base_f[i - 1] % MOD + base_f[i - 2] % MOD) % MOD;
base_f[i - 1] is already smaller than MOD so using another mod just makes it messy.

Once you do that, submit again and if your solution is still failing link back your latest solution in comment and i will help.

33

Still giving WA on those two cases.