"> CoDecode | Techfest, IIT Bombay

CoDecode

INR 40,000 Prize

Apply for Stay @ IITB

Sponsor

Teams are required to unravel real-life issues through coding. Participants should tackle the most significant conceivable questions in indicated time interim in the most proficient way. The programming aptitudes of members would be tested in this competition.

The top 5 teams from each Zonal Qualifier will qualify for the Grand Finale to be held during Techfest 2022-23 (given that their score is more than a minimum cut-off score which will be decided later).

Description of Competition:
1. It is a 3-hour coding contest.
2. Teams will use coding to solve extremely tricky mathematical problems that can't be solved by using a calculator.
3. Problems will revolve around mathematical intricacies, statistical predictions, physics, seepage, real-life scenarios, and much more.

Scoring:
The exact marking scheme will be disclosed later. There would be some tie-breaker questions in the paper in case of a tie. The person with more correct answers to the tie-breaker questions would be given a higher position.

Eligibility:
All students with a valid identity card from their respective educational institutes are eligible to participate in the event.

Programming Languages Allowed:
1. C
2. C++
3. Java
4. Python
5. Perl

Example of a problem:
Given n numbers such that their sum is not divisible by 4, remove k numbers such that after every removal, the sum of the remaining numbers is not divisible by 4. Find the maximal sum of n-k remaining numbers.
Solution:
Divide the initial n numbers into four separate arrays corresponding to the 4 different remainders they leave when divided by 4. Now, sort them. Let's call these arrays a0, a1, a2, and a3. Now, say the sum of n numbers is divisible by 4.
f(k, a0, a1, a2, a3) = max {f(k-1, a0, a1+1,a2,a3), f(k-1,a0,a1,a2+1,a3), f(k-1,a0,a1,a2,a3+1)}
If the sum upon dividing by 4 gives a remainder of 1, we would have considered the arrays a0, a2 and a3.
Test case: n = 10 {44, 12, 45, 23, 22, 34, 47, 37, 50, 31}, Sum = 345
Answers:
k = 1, 333
k = 2, 311
k = 3, 279
k = 4, 257
k = 5, 223
k = 6, 186
k = 7, 142
k = 8, 97
k = 9, 50
k = 10, 0

Round 1:
Qualifier will be held in zonals and in wildcard round during Techfest

Round 2:
Finale will be held at Techfest 2022-23

  1. Participants have to bring their own laptops during the competition.
  2. Teams will be responsible for their devices. It is advised that laptops should be charged before the competition.
  3. Use of online compilers and the internet is not allowed. Participants have to come with offline compilers pre-installed on their laptops.
  4. Mobile phones are not allowed during the competition.
  5. The organisers reserve the right to change any or all of the above rules as they deem fit. Change in rules, if any, will be highlighted on the website and notified to the registered teams.
  6. Online Compiler is strictly not allowed. Any team found using it will be disqualified from the competition.
Prateek Mishra
+91 75186 23023
[email protected]
Wildcard Entry