Problem Set 2005

[Problem 1 | Problem 2 | Problem 3 | Problem 4 | Problem 5 ]

[Problem 6 | Problem 7 | Problem 8 | Problem 9 | General Analysis]

2005 Results | 2005 Report

NOTE If the Chief Judge and Contest Director release the judge's test data, it will be available from this page. Please do not email asking for the data to be sent.

Problem 1	Dice
Submissions	94
Solutions	86
Fastest Solution	4 minutes
% Submissions Correct	91.5
% Teams Solving Problem	99
Description	Our first simple problem required contestants to check a series of die scores to see whether there were more odd or even throws.

 

Problem 2	Abbreviations
Submissions	147
Solutions	66
Fastest Solution	11 minutes
% Submissions Correct	44.2
% Teams Solving Problem	76
Description	In this problem teams had to find the shortest abbreviation for a word that would uniquely identify it in a list. For a simple problem, this attracted a lot of incorrect submissions.

Problem 3	Contest
Submissions	108
Solutions	65
Fastest Solution	17 minutes
% Submissions Correct	60.2
% Teams Solving Problem	75
Description	In a series of contests whose rules differ from those of the ACM Contest, contestants had to rank the teams.

Problem 4	Orchards
Submissions	28
Solutions	2
Fastest Solution	105 minutes
% Submissions Correct	7.1
% Teams Solving Problem	2.3
Description	In this problem, teams had to fence in the trees in an orchard.

Problem 5	Paths
Submissions	99
Solutions	21
Fastest Solution	58 minutes
% Submissions Correct	21.2
% Teams Solving Problem	24
Description	Here teams had to help buyers of land maximize their profits.

Problem 6	Rankings
Submissions	60
Solutions	7
Fastest Solution	149 minutes
% Submissions Correct	11.7
% Teams Solving Problem	8
Description	As with problem 3, contestants had to rank teams in a tournament. For this problem the tournament rules were a lot more complicated!

Problem 7	Soduku
Submissions	43
Solutions	6
Fastest Solution	139 minutes
% Submissions Correct	4.3
% Teams Solving Problem	7
Description	This problem was based on the popular number game.

Problem 8	Robots
Submissions	5
Solutions	0
Fastest Solution
% Submissions Correct	0
% Teams Solving Problem	0
Description	This problem required a robot to navigate an obstacle course. Only 1 team attempted it.

Problem 9	Polycubes
Submissions	1
Solutions	0
Fastest Solution
% Submissions Correct	0
% Teams Solving Problem	0
Description	This problem was based on a Grant's cube.Only 1 team attempted it.

General Analysis

87 teams solved a total of 253 problems. This is an average of 2.9 problems per team!

Problems Solved	Number of Teams	Percentage of Teams
6	1	1
5	6	7
4	19	22
3	34	39
2	13	15
1	13	15
0	1	1

Site Created By: Nick Meek
Site Maintained By:Phil Robbins
Last Updated:September 2004