Welcome to the on-site Don Mills Programming Gala programming competition, bronze division!
This round will not be rated.
The contest consists of 6 questions with a wide range of difficulties, and you can get partial marks for partial solutions 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 the contest. The contest begins at 10:00 EDT on May 28th, but teams should arrive around 9:30.
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 strongly advised to run your code on your own computer with the sample input we provide before submitting. It's faster to find and fix mistakes at this stage rather than submitting and waiting only to find out that your solution doesn't compile.
- 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.
- Just because your program works with the sample input doesn’t guarantee that it will earn full points. Read the problem statement very carefully to look for things you may have missed on the first read-through. It is not forbidden — in fact, even encouraged to make your own test cases to debug your program on.
- The test data is guaranteed to fit within the constraints given. You do not have to perform any extra checks to make sure of this fact.
- Do not just print out a hardcoded answer. There will be preliminary tests (pretests) to prevent such behavior. These pretests will generally be small enough to solve with almost any algorithm and will not contain any tricky corner cases. They are there to test for a basic understanding of a problem. The sample input will always be included as the first few pretests.
- It is guaranteed that all the problems will be solvable with C++.
After the contest finishes, we'll have a optional feedback form we would like you to fill out.
|DMPG '15 B1 - Loner Phoner||3p||30.5%||234|
|DMPG '15 B2 - Trunk in Trunk||5p||26.6%||154|
|DMPG '15 B3 - Picking Berries||3p||43.3%||137|
|DMPG '15 B4 - Maximum Product||7p||18.3%||173|
|DMPG '15 B5 - Lux-urious S'mores||7p||32.4%||70|
|DMPG '15 B6 - Bad S'mores||10p||5.0%||17|