Browse wiki

From IOI Wiki
Jump to: navigation, search
The difficulty of programming contests increases
Abstract In this paper we give a detailed quantitat
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.
se Theory to analyze past contest results.  +
BookTitle Teaching fundamentals concepts of informatics +
Conference 4th international conference on Informatics in Secondary Schools: Evolution and Perspectives (ISSEP) +
DOI 10.1007/978-3-642-11376-5 8 +
Free 0 +
Has author Michal Forišek +
Pages 72-85 +
Publisher Springer +
Series Lecture Notes in Computer Science +
Title The difficulty of programming contests increases +
Type Conference paper +
Volume 5941 +
Year 2010 +
Categories Publications about contest statistics
Modification date
This property is a special property in this wiki.
27 July 2010 20:05:33  +
hide properties that link here 
The difficulty of programming contests increases + Title
 

 

Enter the name of the page to start browsing from.