The Competition Round of the 1994 USA Computing Olympiad was held from March 11 to March 14, 1994. Presented here is the information and the problems sent out to the 46 local contest coordinators and administered to the 80 high school participants who had pased the qualifying round.

Welcome to the Competition Round of the second annual USA Computing Olympiad. First, I would like to thank you for taking the time to serve as a local coordinator. This is an important step in the selection process to choose the top 16 students who will be invited to the University of Wisconsin-Parkside to participate in the Final Round of the USACO, June 26-July 2, 1994. Four students from the Final Round will be selected to represent the United States in the fifth annual International Olympiad in Informatics in Sweden, July 3-10, 1994

Enclosed please find:

  1. IOI/USACO Disk: This disk contains information and problems from all previous IOI competitions and all USACO competitions including the problems and a set of solutions to the 1994 qualifying round. Please distribute these disks to the contestants.
  2. Local Coordinator Information Sheet: This document contains an explanation of all the steps that must be taken to conduct a local Competition Round. This round must be conducted on March 11, 12, or 14. Please read this document carefully.
  3. White Envelopes: Each contestant is provided with his or her own white envelope which contains the problem(s) to be solved within a strict five hour time limit. All of the information necessary to solve the problem(s) is enclosed in that envelope. Keep this envelope secure until the day of the Competition Round. No one may open their envelope except the contestants and then only when the contest begins. Please follow this rule to the letter.
  4. TEST DATA. Once the time limit is up, you should have each student run the TEST DATA that appears on the back of the Information Sheet. Please enter this information into an ASCII text file for the students to use. You may ask the student to do this for you after the competition is over if you wish. Please keep this TEST DATA confidential until that time.

Please fill out and return the Local Coordinator Information sheet along with all the contestants' work. Also check that all contestants fill out and include their Information Sheets with their solutions disk.

Local Coordinator Information Sheet

  1. You may conduct the contest on March 11, 12 or 14. However, we recommend March 12 since it will be less stressful for most students.
  2. Schedule five hours for the contestants to write their program(s). If you have more than one contestant, all should write their programs during the same 5-hour period. It is important to keep the problems confidential.
  3. Provide each contestant with a blank, formatted 3.5" disk (IBM or MAC) on which to store and submit their program(s). Please have them write: Competition Round 1994, Name, Address, City, State, Zip, Ph #, and disk type ( IBM or MAC) on the disk. No disks, other than the blank, formatted disk, are allowed in the area during the competition. No outside materials, printed or electronic may be used during the contest. If a student has questions about a programming or system command, you may provide this information personally or provide a reference book to answer these questions. Of course students may use paper and pencil to work out their ideas.
  4. The sealed envelope provided for each contestant contains the problems to be solved. Keep them confidential until the day of the competition. Distribute the envelopes at the moment the contest begins.
  5. After five hours, ask each contestant to stop programming and to turn in their disk to you. Working with one contestant at a time, have each student run the program using the inputs from: a) SAMPLE RUNS that was given to them. Also, have each contestant run the b) TEST DATA found at the end of the problems. You can enter this test data in the proper disk format ahead of time or wait for assistance by the contestant. Please try to work with the student so problems of reading the input data are eliminated. ( You may use adult helpers if you have many students to process.)
  6. Have each contestant provide a printed copy of the program(s) and the results of all the runs a, b.
  7. Have each contestant provide a (one page max) printed explanation of the solution(s) in English/outline form. This may be written after the 5 hour time limit. Each problem should have an English algorithm associated with it.
  8. Submit on a disk the contestant's program(s) (FENCE.***, ARITH.*** where *** = PAS, C or BAS) in an ASCII text file along with a copy of the English/outline algorithm (FENCE.ALG, ARITH.ALG) that was written after the five-hour limit. Be sure to print the name, address, city, state, zip and disk type (IBM or MAC) on the label of each disk.
  9. Place each contestant's work in an envelope with his or her name, address, city, state, zip printed on the outside. Also include the Contestant Information Sheet. Mail all the envelopes together. Include the Local Coordinator Information Sheet. We must receive your entries no later than Monday, March 21, 1994. The top 12-16 contestants will be announced on Monday, April 4, 1994.

What languages may be used?

The official languages that will be used at IOI '94 in Sweden are: Turbo Pascal, Borland Turbo C/C++, MicroSoft Quick BASIC, and Logo. These will also be the languages used at the USACO training camp at the University of Wisconsin-Parkside. For the Competition Round, students should try to use one of these languages. We recommend Turbo Pascal or Turbo C. We will accept solutions in other versions of Pascal, BASIC, QBASIC and C, but if we can't run the program because we lack the proper language, your ranking may suffer.

1994 USACO Competition Round Problems

Below are two problems that comprise the 1994 Competition Round of the USACO. Your job is to do as well as you can with one of the problems or both if you have the time. A good efficient solution to one of the problems should be your first goal. We have provided two problems so if you have no idea on how to attack one of them, you will still have a second chance. If you finish one and want to attempt another so much the better. However, it is better to have a complete solution to one problem than partial solutions to two problems. Of course, two perfect solutions is clearly the best but we do not expect that you will have the time to this. Also, Problem 1 is considered much harder than Problem 2 which will figure into our selection process. Good Luck!