Here are the rules and problems for the 1982 High School Programming competition out of central California. Keep in mind the computers available at the school were primarily, TRS-80, Apple ][ and Commodore PET using (I’m not sure if there were any with Ataris there), at this time BASIC usually did not have any sorting functions nor were adept at data storage.
I attended two of these, our team (on a Commodore PET) Placed 5th the first year (won a vinyl disk sleeve - cheapskates) and 3rd the second (IIRC a used computer book, which was much better). I also recall the top prize the second year was a year’s use of a SuperPET.
1982 HIGH SCHOOL PROGRAMMING CONTEST
Sponsored by the
Computer Science Department
California State College Stanislaus
* * * * * * * * * * * * * THE RULES * * * * * * * * * * * * *
1. Programs shall be written in the BASIC language.
2. Each team shall provide their own computer(one).
3. The time limit is two hours.
4. Each problem is separate and the documentation for each program
shall be submitted separately.
5. The documentation for each problem shall consist of:
a) A copy of the program’s output from the printer.
b) A printed listing of the program. It shall start as follows:
1 REM Title of the problem
2 REM The Team Number
c) A list of the variables used in the program and what each represents.
ie. D = The number of dogs. Normally done by hand, not printed.
d) A simple flowchart outlining the logic of the program. The forms
of the ‘boxes’ used are not important, the words 1ns1de them are.
These items should be assembled in the above order, stapled and submitted.
6. No references other than the programming manual for your computer.
********* THE PROBLEMS ***************
1. Sorting by Grade and Name
The name, grade, and sex for twenty students will be entered from the
keyboard. The data will be sorted by grade and by name within that grade.
The list will be printed out in four blocks: seniors, juniors, etc.
A string of characters will be entered. It will be tested to see if it
is palindromic(same forwards and backwards). A message will be output
indicating if the string is or is not palindromic.
The user will be asked if another string is be entered.
3. Perfect Number
A perfect number is a number that is equal to the sum of its integral
divisors, not including the number itself. An example is 6 since 6:1+2+3.
Write a program that accepts a number, outputs a list of its divisors,
and indicates if that number is perfect or is not perfect.
The program will continue until a non-positive number is input.