Hello everyone,
Computer Club, MNNIT Allahabad is glad to invite you to the annual programming competition of MNNIT Allahabad, India, which is an ACM-ICPC style team programming contest of 3 hours duration held on CodeChef during its annual technical fest Avishkar. The team can consist up to 3 members. The problemset promises to be interesting for everyone. The characters in the problem statements are based on Breaking Bad.
Details:
Contest Date : 3rd September 2017
Time : 2200 to 0100 IST
Programming Partner : Codechef
Register your teams here->Contest Link
For online round, top two global and top two MNNIT teams will be getting Codechef goodies.
For onsite round, prizes worth Rs. 31000/- to be won. Top Indian teams from the online round will be called for the onsite round to be held at MNNIT Allahabad.
Problem Setters: advitiyabrijesh, facelessman, abhi_1595, tttayushag10004, pparwal12, wittyskull, garuna and abhi1agarwal.
Last year's problemset : Insomnia-2016
Follow our facebook page for further information.
UPD 1: Languages allowed are C,C++,Java and Python (ACM ICPC Styled). Less than 3 days to go.
UPD 2: Contest is postponed by 3 hours as it was clashing with a hackerearth contest. Now it starts on 3rd September 2200 IST.
UPD 3: Contest starts in less than 10 hours.
UPD 4: The contest has ended. Congratulations to the winners.
The ranklist is here. Editorials will be shared in some time. Hope that everyone found the problemset interesting.
Searching for a teammate(s) for this contest, if you want to be team with me please write PM.
Little requirement: Codeforces 1650+ rating.
UPD: In our team we are 2 people: me and haleyk100198.
UPD2: CSAcademy made training contest for EJOI, so I can't participate Insomnia :(
Do you still have any vacancy? :)
Of course :)
Oh no!! I'm short by 1651 — 1616 :(
Searching for a teammate(s) for this contest, if you want to be team with me please write PM.
Little requirement: Codeforces 1200- rating.
I'm surplus by 1616 — 1199
I'm close to fulfilling your criteria
XD
If anyone finds me fit for their team, PM me.
Can we form a team ?
Unfortunately, I can't participate at all, on 3rd september.
Why ??
I have some place to be, on sept 3rd. even if i compete, i'll be tired a lot.
which languages are allowed ?
Updated the post
thanks
Hackerearth's Indiahacks online Final round is on 3rd Sept, 6-9 pm(IST). Would you mind shifting your contest hours by at least 2 hours? thanks.
Postponed the contest by 3 hours :)
Bump! Contest starts in under half an hour! Happy Coding!
Solution for the last one?
Approach to the problem is mentioned in the following doc. Detailed editorial will be shared soon.... https://docs.google.com/document/d/1kdakJwMS-n7M2h6YH-Nl2_hMGEQqz0Bl9u0R8cY5YVI/edit?usp=sharing
Approach to Tuco meets Heisenberg?
here
Approach to solve Total Meth ?
I solved it by constructing a recurrence for the sum . First lets solve the problem when N is a power of 2 minus 1. You can solve it for any value of N once you solve for powers of 2 minus 1.
bi denotes the number of 1's in binary representation of i.
If you notice the binary representation of numbers from
to N - 1 , it is same as the numbers from 0 to 
with an extra 1 added to the front . We can exploit this fact to create the sum.
Let
S(N) = S(N' - 1) + [((N' + 0) * (b0 + 1)) + ((N' + 1) * (b1 + 1)) ... ((N' + N') * (bN' + 1))]
T(N) = 2 * T(N') + N'
Hence you can compute the value of S(N), T(N) in O(log(N)) .
For solving for any value of N you need to split it into smaller powers of 2 and combine the results . Our AC CODE
Any expected time for when editorials will be published?
how to solve walter and skyler?
Editorials have been added for most of the problems.
Editorials
Happy Upsolving :)
My team (Team TooLazyToPropagate, winners of onsite round) has not received the prize yet (and it has been 5-6 months already). Please look into the matter and resolve.
My team (runner ups) also hasn't received anything and it has been over 5 months.