<p></p> <h2>Problem E: Interpreter</h2> <p>A certain computer has 10 registers and 1000 words of RAM. Each register or RAM location holds a 3-digit integer between 0 and 999. Instructions are encoded as 3-digit integers and stored…

<p></p> <h2>Problem A: Gopher II</h2> <p><img alt="" src="/admin/../upload/pimg1110_1.jpg" /></p> <p>The gopher family, having averted the canine threat, must face a new predator.</p> <p>The are <i…

<p></p> <h2>Problem C: Jolly Jumpers</h2> <p>A sequence of <i>n &gt; 0</i> integers is called a <i>jolly jumper</i> if the absolute values of the difference between successive elements take on all the v…

<p></p> <h2>Problem D: Tug of War</h2> <p>A tug of war is to be arranged at the local office picnic. For the tug of war, the picnickers must be divided into two teams. Each person must be on one team or the other; the number of pe…

<p></p> <h3>Problem B: Saskatchewan</h3> <p>The province of Saskatchewan is surveyed in <i>sections</i>. A section is a square mile of land. Grid roads delimit sections; there is one north-south and one east-west road …

<p></p> <h2>Problem E - Steps</h2> <p>One steps through integer points of the straight line. The length of a step must be nonnegative and can be by one bigger than, equal to, or by one smaller than the length of the previous step.…