My 1994 UCF High School Contest Solutions

Note: I primarily worked on this project of solving all of the UCF HSPT problems back in the 2014-2016 era. I had some extra time in July 2026 and decided to pick it back up. I thought I hadn't started the 1994 set, so I started from scratch and solved all of the problems, fixing some minor issues with data and producing output files. When I went to post the files, I discovered that I had previously solved 7 of the 9 problems and had significant code for the last two. It looks like I stopped working on it to come back to it another time, and that I didn't look at it for almost 12 years. Both of those last 2 solutions weren't working, but one of them(bank) helped me find the error I had in my new implementation (both implementations had errors and both were useful in fixing both of them). Then I also went back and fixed my old implementation of nothin. Also, the posted files on UCF's site do not include matching output for some problems.

For this reason, I am posting the following for 1994's problems: I have slightly modified a few of the input files which had strange characters. I have posted original output files that were available. I used both my solution and the posted solution to generate output files. For Bank, the posted C solution doesn't work any more, so I have just posted my output. For bank I made more clear decisions about output format and have posted a separate file explaining my choices. For a couple of other solutions, the specification clearly says to put a blank line or 2 blank lines between cases, insinuating that there are two extra blank lines at the end, but the judge solutions prints out blank lines at the end anyway. For all of my solutions but nothin' but net, I fixed this inssue in my solution and when necessary posted the output file that my solution created. This was an interesting exercise and case study. I am interested in looking at my different design decisions that I've made 12 years apart. One last thing I need to do is write a checker for nothin. For now, I've posted the valid output both of my programs produce. (I print out shortest paths only but their judge output does not since they used a DFS.)

Feel free to take a look!
Problems
Bank Output Format
Problem 2014 Solution 2026 Solution Input Output
Back Seat Driver driver.java driver.java driver.in driver.out
Where's the Bee? beehive.java beehive.java beehive.in beehive.out
Vocal Punctuation vocal.java vocal.java vocal.in vocal.out
Dimwit Numbers dimwit.java dimwit.java dimwit.in dimwit.out
Snail snail.java snail.java snail.in snail.out
In Line at the Bank bank.java bank.java bank.in bank.out
Base Alphabets base.java base.java base.in base.out
Nothin' But Net nothin.java nothin.java nothin.in nothin.out
nothin_alt.out
Visual Acuity acuity.java acuity.java acuity.in acuity.out