The following teams have qualified for the final round of the e-Lite Senior Quiz:
Tanish Goel (X-I) and Aditya Batra (X-G)
Aravind Ashok (X-L) and Hritik Arya (X-K)
Bhavya (XI-J)
Praman Verma (XI-H) and Saransh Ratyayanan (XI-H)
Nishant Maini (X-A) and Akshat Singh (X-A)
Kriti Singh (XI-M) and Aryan Ambardar (XI-G)
Congratulations!
The Exun Clan presents Exun e-Lite 2015, Exun’s annual recruitment event open to all students from classes 6th to 11th. The event details are as follows :
The top 6 teams in the junior quiz prelims will qualify to the junior quiz finals. The preliminary round for the senior quiz, hardware and crossword events will be on a single paper. The top 6 teams in the hardware section alone will qualify to the hardware finals, the top 6 teams in the crossword section alone will qualify to the crossword finals, and the top 6 teams overall, in the entire paper, will qualify to the senior quiz finals.
No prior knowledge of programming is required for the preliminary rounds of the Programming event and therefore, if you think you’re good at solving puzzles and can work your way around patterns and sequences, then, have a crack at the paper, you must! Participants shall be required to qualify a logic-based written prelim round following which they shall face a grueling onsite final.
You can register now, here. The Onsite Events will be held through two days, i.e., Thursday, 9th July, 2015 and Friday, 10th July 2015
Below is the schedule for e-Lite 2015 (Click to enlarge) 
Creative Event Preliminary Round
Preliminary round entries will be judged by alumni and the best few entrants will be part of a final round which will take place at school.
Here is the preliminary prompt for e-Lite 2015’s Creative Event: http://bit.ly/eLite2015CE
Please note that participation is strictly individual. Team entries will not be considered. An FAQ section with complete details on the event has been included in the prompt, but please feel free to contact us at exunclan@gmail.com with any questions or queries you may have, or if you wish to use a software program not listed in the prompt.
Here is the editorial for the Senior Programming Finals. The contest can be found here
Problem1. Odd
This was a straightforward question. Only perfect square numbers have an odd number of factors. Though this can be seen by observation(and is sufficient for solving this problem), you may want to know how we formally prove this:
Assume that there is a perfect square N. Let A be the set of natural numbers which are strictly smaller than floor(square_root(N)) . Let B be the set of natural numbers derived form A such that for every element(a) belonging to A there is a corresponding element N/a in B . The sets A and B do not intersect since if they did, a=N/a => a^2=N => a is the square root of N, but the square root of N does not belong to set A and we have a contradiction. Since these sets do not intersect, the total number of factors of N is 2*k + 1(where k is the number of elements in A, and 1 extra factor is the square root of N). Thus, N had an odd number of factors.
So, we need to output the sum of the first N perfect squares(where N was given in the problem) modulo M. The formula for that is N*(N+1)*(2*N+1)/6.
Some of you had a problem outputting the answer modulo 10^9 + 7. This is where language matters : python can easily handle large numbers and you could have just done (print ans % M) to get your solution accepted. Its different with C++ however since there can be overflows while handling large numbers, You can read more about modulo operations here. Another common mistake was using x^y over pow(x,y): x^y does not mean x raised to power y in C++, it means x XOR y.
Problem2. Walk Over Me
This is a classic Dynamic Programming problem. First of all you would need to figure out the intersection points, since the arrays are sorted this can be done in linear time. After this is done, the recurrence is simple,
maxSum(i) = max_(over all intersections j<i){ maxSum(j) + branchSum(j..i) }
For the people who got interviewed, the above recurrence is what I wanted as an answer: when we are given the optimal solutions to 1..i-1, we can find the optimal solution to i using the above recurrence.
Problem3. Mad Scientist
This was a tough problem to solve if you are not familiar with graphs. Unfortunately, some people jumped to this problem without attempting the first one(!). How you choose the problems pretty much decides how well you do in a programming contest.
For each pair of chemicals which can react, we add an edge in the graph. Once we have this information in a graph, we can find the “connected components” of this graph. When two chemicals are in a connected component, it basically means there is a sequence of links by which one can reach one of the chemicals starting from the other. For example, if A reacts with B, B reacts with C, and A reacts with D, then A,B,C,D form a connected component. Note that the order of adding chemicals within a connected component does not matter, the final power after adding all the chemicals is always initialPower * 2^(Size of Component – 1). So, the solution is to form the graph and then report the answer as 2^(V-number of distinct connected components).
Problem4. Non Zero
This was an AdHoc implementation problem. Going from the left, maintain a counter recording the position of the last zero. Whenever a nonZero element is seen, swap that element with the element at counter, and increment the counter. I think the above is better understood by some code:
Problem 6. Knights
This was a relatively hard graph problem. Consider the N*N squares on the (chess?)board as vertices. Then find the shortest distance between each pair of vertices. I used Breadth First Search to do this. The running time of this step is O(N4). Floyd-Warshall is not recommended here, since the graph is relatively sparse, and using it will cause solutions to time out. Then we wish to find the optimal point for the knights to gather at, and the total distance they need to travel to get there. For this, we iterate over each of the N*N candidate points and for each candidate point, we sum the distance each knight would need to travel to get to that point. Then we find and print the minimum value among the so-calculated distance sums of each point. The running time of this step is O(N2*M), which simplifies to O(N4) for lazy implementations, like my own. The total running time is hence O(N4).
The following students have cleared the first round in e-Lite 2013 and have been shortlisted. They are required to watch this site for further details regarding the selection procedure. The results are in no specific order.The qualified students are:
The finals shall be held in the 6th and 7th periods in the AVH.
*Teams marked with a star are tied. The tie shall be settled using a tie breaker just before the quiz final in the AVH itself.
The location for the programming finals will be announced soon.
The hardware finals will be held tomorrow in the AVH in the 6th period.
More to be announced soon.
The first phase of e-Lite 2012, the intra-school IT competition, was held on 14th-17th May, 2012.
The results for the Exun e-Lite 2012 Junior Quiz Final Event held on 17th May, 2012 are as follows:
The results for the Exun e-Lite 2012 Junior Crossword Final Event held on 17th May, 2012 are as follows:
Due to the subjective nature of the competition, no positions can be awarded. However, the following is a list of participants whose work was appreciated by the judges :
The results for the Exun e-Lite 2012 Group Discussion event are as follows:
1.*Shagun Goel (VIII K
1. Shashwat Goel (VI F)
2. Renasha Mishra (VIII H)
3. Aaryaman Batra (VIII H)
*Non-competitive.
The results for the Exun e-Lite 2012 Junior Programming event are as follows:
Inducted members :
Prospective members (To be interviewed in July) :
Congratulations to all!
Our planet has gone one long circle around the sun since last time we recruited members into the ExunClan, DPS R.K.Puram’s prestigious computer club, and we’re back with e-Lite 2012! And what is e-Lite all about? It’s about as awesome as it gets!
Registrations have closed.
If you:
- Quiz : Power up that grey matter and sharpen that neural network because this is the ultimate battle of the brains! And not a very easy one at that!You’ll be asked to recall everything ranging from modern gadgets, to latest software to popular internet phenomena! There will be 2 participants per team.
- Crossword: Fill in boxes with the correct answers according to the clues given to you.Use your knowledge of terms to make intelligent guesses based on overlapping words and common letters.A Word of Caution: Clues can get tricky! There will be 2 participants per team.
- Group Discussion: Quick-thinking, confidence and coherence backed up by statistical data and facts ensure heated debates and discussions about topics that will be given on the spot.Make your point and accommodate other’s opinions to come out at the top! There will be individual participation.
- Programming: Use your Arithmetic and Logic Unit to solve problems that have a simple and logical answer.No knowledge of programming language syntax is required for the programming event for 6th-8th.Come armed with a pencil,paper and a keen logical aptitude.There will be individual participation.
- Creative Event: Does the idea of creating something impressive from scratch excite you? Attempt the challenging scenario given to you eleven days in advance and unleash your creativity through whatever digital medium you want, the only condition being that it should be able to be viewed on a computer screen. Minimum number of people per team is 2. You can have a maximum of 4 people per team. If you aren’t able to form a team, then just include anyone who you think can help you, from classes 6th-8th. We’ll be judging individual contributions to the whole project. Don’t worry, all details will be given to you when you register. You may specialize in: Digital Imaging, Powerpoint PPT making, Flash Animation, Web Designing(HTML/CSS), Video Editing, 3D design or Audio Editing. Interested in the creative event? View this extract from the paper here.
Date: 8th & 11th August 2008
Time: During School Hours
Eligibility: Students in 11th & 12th
Events:
Note:
Needless to say we received overwhelming response for the Group Discussion Event this time , with about more than 60 students taking part. Initially meant to be a single day event we had to extend the time upto 2 days. After about 6 rounds of only prelims (Thursday), and 2 rounds of semi – finals coupled with 1 more round of final , we managed to isolate 5 worthy people out of 60. And hats off to you guyz (and us), for surviving through nine rounds and still liking the concept of Group Discussions. The winners are:
Aishwarya Kane IX H
Anamay IX H
Bharat Kashyap VI H
Tushar Bhasin IX J
Eeshita Bajpai VIII K
and I need you to contact me so that I can take down your email addresses
Thanks for your time and enthusiasm. I hope exun will benefit from your contribution in the future
Regards
Samarth Mathur XII – E
Sahil Bajaj XII – E