The Difficulty of Programming Contests Increases
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...
        Saved in:
      
    
          | Published in | Teaching Fundamental Concepts of Informatics Vol. 5941; pp. 72 - 85 | 
|---|---|
| Main Author | |
| Format | Book Chapter | 
| Language | English | 
| Published | 
        Germany
          Springer Berlin / Heidelberg
    
        2010
     Springer Berlin Heidelberg  | 
| Series | Lecture Notes in Computer Science | 
| Subjects | |
| Online Access | Get full text | 
| ISBN | 9783642113758 3642113753  | 
| ISSN | 0302-9743 1611-3349  | 
| DOI | 10.1007/978-3-642-11376-5_8 | 
Cover
| Summary: | 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. | 
|---|---|
| ISBN: | 9783642113758 3642113753  | 
| ISSN: | 0302-9743 1611-3349  | 
| DOI: | 10.1007/978-3-642-11376-5_8 |