Waterloo Programming Competition 2014
Go to file
2022-08-06 18:30:36 +00:00
README.md Update README.md 2022-08-06 18:30:36 +00:00
S1.java init 2019-08-05 20:22:36 -04:00
S1.txt Updated readme 2022-05-03 17:01:44 +00:00
S2.java init 2019-08-05 20:22:36 -04:00
S2.txt init 2019-08-05 20:22:36 -04:00
S3.java init 2019-08-05 20:22:36 -04:00
S3.txt init 2019-08-05 20:22:36 -04:00
S4.java init 2019-08-05 20:22:36 -04:00
S4.txt init 2019-08-05 20:22:36 -04:00
Tint.java init 2019-08-05 20:22:36 -04:00
Waterloo-2014.pdf Updated readme 2022-05-03 17:01:44 +00:00

Waterloo 2014

In 2014, while I was in grade 12, I competed in Waterloo's senior programing cometition.

These promgrams correspond to the problems found inside Waterloo-2014.pdf.

Table of Contents

[[TOC]]

Rules:

  • 3 hours to complete as many problems as possible; only completed programs count
  • Only writen resorces are allowed to be brought in and used (No internet/search engine)
  • Every file must use file input and standard output (Names correspond (S1.java < S1.txt))
  • Some programs are rated on efficency

Results

  • 1st place in local area, doubling 2nd place's score
  • S1 completed every test & recieved full marks (40 points)
  • S2 completed every test & recieved full marks (40 points)
  • S3 only halfed worked (15 points), I rushed to move onto S4
  • S4 didn't have time to complete

In hindsight, knowing I only needed to pass 3 problems to advance to nationals, I should have focused on the 3 easiest problems & ensured they all worked instead of rushing through all of the problems & ending up with two half-complete.