The difficulty of programming contests increases

From IOI Wiki
Jump to: navigation, search
Pub conference.png
  • Conference paper: The difficulty of programming contests increases
  • Author(s): Michal Forišek
  • Book: Teaching fundamentals concepts of informatics, Springer, 2010, pp. 72-85
  • Series: Lecture Notes in Computer Science, vol. 5941
  • DOI: 10.1007/978-3-642-11376-5_8
  • Conference: 4th international conference on Informatics in Secondary Schools: Evolution and Perspectives (ISSEP)

Abstract: In this paper we give a detailed quantitative and qualitative analysis of the difficulty of programming contests in past years. We analyze task topics in past competition tasks, and also analyze an entire problem set in terms of required algorithm efficiency. We provide both subjective and objective data on how contestants are getting better over the years and how the tasks are getting harder. We use an exact, formal method based on Item Response Theory to analyze past contest results.

Download: http://dx.doi.org/10.1007/978-3-642-11376-5_8 (requires subscription)