Notes on the Problem Set | Last modified Oct 30 2005 |
We think the easiest problems are Copier Reduction and Overflowing Bookshelf, followed by Netiquette, Digit Expansion, Painter, and Time to Graduate. The hardest ones are Connect, Pascal's Travels, and Leapin' Lizards. We expect most teams to solve one or both of the easiest problems. Many teams will also solve one or more of the middle group. Some teams will conquer the hardest problems but hopefully at most one team solves them all.
This year's problem set was a conglomeration of efforts by:
Jerry Cain, Tom Capaul, John Cigas, Javier Fernandez-Ivern, Dan Haffey,
Andy Harrington, Wen Hsin, Tim Rolfe, Kris Rudin, Eric Shade, and others.
Want to join the fray? Please submit a problem! See http://csc.missouristate.edu/~mcpc/call_for_probs.html.