Part A - Senior High
Instructions
- Read them carefully!
Team Members: and Team Code:
Time Allotted: 90 Minutes
You are to answer any three of the four questions given. If you attempt all four, the
three highest scores will be recorded.
The first fifteen minutes is planning time. Some problems are designed to have a simple
but easily overlooked solution. Computers must be switched off during this time.
Each program must display the team name, number and the title of the problem.
If you vary from the specifications in any way, the changes and additional instructions
must be printed very clearly at the start of the program. If you make a change and we
can’t get some part of the program working, you will lose marks. Minor deviations
will be tolerated without penalty (e.g. using spaces to separate input instead of commas)
but the basic question must not be changed. It is always best to stick with what is asked.
You must provide judges with clear, foolproof instructions for running each solution.
Use the back of this sheet. Include instructions for turning the computer on, loading the
solution, running it and shutting the computer down.
You must also provide instructions on how to view the source listing of each solution
should it be necessary.
Input checking is required. If a problem specifies that only certain values will be
given, you must check that the values are within those acceptable limits. Usually this can
be handled without (or at most minor) modification of the input routines you brought to
the contest.
You must always provide the option to run the program again with different values. This
is a convenience to the judges who will be running multiple tests through your program.
A small number of marks are allocated for extra effort or creativity shown in your
solution. If you think something is worthy of these marks, be sure you write it with the
instructions or print it at the start of the program. Remember to get your program working
before going after these.
Each problem is worth 100 points. Three perfect solutions yield 300 points.
In general, problems can be completed with 20-40 lines of code, not including the input
routines and simple error checks, which you should have pre-programmed.
Hand in two disks containing the compiled programs and source
with this sheet. Mark the programs you wish the judges to run.
Topological Sort ___ q Yes q Nearly q No
Binary Multiplication ___ q Yes q Nearly q No
Transformers ___ q Yes q Nearly q No
City Repair ___ q Yes q Nearly q No
Use reverse for instructions to judges. Keep it clear, brief and neat.
Good Luck!
Problems by: Darin Rousseau, Mark Lane & Alex Gierus
Last Modified:- 1999, February 11, 03:38 PM by M. Smith