This contest comprises of 6 questions, most of which previously run by the University of Adelaide a few weeks ago, and have been modified and are now available for our use! Thanks to miguel and maxward for writing the problems. Once the contest is over, an editorial will be published explaining intended solutions for each question.
Some questions may have sub-tasks worth partial points. The contest will run for one week. However, you will have only 3 hours to complete the questions starting at any time you like during the contest span. After your 3 hours is up, you will become a spectator.
All input and output will be done via the standard input and output streams respectively.
- Do not discuss the questions at all with anyone who has not yet finished (or begun) their competition window.
- Do not create a second account to view the questions before competing.
- You may copy and paste code from your code library.
- The scoreboard is provisional until the winner is announced, and ratings are updated. The contest writers reserve the right to add test data to break any incorrect or time limit exceeded solutions.
- Read the bounds, read the time limit, and DO COMPLEXITY ANALYSIS. Do not waste time on a solution that will definitely get time limit exceeded.
- Read every question.
- Try not to get stuck solving a question if there are others you can work on.
- If you cannot solve a question, try solving a sub-task. Sometimes these are designed to help you along the path to a complete solution.
- Partial points for sub-tasks are extremely valuable, and often are the difference between the bottom of the scoreboard, and at the top.
- If you get wrong answer, try debugging using your own test cases.
We guaranteed that all problems are solvable in C/C++. Due to the relative efficiency of some languages, we do not guarantee any other languages are viable. Problems are almost always solvable in Java. Problems are occasionally solvable in Python.
This contest is rated.
|Bot or Doge?||1||54.5%||52|
|3 Point Shot||1||23.0%||14|
|Paths in a tree||1||51.0%||12|