The IOPC 2012 Contest has ended!
Solution booklet on each problem can be found here.
All problems have been added to the practice section.
Solutions are public for all problems.
And do not forget to read the Blog Post here.
Rules for Registration
- A team can consist of atmost 3 members.
- All the members must be registered on Codechef. Then the team can participate by registering at this link: http://www.codechef.com/teams/register/IOPC2012/
- Only teams of which all members are students currently registered in a university shall be eligible for prizes. However, non-students are also welcome to participate
- To be eligible for prizes, teams and members have to register on the IOPC page as well.
- The coordinators will be available for any queries/clarifications on email@example.com
- 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.
- Teams are ranked according to the most problems solved. Ties will be broken by the total time for each team in ascending order of time.
- 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 submittal 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.
- You can get more information about team contests here.
- Permissible languages to send solutions in are C, C++, Pascal, Python and Java
- Compilers to be used: gcc-4.3.2 for C, g++-4.3.2 for C++, fpc-2.2.4 for pascal, python-2.5 for Python and javac-1.6.0_12 for Java
- All problems will be posted on Saturday, 14th January 2012 at 1200 hours - Indian Standard Time (GMT +530) and the competition closes on Sunday, 15th January 2012 at 1200 hours IST
- Solutions have to give the correct output for all the test data for a given problem to be deemed correct. There is no partial credit.
- Solutions can be submitted in any order.
- Each problem will have a certain specified input and output format. This format has to be adhered to, else the submission will not be accepted.
- Any team found to be indulging in any form of malpractice will be immediately disqualified.
- The decision of the organizers in declaring the results will be final. No queries in this regard will be entertained.
- The event does not require the participants to be present in IIT for participation. And hence, no registration fee is required
January 14th, 12:00pm: Techkriti - IOPC 2012 has started!
January 14th, 12:26: There was a small typo in the limits for N in IOPC1211 (The Numbers Game). It has been fixed now. There will be no penalty for submissions till now on that problem.
January 14th, 12:47: Some minor changes have been made in the statement of IOPC1213 (Coloring Graphs)
January 14th, 12:58: The error in the sample test case for IOPC1214 has been rectified
January 14th, 2:27: The limits on the answer for IOPC1211 has been modified. Please take note of that. Any submissions on this problem upto this point will not carry any penalties.
January 14th, 17:34: The sample IO for IOPC1208 has been modified. Please take note.
January 14th, 18:50: The output for IOPC1208 is to be given modulo 10^8 + 7. The problem has been edited as well. All penalties till now on that problem will be discounted.
January 15th, 02:30: There was an error in the test data for IOPC1215. It has been corrected and all solutions have ben rejudged.
January 15th, 12:00: The contest is complete. Congratulations to the winners! prize winners will be contacted directly by the IOPC team.
The problems and solution booklet can be found here