Editing Canadian Computing Competition

Jump to: navigation, search

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 1: Line 1:
 
The '''Canadian Computing Competition''' (CCC) is an annual [[programming competition]] for Canadian secondary school students, administered by the Centre for Education in Mathematics and Computing (CEMC) at the University of Waterloo. It was first held in 1996. It occurs in two stages, known simply as '''Stage 1''' and '''Stage 2'''. The primary difference is that Stage 1 is open whereas one must qualify to Stage 2 by achieving a high score on Stage 1. Understandably, Stage 2 problems tend to be considerably more difficult than Stage 1 problems.
 
The '''Canadian Computing Competition''' (CCC) is an annual [[programming competition]] for Canadian secondary school students, administered by the Centre for Education in Mathematics and Computing (CEMC) at the University of Waterloo. It was first held in 1996. It occurs in two stages, known simply as '''Stage 1''' and '''Stage 2'''. The primary difference is that Stage 1 is open whereas one must qualify to Stage 2 by achieving a high score on Stage 1. Understandably, Stage 2 problems tend to be considerably more difficult than Stage 1 problems.
 
The CCC may be regarded as Canada's national [[informatics olympiad]] (OI). Like other OIs, it consists exclusively of problems that are fundamentally algorithmic in nature; and again like other OIs, it is used to select students to represent the country at the [[International Olympiad in Informatics]] (IOI).
 
The CCC may be regarded as Canada's national [[informatics olympiad]] (OI). Like other OIs, it consists exclusively of problems that are fundamentally algorithmic in nature; and again like other OIs, it is used to select students to represent the country at the [[International Olympiad in Informatics]] (IOI).
 
+
Contents [hide]
In 2014, Stage 2 was renamed to '''Canadian Computing Olympiad''' (CCO).
+
1 Stage 1
 +
2 Stage 2
 +
2.1 Historical cutoff values
 +
3 Problems
 +
[edit]Stage 1
  
 
==Stage 1==
 
==Stage 1==
Line 9: Line 13:
 
The competition itself, held in or around February, is three hours long and comprises five problems of varying difficulty (each worth 15 points, for a total of 75). It can be written in any programming language, except for symbolic computation languages such as Mathematica. Contestants may bring arbitrary printed reference material to the competition (that is, not electronic), such as pre-written code, or algorithmic texts such as Introduction to Algorithms by Cormen et al. Reference materials may also be supplied by the proctor. Competitors are additionally permitted to use the Internet to access an online reference for their programming language ([http://cplusplus.com/ example]).
 
The competition itself, held in or around February, is three hours long and comprises five problems of varying difficulty (each worth 15 points, for a total of 75). It can be written in any programming language, except for symbolic computation languages such as Mathematica. Contestants may bring arbitrary printed reference material to the competition (that is, not electronic), such as pre-written code, or algorithmic texts such as Introduction to Algorithms by Cormen et al. Reference materials may also be supplied by the proctor. Competitors are additionally permitted to use the Internet to access an online reference for their programming language ([http://cplusplus.com/ example]).
  
Since 2000, Stage 1 has been offered in two difficulty levels, Junior and Senior. Every eligible high student may write either the Junior or Senior competition in a given year, but not both. Students are permitted to see both the junior and senior contests and may submit solutions to a mixture of junior and senior problems if they wish. Students who have at least two years of experience in computer science are strongly encouraged to write Senior.
+
Since 2000, Stage 1 has been offered in two difficulty levels, Junior and Senior. Every eligible high student may write either the Junior or Senior competition in a given year, but not both. Students are permitted to see both the junior and senior contests and may submit solutions to a mixture of junior and senior problems if they wish. Students who have at least two years of experience in computer science are strongly encouraged to write Senior.)
  
 
Cash prizes are awarded for high scorers in both divisions. The CEMC also publishes results showing the names of high-scoring students (although it does not show their precise scores). The top twenty or so finishers in Stage 1 Senior are invited to Stage 2. High scorers in the Senior division of Stage 1 may also be considered for scholarships by the University of Waterloo.
 
Cash prizes are awarded for high scorers in both divisions. The CEMC also publishes results showing the names of high-scoring students (although it does not show their precise scores). The top twenty or so finishers in Stage 1 Senior are invited to Stage 2. High scorers in the Senior division of Stage 1 may also be considered for scholarships by the University of Waterloo.
Line 28: Line 32:
 
===Historical cutoff values===
 
===Historical cutoff values===
 
These values are obtained by counting the number of students who qualified to Stage 2 in each year (listed on the CEMC's official results) and comparing this to the values in the table given at the end of the results which maps score to rank. Prior to 2001, the latter is not given, so the cutoff cannot be determined. In 2002 and 2007 the cutoff is uncertain because no value would have given the exact number of stage 2 invitees listed, assuming the table is correct.
 
These values are obtained by counting the number of students who qualified to Stage 2 in each year (listed on the CEMC's official results) and comparing this to the values in the table given at the end of the results which maps score to rank. Prior to 2001, the latter is not given, so the cutoff cannot be determined. In 2002 and 2007 the cutoff is uncertain because no value would have given the exact number of stage 2 invitees listed, assuming the table is correct.
[[File:CCCStage2Cutoff.png|300px|thumb|right|CCC stage 2 cutoff data in graph form]]
 
 
* 2001: 59
 
* 2001: 59
 
* 2002: 57 (?)
 
* 2002: 57 (?)
Line 41: Line 44:
 
* 2011: 63
 
* 2011: 63
 
* 2012: 64
 
* 2012: 64
* 2013: 71
+
These data show no clear trend over time. However, they give a good idea of the difficulty of each year's CCC Stage 1 Senior; harder years tend to have lower cutoffs, since the cutoff is determined by the score of the twentieth or so best contestant. (Of course, some years have stronger contestants than others, so one should exercise discretion with this interpretation.) The all-time high value of 66 in 2008 was presumably due to the fact that the hard problem, {{Problem|ccc08s5|Nukit}}, was a relatively easy exercise in [[dynamic programming]]; several students in fact achieved perfect scores. In 2009, the last problem, {{Problem|ccc09s5|Wireless}}, was ad hoc and presumably intended to be solved with [[difference array]]s, a technique that few contestants knew; in addition, the fourth problem, {{Problem|ccc09s4|Ship and Shop}}, had huge input data and could have been challenging to optimize. Predictably, the cutoff took a nose dive; one cannot help but wonder whether the organizers were trying to make up for the abnormally high cutoff the previous year. For reason or reasons unknown, the contest was made even more difficult the following year, with problems S3, S4, and S5 all quite difficult; there was no perfect score in that year. The resulting cutoff of 41 was the lowest in "recorded" CCC history. The cutoff returned to a more "normal" value in 2011.
* 2014: 56
+
* 2015: 64
+
These data show no clear trend over time. However, they give a good idea of the difficulty of each year's CCC Stage 1 Senior; harder years tend to have lower cutoffs, since the cutoff is determined by the score of the twentieth or so best contestant. (Of course, some years have stronger contestants than others, so one should exercise discretion with this interpretation.)
+
 
+
The (at the time) all-time high value of 66 in 2008 was presumably due to the fact that the hard problem, {{Problem|ccc08s5|Nukit}}, was a relatively easy exercise in [[dynamic programming]]; several students in fact achieved perfect scores.
+
 
+
In 2009, the last problem, {{Problem|ccc09s5|Wireless}}, was ad hoc and presumably intended to be solved with [[difference array]]s, a technique that few contestants knew; in addition, the fourth problem, {{Problem|ccc09s4|Ship and Shop}}, had huge input data and could have been challenging to optimize. Predictably, the cutoff took a nose dive; one cannot help but wonder whether the organizers were trying to make up for the abnormally high cutoff the previous year.
+
 
+
For reason or reasons unknown, the contest was made even more difficult the following year, with problems S3, S4, and S5 all quite difficult; there was no perfect score in that year. The resulting cutoff of 41 was the lowest in "recorded" CCC history.
+
 
+
The cutoff returned to a more "normal" value in 2011 and 2012. Then, 2013's cutoff was the highest in CCC history. This may be attributed to the fact that all of the problems were fairly straightforward, except S5 which required some optimization in order to crack the larger test cases.
+
 
+
Troy Vasiga, director of the CCC, had the following to say about the recent high cutoffs:
+
:''I think we have stopped clubbing students on Stage 1 like baby seals, especially in the last couple of years.  I think something in the low 60s is probably about the "right" score for the cutoff:  ace the first 3 problems, make sure you don't mess up S4 and get something intelligent on S5.''<ref>Troy Vasiga. Personal communication. March 10, 2013. Included with permission.</ref>
+
  
 
==Problems==
 
==Problems==
 
Past CCC problems from both Stage 1 and Stage 2 may be found on the [{{JudgeRoot}} PEG Judge].
 
Past CCC problems from both Stage 1 and Stage 2 may be found on the [{{JudgeRoot}} PEG Judge].
 
==References==
 
<references/>
 

Please note that all contributions to PEGWiki are considered to be released under the Attribution 3.0 Unported (see PEGWiki:Copyrights for details). If you do not want your writing to be edited mercilessly and redistributed at will, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource. Do not submit copyrighted work without permission!

Cancel | Editing help (opens in new window)

Templates used on this page: