ABOUT
Planet Zion came out to be perfectly suitable for establishing civilization. But still more things needed to be known about Zion in order to plan the necessities. He soon came to know that all the information he needs has been studied by the livings over there and stored somewhere. He somehow gets to the place but he came to know that the information is completely encrypted.
Now he's got all the hints which he needs to decode. Can you help Nova to decode it and help him establish a better living for humans?
TASK
Teams are required to solve the real life problems through coding. Programming skills of participants would be tested.
FORMAT
Event Description:
1. It is a 3 hour coding contest.
2. The teams will write codes for solving some of the trickiest numerical problems which can't be solved by using a calculator.
3. Problems will be based on mathematical intricacies, statistical inferences, physics, seepage, real-life situations and other related stuff.
Given below is a sample problem:
Given n numbers such that their sum is not divisible by 4, remove k numbers such that after every removal, the sum of remaining numbers is not divisible by 4. Find the maximal sum of n-k remaining numbers.
Solution:
Divide the initial n numbers into 4 separate arrays corresponding to the 4 different remainders they leave when divided by 4. Now, sort them. Lets call these arrays a0, a1, a2, a3. Now, if 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 with 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
Programming Languages Allowed:
1. C
2. C++
3. Java
4. Python
5. Perl
JUDGING
Scoring
The exact marking scheme will be disclosed later. In case of a tie, the teams that tie will be given a problem and the winner will be decided on the basis of time taken to solve that problem.
Eligibility
All students with a valid identity card of their respective educational institutes are eligible to participate in the event.
Certificate Policy
1. Top three teams will qualify for the finale and will be awarded Certificate of Excellence for the zonal round.
2. Certificate of participation will be given to the top 50% teams(provided they have a non-zero score).
General Rules:
1. The organisers reserve the rights 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.
2. Note that at any point of time, the latest information will be that, which is on the site. The information provided in the pdf downloaded earlier may not be the latest. However, registered participants will be informed through mail about any such changes.
3. Participants have to bring their own laptops during the competition.
4. Charging points will be provided at the venue for assistance.
IDEATE
Competitions
Events
HOME
INITIATIVES
IDEATE
COMPETITIONS
SUMMIT
TWMUN
WORKSHOPS
LECTURES
EXHIBITIONS
TECHNOHOLIX
OZONE
MERCHANDISE
HOSPITALITY
MEDIA
POLICY
ABOUT US
SPONSORS
CONTACT US