Problems

• Problem 1 : Angels and Demons [ html | pdf | ps ]
• Problem 2 : Pipes in factories [ html | pdf | ps ]
• Problem 3 : Sibonian protein folding [ html | pdf | ps ]
• Problem 4 : Harmonic mean [ html | pdf | ps ]
• Problem 5 : Gandalf's party [ html | pdf | ps ]
• Problem 6 : Fermat vs Gauss [ html | pdf | ps ]
• problem 7 : Cost minimization [ html | pdf | ps ]
• Problem 8 : IITK party [ html | pdf | ps ]
• Problem 9 : Linear equations [ html | pdf | ps ]
• Problem 10 : Transmitting signals [ html | pdf | ps ]
• Problem 11 : Enumerating strings [ html | pdf | ps ]

Problem credits

We thank the following who helped us in setting the problems of the contest:

• Gagandeep Singh (IITK)
• Hemanta Kumar Maji (UIUC)
• Neeraj Kayal (IITK)
• Nikhil Aggarwal (IITK)
• Pushpraj Shukla (University of Texas, Austin)
• Sumeet Agrawal (IITK)

Please note the following:

• Submission instructions are given here.
• Real time rank list will be available here.
• If you have any queries at the time of the contest, please send a mail to iopc_query@techkriti.org. Emails sent to any other email address will not be entertained.
• If any problem statement is changed, that will be shown in the left hand side column of the problems. We will not send any mails to all teams for updates on problems. Please keep checking the html version of the problem statements for update.
• The footer of each problem statement will show when the problem has been last changed.
• Please read the problem statement carefully before submitting queries. If you ask a question whose answer is clear from the problem statement, we may not reply to those queries.