| Name | Code | Successful Submissions | Accuracy |
|---|---|---|---|
| Balanced Primes | BALPRIME | 137 | 28.41 |
| Counting Stars | COUNTSTR | 232 | 55.36 |
| Gray Codes | GRAYCODE | 101 | 21.31 |
| nCr as a Service | NCRAAS | 124 | 38.14 |
| Protecting Sheep | PRTCTSHP | 26 | 26.12 |
| Spiral Numbers | SPRLNMS | 222 | 44.46 |
The Contest has ended!
All problems have been added to the practice section.
Solution booklet for the problem set is available here.
Solutions are public for all problems.
Dementia - Survive the Coding Madness
With a large number of programming languages at your disposal, it’s just you - the warrior, your language - the weapon and mind boggling problems - the treasure to be won. With our Programming Partner "Codechef", we hereby bring Round1 right in front of you to be grabbed sitting in your cozy couch. Round1 will be an online programming competition with a certain set of problem statements to be solved within a given time limit. The top 15 participants of Round1 will get a chance to rub their feet in an exclusive Round2, to be held at IIT Mandi during EXODIA, unique in itself, as it will follow an Elimination strategy under which the participant at the bottom of the Leader board will get eliminated at a regular time interval. Go to http://exodia.in/events/technical/dementia/ for more details.
Prizes worth Rs 15,000 to be won.
Rules and Regulations:
1. All problems will be posted on Saturday, 21th January 2012 at 18:00 hours - Indian Standard Time (GMT +530) and the competition closes on Sunday, 22nd January 2012 at 00:00 hours IST. Check your timezone.
2. It will be open for all STUDENTS, no professional will be allowed.
3. Both the Rounds are for individuals. No teams are allowed.
4. To participate in Round1, get yourself registered at Codechef. For Registration visit CodeChef. Get your hands on the format of Dementia and start practicing on Codechef.
5. There is no restriction on the programming language to be used. Almost all languages are supported by Codechef.
Judging Criteria:
1. You will receive one point for solving a problem (passing all test cases - no partial credit), regardless of the level of difficulty of that problem.
2. Users are ranked according to the most problems solved. Ties will be broken by the total time for each user in ascending order of time.
3. The decision of the organizers in declaring the results will be final. No queries in this regard will be entertained.
4. Any participant found to be indulging in any form of malpractice will be immediately disqualified.
5. The total time is the sum of the time consumed for each problem solved. The time consumed for a solved problem is the time elapsed from the beginning of the contest to the submission of the first accepted run plus 20 penalty minutes for every previously rejected run for that problem. There is no time consumed for a problem that is not solved.
Contact
| Tushar Dublish | tushar_dublish@students.iitmandi.ac.in |
| Vikhyat Korrapati | k_vikhyat@students.iitmandi.ac.in |
| Sumeet Singh Arora | sumeet_singh@students.iitmandi.ac.in |
Announcements
21/01/2012 06:25 PM (IST): The rankings of the contest can be viewed here.
21/01/2012 07:15 PM (IST): Be sure to register for the contest: Click here to register.
Fetching recent activity
RECENT COMMENTS FOR THIS SECTION: