and are glad to bring you this year's Mock CCO contest!
This contest will consists of two sub-rounds, the separate "days" of the CCO. You can choose to start either of the rounds at any time between 2017-05-02 12:00 EST to 2017-05-07 12:00 EST, and you will then be given 3 hours to complete the 3 problems.
The rounds will not be rated.
It is recommended that you take a break between doing the rounds. The rounds will have the approximate difficulty of a CCO day.
Some problems offer partial marks in the form of subtasks. If you cannot solve a problem fully, we encourage you to go for these partial marks.
You will have 3 hours to complete day 1. After the round window begins, you may begin at any time. Once you enter the round, your personal timer will start counting down and you will be able to submit until 3 hours from when you started, or until the hard deadline (noon EST of May. 7th), whichever comes first.
After joining the contest, you proceed to the Problems tab to begin. You can also go to Users if you wish to see the rankings.
We have listed below some advice as well as contest strategies:
- Start from the beginning. Ties will be broken by the sum of times used to solve the problems starting from the beginning of the contest. The last submission time of your highest score will be used.
- It is not guaranteed that the problems will be in order of increasing difficulty. Reading all of the statements is recommended.
- Remove all extra debugging code and/or input prompts from your code before submitting. The judge is very strict — most of the time, it requires your output to match exactly.
- Do not pause program execution at the end. The judging process is automated. You should use
stdoutto perform input / output, respectively.
- It is guaranteed that all the problems will be solvable with C++.
|Mock CCO '17 Day 1 P1 - Fast Fuhrer Transform||10p||20.0%||43|
|Mock CCO '17 Day 1 P2 - Penetrating Power||20p||19.9%||68|
|Mock CCO '17 Day 1 P3 - Connection||30p||8.5%||16|