[Problem 1 | Problem
2 | Problem 3 | Problem
4 | Problem 5 ]
[Problem 6 | Problem
7 | Problem 8 | Problem
9 ]
| Problem 1 |
|
| Submissions |
136 |
| Solutions |
91 |
| Fastest Solution |
5 minutes |
| % Submissions Correct |
66.9% |
| % Teams Solving Problem |
90.1% |
| Description |
This was a simple problem involving working out the
cost of purchasing binary digits in Acmonia, when the
government decided to have all houses numbered in binary
notation.
Problem text (pdf format)
|
| Problem 2 |
|
| Submissions |
113 |
| Solutions |
79 |
| Fastest Solution |
11 minutes |
| % Submissions Correct |
69.9% The highest percentage of correct
submissions |
| % Teams Solving Problem |
78.2% |
| Description |
This was also a simple problem, although
most teams tried problem 3 before this one. It involved
calculating the number of pages in a book given the
number of digits required to number the pages.
Problem text (pdf
format)
|
| Problem 3 |
|
| Submissions |
171 |
| Solutions |
93 This problem was solved by more teams
than any other. |
| Fastest Solution |
7 minutes |
| % Submissions Correct |
54.4% |
| % Teams Solving Problem |
92.1% |
| Description |
Our third simple problem required an analysis of the
vowels in a piece of text. A common error was forgetting
to process the blank lines in the input.
Problem text (pdf
format)
|
|
Problem 4
|
|
| Submissions |
83 |
| Solutions |
19 |
| Fastest Solution |
27 minutes |
| % Submissions Correct |
22.9% |
| % Teams Solving Problem |
18.8% |
| Description |
Problem 4 was the first of
our medium difficulty problems. Contestants were given
rules for inviting workers to an office party, and had
to maximize the "sociability" scores of the
guests.
Problem text (pdf
format)
|
| Problem 5 |
|
| Submissions |
105 |
| Solutions |
22 |
| Fastest Solution |
115 minutes |
| % Submissions Correct |
21.0% |
| % Teams Solving Problem |
21.8% |
| Description |
This problem involved calculating the best strategy
for Billy to collect lollies from his great aunt Clara
Mitchum (known as great ACM!).
Problem text (pdf
format)
|
| Problem 6 |
|
| Submissions |
84 |
| Solutions |
32 |
| Fastest Solution |
68 minutes |
| % Submissions Correct |
38.1% |
| % Teams Solving Problem |
31.7% |
| Description |
Problem 6 required contestants to find the shortest
route out of a maze.
Problem text (pdf
format)
|
| Problem 7 |
|
| Submissions |
26 |
| Solutions |
1 |
| Fastest Solution |
244 minutes |
| % Submissions Correct |
3.8% |
| % Teams Solving Problem |
1.0% |
| Description |
This was the first of our more difficult problems,
one that proved more difficult to solve than any of
the others. It required contestants to minimize the
cost of spreading gossip by telephone.
Problem text (pdf
format)
|
| Problem 8 |
|
| Submissions |
29 |
| Solutions |
2 |
| Fastest Solution |
220 minutes |
| % Submissions Correct |
10.3% |
| % Teams Solving Problem |
2.0% |
| Description |
Problem 8 was a clock problem. Each test gave a clock
array and a number of block moves. The problem was to
find the simplest way to set all clocks to 12 o'clock.
Problem text (pdf
format)
|
| Problem
9 |
|
| Submissions |
7 |
| Solutions |
3 |
| Fastest Solution |
260 minutes |
| % Submissions Correct |
42.9% |
| % Teams Solving Problem |
3.0% |
| Description |
Our final problem involved determining whether or not
a series of cuts made across a rectangular block of
wood would cut the wood into two pieces that could be
slid apart.
Problem text (pdf
format)
|
