Fixes in html files of entries of 1992

This commit is contained in:
Cody Boone Ferguson committed 2024-06-22 12:11:29 -07:00
1 parent c5dde38b81
commit 97d26a59d3
20 files changed
+137 -137

No files matched your search

+8 -7
View File
@@ -27,9 +27,9 @@ high quality.
FYI: By tradition, we do not record the count of the number entries,
nor do we give our our guess as to the number of entries
received. For folks who wonder, we can say that we consumed
about 2000 pages of output (printing between 2 and 4 normal
pages per side) during the judging process this year.
received. For folks who wonder, we can say that **we consumed
about _2000 pages of output_ (printing between 2 and 4 normal
pages per side)** during the judging process this year.
The new instructions for submitting entries worked well - we were
able to write scripts to unpack them and eliminate duplicates.
@@ -49,7 +49,7 @@ a winning entry for the past 6 years!
## A few notes regarding future contests:
We did not give awards to some traditional contest categories such as
"Best Layout". We felt that to do so would deny awards to more
"_Best Layout_". We felt that to do so would deny awards to more
deserving entries. These categories have not been eliminated. We will
likely be awarding them in future years.
@@ -59,10 +59,11 @@ judging process a little harder, so we may request that this not
be done this in the future.
Some thought has been given to a separate obfuscated perl contest.
Watch comp.lang.perl for details!
Watch _comp.lang.perl_ for details!
Be sure to wait until the 1993 rules are posted before submitting entries.
We may fine tune the rules to reflect the some ideas above.
Be sure to wait until the [1993 rules](../1993/rules.txt) are posted before
submitting entries. We may fine tune the rules to reflect some of the ideas
above.
Please send us comments and suggestions what we have expressed above.
Also include anything else that you would like to see in future contests.
+1 -2
View File
@@ -10,7 +10,6 @@
The current status of this entry is:
```
STATUS: known bug - please help us fix
STATUS: INABIAF - please **DO NOT** fix
```
@@ -262,7 +261,7 @@ the program will print the error message:
```
(The exact text of the above error messages varies from machine to
machine.) The four programs which read from stdin require lines
machine.) The four programs which read from `stdin` require lines
shorter than 999 characters.
The other info files are `adrian.grep.[1-6]` which contain the six
+2 -3
View File
@@ -405,8 +405,7 @@ Location: <a href="../../location.html#US">US</a> - <em>United States of America
<pre><code> make all</code></pre>
<h3 id="bugs-and-misfeatures">Bugs and (Mis)features:</h3>
<p>The current status of this entry is:</p>
<pre><code> STATUS: known bug - please help us fix
STATUS: INABIAF - please **DO NOT** fix</code></pre>
<pre><code> STATUS: INABIAF - please **DO NOT** fix</code></pre>
<p>For more detailed information see <a href="../../bugs.html#1992_adrian">1992/adrian in bugs.html</a>.</p>
<h2 id="try">Try:</h2>
<pre><code> ./try.sh</code></pre>
@@ -539,7 +538,7 @@ many seconds.</p>
the program will print the error message:</p>
<pre><code> Segmentation fault (core dumped)</code></pre>
<p>(The exact text of the above error messages varies from machine to
machine.) The four programs which read from stdin require lines
machine.) The four programs which read from <code>stdin</code> require lines
shorter than 999 characters.</p>
<p>The other info files are <code>adrian.grep.[1-6]</code> which contain the six
examples that appear above, and from, which is used to emulate the
+15 -17
View File
@@ -39,22 +39,20 @@ An alternate version of this entry, [albert.alt.c](%%REPO_URL%%/1992/albert/albe
Leo Broukhis, before he was an IOCCC judge, sent the IOCCC
judges this Email message:
```
From: leo _at_ zycad -dot- com (Leo Broukhis)
Date: Tue, 30 Jan 96 17:37:51 PST
To: judges _at_ toad -dot- com
Subject: IOCCC 1992 - a bug
Dear Judges,
albert.c (even in its fixed form) still has a bug. Although I don't
remember the number that exposed the bug (afair, resulting in coredump)
in albert.orig.c that has been fixed in albert.c,
I've found a number exposing another bug: 10000000001 (that's 9 0's).
Both albert and albert.orig loop without printing anything, although
the first factor is 101 and is usually found in an instant.
```
> From: leo _at_ zycad -dot- com (Leo Broukhis)<br>
> Date: Tue, 30 Jan 96 17:37:51 PST<br>
> To: judges _at_ toad -dot- com<br>
> Subject: IOCCC 1992 - a bug<br>
>
> Dear Judges,
>
> `albert.c` (even in its fixed form) still has a bug. Although I don't
> remember the number that exposed the bug (afair, resulting in coredump)
> in `albert.orig.c` that has been fixed in `albert.c`,
>
> I've found a number exposing another bug: 10000000001 (that's 9 0's).
> Both albert and albert.orig loop without printing anything, although
> the first factor is 101 and is usually found in an instant.
The [albert.alt.c](%%REPO_URL%%/1992/albert/albert.alt.c) file is the fixed file, whereas the
[albert.c](%%REPO_URL%%/1992/albert/albert.c) is the file before applying Leo Broukhis' fix.
@@ -155,7 +153,7 @@ for some years.
recursion and is quite jumpy. This program shares these disadvantages in a
modified form.
4. The Conversion is to be found in Knuth, not so the Observation. The
Observation: "if it ends in a zero, it is divisible by ten".
Observation: "_if it ends in a zero, it is divisible by ten_".
<!--
+14 -15
View File
@@ -416,20 +416,19 @@ Location: <a href="../../location.html#NL">NL</a> - <em>Kingdom of the Netherlan
<p>An alternate version of this entry, <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/albert.alt.c">albert.alt.c</a>, is provided.
Leo Broukhis, before he was an IOCCC judge, sent the IOCCC
judges this Email message:</p>
<pre><code> From: leo _at_ zycad -dot- com (Leo Broukhis)
Date: Tue, 30 Jan 96 17:37:51 PST
To: judges _at_ toad -dot- com
Subject: IOCCC 1992 - a bug
Dear Judges,
albert.c (even in its fixed form) still has a bug. Although I don&#39;t
remember the number that exposed the bug (afair, resulting in coredump)
in albert.orig.c that has been fixed in albert.c,
I&#39;ve found a number exposing another bug: 10000000001 (that&#39;s 9 0&#39;s).
Both albert and albert.orig loop without printing anything, although
the first factor is 101 and is usually found in an instant.</code></pre>
<blockquote>
<p>From: leo <em>at</em> zycad -dot- com (Leo Broukhis)<br>
Date: Tue, 30 Jan 96 17:37:51 PST<br>
To: judges <em>at</em> toad -dot- com<br>
Subject: IOCCC 1992 - a bug<br></p>
<p>Dear Judges,</p>
<p><code>albert.c</code> (even in its fixed form) still has a bug. Although I don’t
remember the number that exposed the bug (afair, resulting in coredump)
in <code>albert.orig.c</code> that has been fixed in <code>albert.c</code>,</p>
<p>I’ve found a number exposing another bug: 10000000001 (that’s 9 0’s).
Both albert and albert.orig loop without printing anything, although
the first factor is 101 and is usually found in an instant.</p>
</blockquote>
<p>The <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/albert.alt.c">albert.alt.c</a> file is the fixed file, whereas the
<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/albert.c">albert.c</a> is the file before applying Leo Broukhis’ fix.</p>
<h3 id="alternate-build">Alternate build:</h3>
@@ -489,7 +488,7 @@ for some years.</li>
recursion and is quite jumpy. This program shares these disadvantages in a
modified form.</li>
<li>The Conversion is to be found in Knuth, not so the Observation. The
Observation: “if it ends in a zero, it is divisible by ten”.</li>
Observation: “<em>if it ends in a zero, it is divisible by ten</em>”.</li>
</ol>
<!--
+1 -1
View File
@@ -228,7 +228,7 @@ to be executed, set the temporary to `1`.
Thanks to Bill Pugh for bringing the loop-ability of the AE to
my attention.
`buzzard.1` was originally named 'cb', for obvious reasons, and is
`buzzard.1` was originally named `cb`, for obvious reasons, and is
dedicated to the memory of Charles Barrett.
+1 -1
View File
@@ -542,7 +542,7 @@ is to stick <code>x</code> in a temporary, and if the current code is not about
to be executed, set the temporary to <code>1</code>.</p>
<p>Thanks to Bill Pugh for bringing the loop-ability of the AE to
my attention.</p>
<p><code>buzzard.1</code> was originally named ‘cb’, for obvious reasons, and is
<p><code>buzzard.1</code> was originally named <code>cb</code>, for obvious reasons, and is
dedicated to the memory of Charles Barrett.</p>
<!--
+6 -6
View File
@@ -10,14 +10,14 @@ code](#alternate-code) below for details.
## To use:
First, you must make sure that `first` is made first (even though `make all`
should make first first :-) ):
**First**, you must make sure that `first` is made **first** (even though `make all`
should make **first _first_** :-) ):
``` <!---sh-->
make first
```
Second:
**Second**:
``` <!---sh-->
# get help:
@@ -27,13 +27,13 @@ Second:
cat third demo5.th | ./first
```
Third:
**Third**:
``` <!---sh-->
cat third help.th - | ./first
```
NOTE: Wait until 'Ok' is printed and the type:
**NOTE**: Wait until `Ok` is printed and the type:
```
2 3 + . cr
@@ -41,7 +41,7 @@ NOTE: Wait until 'Ok' is printed and the type:
Yes you should really type the 2 letters: `cr`.
Fourth:
**Fourth**:
```
Sorry, this is third!
+6 -6
View File
@@ -406,21 +406,21 @@ Location: <a href="../../location.html#US">US</a> - <em>United States of America
<p>There is an alternate version of this program. See <a href="#alternate-code">Alternate
code</a> below for details.</p>
<h2 id="to-use">To use:</h2>
<p>First, you must make sure that <code>first</code> is made first (even though <code>make all</code>
should make first first :-) ):</p>
<p><strong>First</strong>, you must make sure that <code>first</code> is made <strong>first</strong> (even though <code>make all</code>
should make <strong>first <em>first</em></strong> :-) ):</p>
<pre><code> make first</code></pre>
<p>Second:</p>
<p><strong>Second</strong>:</p>
<pre><code> # get help:
echo help | cat third help.th - | ./first
# try out a demo:
cat third demo5.th | ./first</code></pre>
<p>Third:</p>
<p><strong>Third</strong>:</p>
<pre><code> cat third help.th - | ./first</code></pre>
<p>NOTE: Wait until ‘Ok’ is printed and the type:</p>
<p><strong>NOTE</strong>: Wait until <code>Ok</code> is printed and the type:</p>
<pre><code> 2 3 + . cr</code></pre>
<p>Yes you should really type the 2 letters: <code>cr</code>.</p>
<p>Fourth:</p>
<p><strong>Fourth</strong>:</p>
<pre><code> Sorry, this is third!</code></pre>
<h2 id="try">Try:</h2>
<pre><code> ./try.sh</code></pre>
+2 -2
View File
@@ -4,8 +4,8 @@
make all
```
NOTE: we DISABLE the optimiser because having it enabled causes some invocations
to crash in some systems.
**NOTE**: we **FORCE DISABLE** the optimiser because having it enabled causes
some invocations to crash in some systems.
### Bugs and (Mis)features:
+2 -2
View File
@@ -403,8 +403,8 @@ Location: <a href="../../location.html#FI">FI</a> - <em>Republic of Finland </em
<!-- BEFORE: 1st line of markdown file: 1992/gson/README.md -->
<h2 id="to-build">To build:</h2>
<pre><code> make all</code></pre>
<p>NOTE: we DISABLE the optimiser because having it enabled causes some invocations
to crash in some systems.</p>
<p><strong>NOTE</strong>: we <strong>FORCE DISABLE</strong> the optimiser because having it enabled causes
some invocations to crash in some systems.</p>
<h3 id="bugs-and-misfeatures">Bugs and (Mis)features:</h3>
<p>The current status of this entry is:</p>
<pre><code> STATUS: uses gets() - change to fgets() if possible</code></pre>
+9 -9
View File
@@ -27,7 +27,7 @@ To see a number of options and configurations:
## Judges' remarks:
The program is more interesting to run on workstations that can make use of a
Sun raster file. Others can make use of the -text flag for character oriented
Sun raster file. Others can make use of the `-text` flag for character oriented
output.
Of course, the source (layout) is self-documenting! :-)
@@ -97,10 +97,10 @@ may be preceded with a minus sign (or any character in `[!-/]`) and may be
followed by other letters, so for example:
- m
- \-m
- mask
- \*mail
- `m`
- `-m`
- `mask`
- `*mail`
all mean the same thing. Most options may be followed by one or two
@@ -108,10 +108,10 @@ numbers. These numbers may be separated from each other and from the
option by a space, or may be joined to each other with a comma, or may
be appended to the single-letter option, so
- \-s100,200
- size 100,200
- \-size123 100 200
- s100 200
- `-s100,200`
- `size 100,200`
- `-size123 100 200`
- `s100 200`
all mean the same (note that in `-size123` all characters following the
initial `s` are ignored). Numbers need not be specified, as each has a
+9 -9
View File
@@ -413,7 +413,7 @@ Location: <a href="../../location.html#GB">GB</a> - <em>United Kingdom of Great
<pre><code> ./try.sh</code></pre>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>The program is more interesting to run on workstations that can make use of a
Sun raster file. Others can make use of the -text flag for character oriented
Sun raster file. Others can make use of the <code>-text</code> flag for character oriented
output.</p>
<p>Of course, the source (layout) is self-documenting! :-)</p>
<p>NOTE: The original winning source assumed that <code>exit(3)</code> returned a value which
@@ -468,20 +468,20 @@ with small characters having a square aspect ratio.</p>
may be preceded with a minus sign (or any character in <code>[!-/]</code>) and may be
followed by other letters, so for example:</p>
<ul>
<li>m</li>
<li>-m</li>
<li>mask</li>
<li>*mail</li>
<li><code>m</code></li>
<li><code>-m</code></li>
<li><code>mask</code></li>
<li><code>*mail</code></li>
</ul>
<p>all mean the same thing. Most options may be followed by one or two
numbers. These numbers may be separated from each other and from the
option by a space, or may be joined to each other with a comma, or may
be appended to the single-letter option, so</p>
<ul>
<li>-s100,200</li>
<li>size 100,200</li>
<li>-size123 100 200</li>
<li>s100 200</li>
<li><code>-s100,200</code></li>
<li><code>size 100,200</code></li>
<li><code>-size123 100 200</code></li>
<li><code>s100 200</code></li>
</ul>
<p>all mean the same (note that in <code>-size123</code> all characters following the
initial <code>s</code> are ignored). Numbers need not be specified, as each has a
+8 -7
View File
@@ -410,9 +410,9 @@ years. The new size rules size probably contributed to the overall
high quality.</p>
<p>FYI: By tradition, we do not record the count of the number entries,
nor do we give our our guess as to the number of entries
received. For folks who wonder, we can say that we consumed
about 2000 pages of output (printing between 2 and 4 normal
pages per side) during the judging process this year.</p>
received. For folks who wonder, we can say that <strong>we consumed
about <em>2000 pages of output</em> (printing between 2 and 4 normal
pages per side)</strong> during the judging process this year.</p>
<p>The new instructions for submitting entries worked well - we were
able to write scripts to unpack them and eliminate duplicates.</p>
<p>As promised last year, we accepted programs that made use of the X
@@ -426,7 +426,7 @@ as you are to see who has won. Even so, it is worth noting that
a winning entry for the past 6 years!</p>
<h2 id="a-few-notes-regarding-future-contests">A few notes regarding future contests:</h2>
<p>We did not give awards to some traditional contest categories such as
“Best Layout”. We felt that to do so would deny awards to more
“<em>Best Layout</em>”. We felt that to do so would deny awards to more
deserving entries. These categories have not been eliminated. We will
likely be awarding them in future years.</p>
<p>We received a few entries whose instructions were rot13’d. While
@@ -434,9 +434,10 @@ nothing was said about this in the rules, we found that it made the
judging process a little harder, so we may request that this not
be done this in the future.</p>
<p>Some thought has been given to a separate obfuscated perl contest.
Watch comp.lang.perl for details!</p>
<p>Be sure to wait until the 1993 rules are posted before submitting entries.
We may fine tune the rules to reflect the some ideas above.</p>
Watch <em>comp.lang.perl</em> for details!</p>
<p>Be sure to wait until the <a href="../1993/rules.txt">1993 rules</a> are posted before
submitting entries. We may fine tune the rules to reflect some of the ideas
above.</p>
<p>Please send us comments and suggestions what we have expressed above.
Also include anything else that you would like to see in future contests.
Send such email to:</p>
+5 -4
View File
@@ -22,10 +22,11 @@ NOTE: Some compilers have had trouble optimizing this entry.
NOTE: Some systems need to compile with `-ltermcap` as well as `-lcurses`.
NOTE: The original winning source [marangon.orig.c](%%REPO_URL%%/1992/marangon/marangon.orig.c), found in
the archive directory, assumed that `exit(3)` returns a value which cause
problems for some systems where `exit(3)` returns a `void`. The file
[marangon.c](%%REPO_URL%%/1992/marangon/marangon.c) avoids this problem.
NOTE: The original winning source
[marangon.orig.c](%%REPO_URL%%/1992/marangon/marangon.orig.c) assumed that
`exit(3)` returns a value which cause problems for some systems where `exit(3)`
returns a `void`. The file [marangon.c](%%REPO_URL%%/1992/marangon/marangon.c)
avoids this problem.
## Author's remarks:
+5 -4
View File
@@ -411,10 +411,11 @@ numbers as needed. It is the side effects that get you into trouble. If you
are not careful, you may find things “at 6’s and 7’s”. :-)</p>
<p>NOTE: Some compilers have had trouble optimizing this entry.</p>
<p>NOTE: Some systems need to compile with <code>-ltermcap</code> as well as <code>-lcurses</code>.</p>
<p>NOTE: The original winning source <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/marangon/marangon.orig.c">marangon.orig.c</a>, found in
the archive directory, assumed that <code>exit(3)</code> returns a value which cause
problems for some systems where <code>exit(3)</code> returns a <code>void</code>. The file
<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/marangon/marangon.c">marangon.c</a> avoids this problem.</p>
<p>NOTE: The original winning source
<a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/marangon/marangon.orig.c">marangon.orig.c</a> assumed that
<code>exit(3)</code> returns a value which cause problems for some systems where <code>exit(3)</code>
returns a <code>void</code>. The file <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/marangon/marangon.c">marangon.c</a>
avoids this problem.</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<p>It starts off by creating a table with number 5 in all places. The CPU melts
the numbers and you must return them in original state. When you increase a