<p></p> <h2>Problem A: Bridge</h2> <p><i>n</i> people wish to cross a bridge at night. A group of at most two people may cross at any time, and each group must have a flashlight. Only one flashlight is available among …

<p></p> <h3>Problem D - Snap</h3> <p><em>Snap</em> is a 2-player card game. The deck of cards contains several of each type of card. Initially each player has one half of the deck, in some random sequence, face down in…

<p></p> <h2>Problem B - Airline Hub</h2> <p>World Wide Flyer has landing rights at several airports throughout the world. They wish to place their central hub at the airport that minimizes the maximum direct flying distance from t…

<p></p> <h2>Problem C - Snakes</h2> <p>Buffalo Bill wishes to cross a 1000x1000 square field. A number of snakes are on the field at various positions, and each snake can strike a particular distance in any direction. Can Bill mak…

<p>Minesweeper Have you ever played Minesweeper? This cute little game comes with a certain operating system whose name we can't remember. The goal of the game is to find where all the mines are located within a M x N field. The game shows a number in a …

<p></p> <p> <title></title> </p> <h2>Problem A - Y2K Accounting Bug</h2> <p>Accounting for Computer Machinists (ACM) has sufferred from the Y2K bug and lost some vital data for preparing annual report for M…