It's almost 2017! A new year means setting New Year's resolutions, bettering yourself, and of course — a contest!
The problem writers this time will be, , , , and .
The pretest/systest format will not be used. This means that submissions will be judged on the full set of data during the contest. However, partial output will be disabled.
This contest will be rated for all participants who submit at least once.
The contest will run from Jan 1, 9 AM EST to Jan 1, 9 PM EST. It will consist of 8 problems in approximated increasing order of difficulty. The problems will be allotted different point values based on their difficulties.It is also highly recommended that you join and start the contest as soon as possible since ties are broken by your submission times.
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. Your last submission time will be used.
- 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++.
At the end of the contest, you may comment below to appeal a judging verdict. In the case of appeals, the decision(s) of DMOJ staff is final.
Good luck and Happy New Year!
|Mr. N and Presents||7p||26.2%||194||Editorial|
|The Christmas Swap||15||21.0%||44||Editorial|
|Boxen in Boxen||25||6.7%||11||Editorial|