Fixes in html files of 1989

This commit is contained in:
Cody Boone Ferguson committed 2024-06-21 09:12:51 -07:00
1 parent e8d868e0ed
commit 871e1114f7
13 files changed
+74 -71

No files matched your search

+11 -12
View File
@@ -125,18 +125,17 @@ system-wide high-score allowing a competition between users.
The author provided us with the following notes and new version of
the program:
Here is a somewhat improved version of my tetris entry. All the
changes are in the `popen()` at the end. Formerly a move was done
to the HI score file which is not permitted for other users. Now
other users can change the `HI` score file. The extra option `-m` is
passed to sort, so that it knows that its input files are already
sorted. The `-o` output option of sort is used instead of a
temporary file.
You may also want to consider giving just the raw option to `stty`
at the start and `-raw` at the end. This further reduces the size of
the program, but has the possible disadvantage that the program
can only by stopped by 'q' or by the `kill -9' command.
> Here is a somewhat improved version of my tetris entry. All the changes are
in the `popen(3)` at the end. Formerly a move was done to the HI score file
which is not permitted for other users. Now other users can change the `HI`
score file. The extra option `-m` is passed to sort, so that it knows that its
input files are already sorted. The `-o` output option of sort is used instead
of a temporary file.
>
> You may also want to consider giving just the raw option to `stty` at the
start and `-raw` at the end. This further reduces the size of the program, but
has the possible disadvantage that the program can only by stopped by 'q' or by
the `kill -9` command.
``` <!---c-->
long h[4];t(){h[3]-=h[3]/3000;setitimer(0,h,0);}c,d,l,v[]={(int)t,0,2},w,s,I,K
+12 -11
View File
@@ -481,17 +481,18 @@ system-wide high-score allowing a competition between users.</p>
<h3 id="additional-remarks-from-the-judges">Additional remarks from the judges:</h3>
<p>The author provided us with the following notes and new version of
the program:</p>
<p>Here is a somewhat improved version of my tetris entry. All the
changes are in the <code>popen()</code> at the end. Formerly a move was done
to the HI score file which is not permitted for other users. Now
other users can change the <code>HI</code> score file. The extra option <code>-m</code> is
passed to sort, so that it knows that its input files are already
sorted. The <code>-o</code> output option of sort is used instead of a
temporary file.</p>
<p>You may also want to consider giving just the raw option to <code>stty</code>
at the start and <code>-raw</code> at the end. This further reduces the size of
the program, but has the possible disadvantage that the program
can only by stopped by ‘q’ or by the `kill -9’ command.</p>
<blockquote>
<p>Here is a somewhat improved version of my tetris entry. All the changes are
in the <code>popen(3)</code> at the end. Formerly a move was done to the HI score file
which is not permitted for other users. Now other users can change the <code>HI</code>
score file. The extra option <code>-m</code> is passed to sort, so that it knows that its
input files are already sorted. The <code>-o</code> output option of sort is used instead
of a temporary file.</p>
<p>You may also want to consider giving just the raw option to <code>stty</code> at the
start and <code>-raw</code> at the end. This further reduces the size of the program, but
has the possible disadvantage that the program can only by stopped by ‘q’ or by
the <code>kill -9</code> command.</p>
</blockquote>
<pre><code> long h[4];t(){h[3]-=h[3]/3000;setitimer(0,h,0);}c,d,l,v[]={(int)t,0,2},w,s,I,K
=0,i=276,j,k,q[276],Q[276],*n=q,*m,x=17,f[]={7,-13,-12,1,8,-11,-12,-1,9,-1,1,
12,3,-13,-12,-1,12,-1,11,1,15,-1,13,1,18,-1,1,2,0,-12,-1,11,1,-12,1,13,10,-12,