| Name | Code | Successful Submissions | Accuracy |
|---|---|---|---|
| Spreadsheet scrolling | IOPC1101 | 26 | 8.4 |
| Chocolate distribution | IOPC1102 | 29 | 4.95 |
| Truly magical numbers | IOPC1103 | 4 | 28.57 |
| Triangle equality | IOPC1104 | 13 | 9.29 |
| Military patrol | IOPC1105 | 3 | 13.64 |
| Partitioning the plane | IOPC1106 | 3 | 33.33 |
| Leaky containers | IOPC1107 | 3 | 15 |
| Progressive progressions | IOPC1108 | 4 | 25 |
| Move the books | IOPC1109 | 4 | 23.53 |
| Road trip | IOPC1110 | 13 | 16.47 |
| Giant fountain | IOPC1111 | 4 | 20.69 |
| Sister cities | IOPC1112 | 5 | 21.74 |
| Ski slopes | IOPC1113 | 3 | 37.5 |
| Place-name game | IOPC1114 | 11 | 8.63 |
| Enumeration of rationals | IOPC1115 | 7 | 5.6 |
| Counting the teams | IOPC1116 | 1 | 4.35 |
Please read the rules before starting the contest
General Rules:
1. All the teams should register at: http://www.codechef.com/teams/register/IOPC2011 before the contest starts. While registering, the teams should enter their CodeChef username in the "member information" text-box.
2. Only teams of which all members are currently registered in a university shall be eligible for prizes. However, non-students are also welcome to participate. Teams need to register on the IOPC site as well to be eligible for prizes.
3. Registration will shut once the contest begins.
4. Teams will be able to view problems individually, but will be able to submit solutions only by logging in with their team id.
5. There may be a maximum of 3 participants per team.
6. Each participant should be the member of one and only one team.
7. Submitting the same code by more than one team will lead to disqualification of teams.
8. Discussion of strategy, suggestions or tips in the comments during a live contest shall lead to disqualification. Posting questions clarifying the problem statement is ok. Comments will be published only after admin approval during the contest. If you have any further queries, organizers will be available for chat for the duration of the contest at iopc2011@gmail.com
Rules for Ranking:
1. Users 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 most problems solved. Ties will be broken by the total time for each user in ascending order of time.
3. 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.
Announcements
- The contest is now over! Congratulations to the winners
- The solution outline to the problems can be seen here.
- T-shirts will be given as prizes to the teams that give the successful submissions with minimum code length to IOPC1101 (Spreadsheet scrolling). There are more goodies on offer too!
- We will contact the winners in a few days with prize details

Fetching successful submissions

RECENT COMMENTS FOR THIS SECTION: