Hello CodeChef Community!
The May Long Challenge 2018 is at your doorstep to treat you with a programming fixture for 10 exciting days. You surely wouldn’t want to miss this one! I hope you will join your fellow programmers and enjoy the contest problems. Joining me on the problem setting panel are:
Registration: You just need to have a CodeChef handle to participate. For all those, who are interested and do not have a CodeChef handle, are requested to register in order to participate.
Prizes: Top 10 global and top 20 Indian winners get 300 Laddus each, with which the winners can claim cool CodeChef goodies. Know more here: "Laddus" For You | CodeChef. (For those who have not yet got their previous winning, please send an email to winners@codechef.com). First to solve each problem individually: 100 laddus (For problems common to both Divisions, only one user will get laddus for that problem).
If i submit problems from the div2 page,despite being div1 would that be considered as practice problems or will i be considered to participate in may challenge?
Here is my approach for change the sign… I have used algorithm for finding max sum subsequence such that no two adjacent are taken at a time(not only max sum but the subsequence also)… Have a look at my solution … @vivek_shah98
@vijju123 I was in div-1 and got 107 rank will I get 300 laddus ? I set filter to India in ranklist and if 20 different rank values are considered then I should get them.
Can some one please tell me where my solution is going wrong for FAKEBS!! This is my solution. This is another solution I’ve tried to the same question. Irony is that both of them failed for the same test cases
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.