Merge pull request #2502 from xexyl/html94

Format fixes in html files of 1994
This commit is contained in:
Landon Curt Noll authored and GitHub committed 2024-06-24 18:07:20 -07:00
commit b35d280cd1
18 files changed
+114 -94

No files matched your search

+11 -11
View File
@@ -24,9 +24,9 @@ unable to find an ANSI C compiler that flagged such expressions as
errors.
Rule abuse was encouraged this year - two of this year's winning entries found
new and interesting abuses of the rules. Next year's rules will change
due to these [smr](smr/index.html) and [dodsond2](dodsond2/index.html) entries'
forms of abuse.
new and interesting abuses of the [rules](rules.txt). [Next year's
rules](../1995/rules.txt) will change due to these ([smr](smr/index.html) and
[dodsond2](dodsond2/index.html)) entries' forms of abuse.
## Want to be an IOCCC Judge?
@@ -130,15 +130,15 @@ See also [the IOCCC FAQ](../faq.html) for additional information on the IOCCC.
We would like to thank Barbara Frezza for her role as official chef
of the contest. Landon Curt Noll and Larry Bassel appreciated the opportunity
to serve as official taste testers. And as usual, the food was excellent.
The official menu of the 1994 Obfuscated C Contest dinner:
The official menu of the [1994 Obfuscated C Contest](index.html) dinner:
Antipasto: meats, cheeses, olives, peppers, pickles, artichokes
Soup: Cream of tomato
Salad: spring mix
Pasta: Linguine with wild mushrooms and Reggiano Parmesan
Seafood: Salmon in cream sauce or lobster claws
Vegetable: Zucchini
Dessert: Homemade chocolate/pecan brownies, fruit
**Antipasto**: meats, cheeses, olives, peppers, pickles, artichokes<br>
**Soup**: Cream of tomato<br>
**Salad**: spring mix<br>
**Pasta**: Linguine with wild mushrooms and Reggiano Parmesan<br>
**Seafood**: Salmon in cream sauce or lobster claws<br>
**Vegetable**: Zucchini<br>
**Dessert**: Homemade chocolate/pecan brownies, fruit<br>
<!--
+5 -8
View File
@@ -71,18 +71,15 @@ the contest!
The original source code was submitted as a GZIP compressed file
that the _file(1)_ command reports as:
```
dodsond2.gz: gzip compressed data, last modified: Mon Aug 29 21:54:39 1994, max compression, from Unix, original size modulo 2^32 2652
```
> dodsond2.gz: gzip compressed data, last modified: Mon Aug 29 21:54:39 1994,
max compression, from Unix, original size modulo 2^32 2652
The [dodsond2.gz](dodsond2.gz) file was submitted as source
in an effort to get around the 1994 version of Rule 2:
```
2) Your entry must be <= 3217 bytes in length. The number of characters
excluding whitespace (tab, space, newline), and excluding any ; { or }
followed by either whitespace or end of file, must be <= 1536.
```
> 2) Your entry must be <= 3217 bytes in length. The number of characters
excluding whitespace (tab, space, newline), and excluding any ; { or } followed
by either whitespace or end of file, must be <= 1536.
Indeed the [dodsond2.c](%%REPO_URL%%/1994/dodsond2/dodsond2.c) file is
what you find today.
+11 -4
View File
@@ -432,12 +432,19 @@ the contest!</p>
<h3 id="a-historical-note">A historical note:</h3>
<p>The original source code was submitted as a GZIP compressed file
that the <em>file(1)</em> command reports as:</p>
<pre><code> dodsond2.gz: gzip compressed data, last modified: Mon Aug 29 21:54:39 1994, max compression, from Unix, original size modulo 2^32 2652</code></pre>
<blockquote>
<p>dodsond2.gz: gzip compressed data, last modified: Mon Aug 29 21:54:39 1994,
max compression, from Unix, original size modulo 2^32 2652</p>
</blockquote>
<p>The <a href="dodsond2.gz">dodsond2.gz</a> file was submitted as source
in an effort to get around the 1994 version of Rule 2:</p>
<pre><code> 2) Your entry must be &lt;= 3217 bytes in length. The number of characters
excluding whitespace (tab, space, newline), and excluding any ; { or }
followed by either whitespace or end of file, must be &lt;= 1536.</code></pre>
<blockquote>
<ol start="2" type="1">
<li>Your entry must be &lt;= 3217 bytes in length. The number of characters
excluding whitespace (tab, space, newline), and excluding any ; { or } followed
by either whitespace or end of file, must be &lt;= 1536.</li>
</ol>
</blockquote>
<p>Indeed the <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/dodsond2/dodsond2.c">dodsond2.c</a> file is
what you find today.</p>
<p>The IOCCC rules and guidelines were modified in an effort to address
+3 -5
View File
@@ -60,11 +60,9 @@ useful the exclusive-or operator was while writing function `s()`.
Here are the descriptions of the functions in the library:
```
o(n,a,q,d): makes a magic square of order n when n is odd and at least 3.
s(n,a,q,d): makes a magic square of order n when n equals 4.
e(n,a,q,d): makes a magic square of order n when n is even and at least 6.
```
> o(n,a,q,d): makes a magic square of order n when n is odd and at least 3.<br>
> s(n,a,q,d): makes a magic square of order n when n equals 4.<br>
> e(n,a,q,d): makes a magic square of order n when n is even and at least 6.
In the above, `a` (of type `int *`) points to an area of memory in which
the magic square will be stored and `q` (also of type `int *`) points to
+5 -3
View File
@@ -436,9 +436,11 @@ used to make the random squares are quite complex without being shrouded
in obfuscated code! :-) Incidentally, I was surprised to find out how
useful the exclusive-or operator was while writing function <code>s()</code>.</p>
<p>Here are the descriptions of the functions in the library:</p>
<pre><code> o(n,a,q,d): makes a magic square of order n when n is odd and at least 3.
s(n,a,q,d): makes a magic square of order n when n equals 4.
e(n,a,q,d): makes a magic square of order n when n is even and at least 6.</code></pre>
<blockquote>
<p>o(n,a,q,d): makes a magic square of order n when n is odd and at least 3.<br>
s(n,a,q,d): makes a magic square of order n when n equals 4.<br>
e(n,a,q,d): makes a magic square of order n when n is even and at least 6.</p>
</blockquote>
<p>In the above, <code>a</code> (of type <code>int *</code>) points to an area of memory in which
the magic square will be stored and <code>q</code> (also of type <code>int *</code>) points to
an area of memory of length at least <code>n*sizeof(int)</code> bytes which can be
+11 -11
View File
@@ -406,9 +406,9 @@ that the current ANSI standard considered them to be valid. We were
unable to find an ANSI C compiler that flagged such expressions as
errors.</p>
<p>Rule abuse was encouraged this year - two of this year’s winning entries found
new and interesting abuses of the rules. Next year’s rules will change
due to these <a href="smr/index.html">smr</a> and <a href="dodsond2/index.html">dodsond2</a> entries’
forms of abuse.</p>
new and interesting abuses of the <a href="rules.txt">rules</a>. <a href="../1995/rules.txt">Next year’s
rules</a> will change due to these (<a href="smr/index.html">smr</a> and
<a href="dodsond2/index.html">dodsond2</a>) entries’ forms of abuse.</p>
<h2 id="want-to-be-an-ioccc-judge">Want to be an IOCCC Judge?</h2>
<p>We are thinking about adding a 3rd judge to our team. A 3rd judge
would help distribute the work load as well as to allowing us to
@@ -481,14 +481,14 @@ See also <a href="../faq.html">the IOCCC FAQ</a> for additional information on t
<p>We would like to thank Barbara Frezza for her role as official chef
of the contest. Landon Curt Noll and Larry Bassel appreciated the opportunity
to serve as official taste testers. And as usual, the food was excellent.
The official menu of the 1994 Obfuscated C Contest dinner:</p>
<p>Antipasto: meats, cheeses, olives, peppers, pickles, artichokes
Soup: Cream of tomato
Salad: spring mix
Pasta: Linguine with wild mushrooms and Reggiano Parmesan
Seafood: Salmon in cream sauce or lobster claws
Vegetable: Zucchini
Dessert: Homemade chocolate/pecan brownies, fruit</p>
The official menu of the <a href="index.html">1994 Obfuscated C Contest</a> dinner:</p>
<p><strong>Antipasto</strong>: meats, cheeses, olives, peppers, pickles, artichokes<br>
<strong>Soup</strong>: Cream of tomato<br>
<strong>Salad</strong>: spring mix<br>
<strong>Pasta</strong>: Linguine with wild mushrooms and Reggiano Parmesan<br>
<strong>Seafood</strong>: Salmon in cream sauce or lobster claws<br>
<strong>Vegetable</strong>: Zucchini<br>
<strong>Dessert</strong>: Homemade chocolate/pecan brownies, fruit<br></p>
<!--
Copyright © 1984-2024 by Landon Curt Noll. All Rights Reserved.
+1 -1
View File
@@ -38,7 +38,7 @@ Trigraphs are natural obfuscators. Most C-beautifiers become C-uglifiers
because they don't handle them correctly.
Can you figure out how it prints a given random line (or if the line is longer
than 231 characters, part of that line) from stdin?
than 231 characters, part of that line) from `stdin`?
## Author's remarks:
+1 -1
View File
@@ -417,7 +417,7 @@ Location: <a href="../../location.html#US">US</a> - <em>United States of America
<p>Trigraphs are natural obfuscators. Most C-beautifiers become C-uglifiers
because they don’t handle them correctly.</p>
<p>Can you figure out how it prints a given random line (or if the line is longer
than 231 characters, part of that line) from stdin?</p>
than 231 characters, part of that line) from <code>stdin</code>?</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<p>All input lines must be under 232 characters long. The compiling
platform should be ASCII based.</p>
+1 -1
View File
@@ -44,7 +44,7 @@ compile. Other functionality works fine.
The second version, `schnitzi.alt2.c`, has an increased buffer size but when fed
its own source code it will generate code that can compile but with the original
buffer size. This is due to a comment which is explained in more detail in
[1994/schnitzi bugs](../../bugs.html#1994_schnitzi).
[1994/schnitzi in bugs.html](../../bugs.html#1994_schnitzi).
### Alternate build:
+1 -1
View File
@@ -422,7 +422,7 @@ compile. Other functionality works fine.</p>
<p>The second version, <code>schnitzi.alt2.c</code>, has an increased buffer size but when fed
its own source code it will generate code that can compile but with the original
buffer size. This is due to a comment which is explained in more detail in
<a href="../../bugs.html#1994_schnitzi">1994/schnitzi bugs</a>.</p>
<a href="../../bugs.html#1994_schnitzi">1994/schnitzi in bugs.html</a>.</p>
<h3 id="alternate-build">Alternate build:</h3>
<pre><code> make alt</code></pre>
<h3 id="alternate-use">Alternate use:</h3>
+6 -4
View File
@@ -466,10 +466,12 @@ to the string we just put there.</li>
(<code>"\0337\033[%d;65;H%s\0338"</code>) If you can read VTxxx (and I read books printed
as ANSI/VTxxx codes for fun :-) ) you know this is the sequence for:</li>
</ol>
<pre><code> remember where we are,
go somewhere else,
print the message,
and return to where we started.</code></pre>
<blockquote>
<p>remember where we are,<br>
go somewhere else,<br>
print the message,<br>
and return to where we started.</p>
</blockquote>
<p>Line 22 says if this message is not for us (the number is bigger than ours)
send it to <code>h</code> (up).</p>
<p>Lines 24 to 27 are the master code. Here we get the time and convert it
+4 -6
View File
@@ -97,12 +97,10 @@ to the string we just put there.
(`"\0337\033[%d;65;H%s\0338"`) If you can read VTxxx (and I read books printed
as ANSI/VTxxx codes for fun :-) ) you know this is the sequence for:
```
remember where we are,
go somewhere else,
print the message,
and return to where we started.
```
> remember where we are,<br>
> go somewhere else,<br>
> print the message,<br>
> and return to where we started.
Line 22 says if this message is not for us (the number is bigger than ours)
send it to `h` (up).
+10 -6
View File
@@ -169,14 +169,18 @@ compatible compiler (`gcc -ansi -pedantic` will do fine).
This entry has been tested on wide variety of machines including:
```
Machine OS
------- --
Machine OS
------- --
Decstation 5000/240 Ultrix 4.3A
DECAlpha 3000/300 OSF/1 v1.3 and v2.0
DECAlpha 3000/300 OSF/1 v1.3
and v2.0
IBM RS6000 AIX v3
SPARCStation IPX SunOS 4.1.3
i486 Linux v1.1.8 (binarysize 3576 bytes
using `gcc -O6 -s -N` ;)
i486 Linux v1.1.8
(binarysize
3576 bytes
using
`gcc -O6 -s -N` ;)
HP 9000/730 HP-UX
```
@@ -228,7 +232,7 @@ why ;)
### Bugs
- No error checking. If DISPLAY is not set program dumps core. This may also
- No error checking. If `DISPLAY` is not set program dumps core. This may also
happen if a request of some of the resources fails e.g. getting colors.
- No expose event handling.
- It may be possible that the program starts drawing before window is mapped as
+10 -6
View File
@@ -499,14 +499,18 @@ display).</p>
highest level of optimization possible. You will also need an ANSI
compatible compiler (<code>gcc -ansi -pedantic</code> will do fine).</p>
<p>This entry has been tested on wide variety of machines including:</p>
<pre><code> Machine OS
------- --
<pre><code> Machine OS
------- --
Decstation 5000/240 Ultrix 4.3A
DECAlpha 3000/300 OSF/1 v1.3 and v2.0
DECAlpha 3000/300 OSF/1 v1.3
and v2.0
IBM RS6000 AIX v3
SPARCStation IPX SunOS 4.1.3
i486 Linux v1.1.8 (binarysize 3576 bytes
using `gcc -O6 -s -N` ;)
i486 Linux v1.1.8
(binarysize
3576 bytes
using
`gcc -O6 -s -N` ;)
HP 9000/730 HP-UX</code></pre>
<p>Also, many of the X server and X library versions have been tested and the
program should be highly portable. The program may slow down considerably on
@@ -539,7 +543,7 @@ the formula is different (look at the source ;) )</p>
why ;)</p>
<h3 id="bugs">Bugs</h3>
<ul>
<li>No error checking. If DISPLAY is not set program dumps core. This may also
<li>No error checking. If <code>DISPLAY</code> is not set program dumps core. This may also
happen if a request of some of the resources fails e.g. getting colors.</li>
<li>No expose event handling.</li>
<li>It may be possible that the program starts drawing before window is mapped as
+8 -4
View File
@@ -180,20 +180,24 @@ Here is a walk-through for the game, including a few dead-ends:
cc -Describe -Door westley.c
cc -Describe -Drain westley.c
cc -Describe -Dwarf westley.c
cc -Describe -Debris westley.c # or -Dungeon
cc -Describe -Debris westley.c \
# or -Dungeon
cc -Describe -Desk westley.c
cc -Describe -Dime westley.c
cc -Describe -Directory westley.c
cc -Dial -DUNgeon0614 westley.c
cc -Drink -Daiquiri westley.c
cc -Drop -Daiquiri westley.c
cc -Drop -Dwarf -Daiquiri westley.c # or -Drop -Down -Daiquiri
cc -Drop -Dwarf -Daiquiri westley.c \
# or -Drop -Down -Daiquiri
cc -Describe -Document westley.c
cc -Depress -Dotted -Dog westley.c
cc -Depress -Dalmatian westley.c # also accepts "Dalmation" [sic]
cc -Depress -Dalmatian westley.c \
# also accepts "Dalmation" [sic]
cc -Deposit -Dime westley.c
cc -Drop -Donut westley.c
cc -Drop -Donut -Down -Drain westley.c # or -Drop -Dwarf -Donut
cc -Drop -Donut -Down -Drain \
westley.c # or -Drop -Dwarf -Donut
# (at this point, you win!)
```
+8 -4
View File
@@ -505,20 +505,24 @@ with “verbose” turned on).</p>
<pre><code> cc -Describe -Door westley.c
cc -Describe -Drain westley.c
cc -Describe -Dwarf westley.c
cc -Describe -Debris westley.c # or -Dungeon
cc -Describe -Debris westley.c \
# or -Dungeon
cc -Describe -Desk westley.c
cc -Describe -Dime westley.c
cc -Describe -Directory westley.c
cc -Dial -DUNgeon0614 westley.c
cc -Drink -Daiquiri westley.c
cc -Drop -Daiquiri westley.c
cc -Drop -Dwarf -Daiquiri westley.c # or -Drop -Down -Daiquiri
cc -Drop -Dwarf -Daiquiri westley.c \
# or -Drop -Down -Daiquiri
cc -Describe -Document westley.c
cc -Depress -Dotted -Dog westley.c
cc -Depress -Dalmatian westley.c # also accepts &quot;Dalmation&quot; [sic]
cc -Depress -Dalmatian westley.c \
# also accepts &quot;Dalmation&quot; [sic]
cc -Deposit -Dime westley.c
cc -Drop -Donut westley.c
cc -Drop -Donut -Down -Drain westley.c # or -Drop -Dwarf -Donut
cc -Drop -Donut -Down -Drain \
westley.c # or -Drop -Dwarf -Donut
# (at this point, you win!)</code></pre>
<p>Note that the game has no real state information; you can type these
commands in any order, at any time. Also note that word order is
+10 -8
View File
@@ -1351,9 +1351,10 @@ not <code>d-46</code>.</p>
<h3 id="source-code-1994dodsond2dodsond2.c">Source code: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/dodsond2/dodsond2.c">1994/dodsond2/dodsond2.c</a></h3>
<h3 id="information-1994dodsond2index.html">Information: <a href="1994/dodsond2/index.html">1994/dodsond2/index.html</a></h3>
<p>When you initiate shooting via the <code>s</code> command you immediately lose an arrow
<em>before you choose where to shoot</em>.</p>
<p>When you shoot it will move you to that room so if you end up shooting into a
pit room you will end up dying even though you didn’t explicitly move there.</p>
<strong>before you choose <em>where to</em> shoot</strong>.</p>
<p>Also, when you shoot it will move you to that room so if you end up shooting
into a pit room you will end up dying even though you didn’t explicitly move
there.</p>
<div id="1994_ldb">
<h2 id="ldb">1994/ldb</h2>
</div>
@@ -1361,8 +1362,7 @@ pit room you will end up dying even though you didn’t explicitly move there.</
<h3 id="source-code-1994ldbldb.c">Source code: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/ldb/ldb.c">1994/ldb/ldb.c</a></h3>
<h3 id="information-1994ldbindex.html">Information: <a href="1994/ldb/index.html">1994/ldb/index.html</a></h3>
<p><a href="authors.html#Cody_Boone_Ferguson">Cody Boone Ferguson</a> fixed this to compile
with modern systems (see the <a href="thanks-for-help.html">thanks</a> file for
what had to change) but the entry also used <code>gets()</code> which in some systems would
with modern systems but the entry also used <code>gets()</code> which in some systems would
print out a warning along with the output of the program. Naturally it could
also overflow long lines. Cody changed it to <code>fgets()</code> to prevent the display
problem but this introduces another problem namely that newlines can be printed
@@ -1495,9 +1495,11 @@ if it checked for <code>!= EOF</code>.</p>
<h3 id="source-code-1994tvrtvr.c">Source code: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1994/tvr/tvr.c">1994/tvr/tvr.c</a></h3>
<h3 id="information-1994tvrindex.html">Information: <a href="1994/tvr/index.html">1994/tvr/index.html</a></h3>
<p>The judges said the following in their remarks:</p>
<pre><code> The fractally minded may be able to detect that mode 0 does not calculate
Mandelbrot/Julian sets correctly. Can you find the bug? Better still, can you
fix it without breaking something else?</code></pre>
<blockquote>
<p>The fractally minded may be able to detect that mode 0 does not calculate
Mandelbrot/Julian sets correctly. Can you find the bug? Better still, can you
fix it without breaking something else?</p>
</blockquote>
<p>You are welcome to try and fix it and open a pull request, providing that it
doesn’t break something else.</p>
<hr style="width:10%;text-align:left;margin-left:0">
+8 -10
View File
@@ -1397,10 +1397,11 @@ not `d-46`.
### Information: [1994/dodsond2/index.html](1994/dodsond2/index.html)
When you initiate shooting via the `s` command you immediately lose an arrow
_before you choose where to shoot_.
**before you choose _where to_ shoot**.
When you shoot it will move you to that room so if you end up shooting into a
pit room you will end up dying even though you didn't explicitly move there.
Also, when you shoot it will move you to that room so if you end up shooting
into a pit room you will end up dying even though you didn't explicitly move
there.
<div id="1994_ldb">
@@ -1412,8 +1413,7 @@ pit room you will end up dying even though you didn't explicitly move there.
### Information: [1994/ldb/index.html](1994/ldb/index.html)
[Cody Boone Ferguson](authors.html#Cody_Boone_Ferguson) fixed this to compile
with modern systems (see the [thanks](thanks-for-help.html) file for
what had to change) but the entry also used `gets()` which in some systems would
with modern systems but the entry also used `gets()` which in some systems would
print out a warning along with the output of the program. Naturally it could
also overflow long lines. Cody changed it to `fgets()` to prevent the display
problem but this introduces another problem namely that newlines can be printed
@@ -1611,11 +1611,9 @@ Since it works there is no need to fix this except for a challenge to yourself.
The judges said the following in their remarks:
```
The fractally minded may be able to detect that mode 0 does not calculate
Mandelbrot/Julian sets correctly. Can you find the bug? Better still, can you
fix it without breaking something else?
```
> The fractally minded may be able to detect that mode 0 does not calculate
Mandelbrot/Julian sets correctly. Can you find the bug? Better still, can you
fix it without breaking something else?
You are welcome to try and fix it and open a pull request, providing that it
doesn't break something else.