I would like to invite you all to Biteration #2, a triannual event by Sparcity, the Official CodeChef Campus Chapter of Indian Institute of Information Technology, Una. The Contest will be Rated for Div. 2.
Yup, Div. 1 Ratings won’t be affected.
Div. 1 users won’t feature in the live Ranklist during the Contest shown on Codechef. Although combined Ranklist would be published after the Contest for Prizes.
@anon55659401 It means that points alloted for passing each test case for any problem may or may not be 100 pts. The Max points per problem (points after passing all test cases) would follow a varied distribution.
I can’t guarantee any exact date, but we’d try to dispatch it to the winners as soon as possible.
For now, Enlighten us with any feedback for our future iterations of Biterations to come
Please do something about server load. All the time, we were getting it and it reduces the rank for no reason.
Also, in the 3rd problem(MATHL), brute force gives TLE for 1st substask.
And, many things in the 2nd problem were unclear.
Example:–>
For this case:-
1 1 1 1 1
x=10…
Would ‘A’ eat up all the boxes or only “4” ?
Those who assumed 1 thing got AC and those who assumed other, got WA. It was more of dependent on luck.
According to my knowledge, everything in the 2nd Problem was explained in atleast one of the lines in the problem statement.
U can ask me any case, and I’d explain it from the problem statement itself.
About the case 1 1 1 1 1 1, A can’t eat all boxes, because both won’t reach the last box at the same time, B reaches at exactly 0 time, how can u assume that A would also reach there at 0 time, since he needs to eat 4 boxes involving 4 candies before?
But A starts eating candies from the leftmost box, and in the sample explanation also, he eats from left to right, so he can’t eat all the left candies in 0 time.