make allThe current status of this entry is:
- STATUS: missing file - please provide it STATUS: INABIAF - please DO NOT fix
+ STATUS: missing file - please provide itFor more detailed information see 1993/ant in bugs.html.
./ant 'ERE' [file ...]We recommend you try the alt version first so you can get a better idea of what -this entry was like back in 1993. See the original code -section below to run the original.
+We recommend you try the alternate version first so you can get a better idea of what +this entry was like back in 1993 (though see the known bug in +bugs.html). See the original code +section below to run the original (the bug also exists here).
make altNOTE: this entry requires the X11/Xlib.h header file and the X11 library to
-compile. If you’re under macOS and do not know how to install and use X11
-programs see FAQ 3.7 - How do I compile and use on macOS, an IOCCC entry that
-requires X11?.
To configure how many microseconds to sleep before updates try:
make clobber SLEEP=200 altFrom the San Jose Mercury News (May 15, 1993 page 20A “West Hackers trounce East in computer quiz game”):
- "Since 1984, a contest has been held on Usenet for the most
- unreadable, creative, bizarre but working C program", Gates
- said. "What is the name of this contest"
-
- "Windows," shot back Gassee, naming Microsoft's premier product
- - a product over which Apple sued Microsoft five years ago. Not
- the right answer - it's "The Obfuscated C Contest [sic]" - but
- it brought down the house of Apple partisans...+“Since 1984, a contest has been held on Usenet for the most unreadable, +creative, bizarre but working C program”, Gates said. “What is the name of this +contest?”
+“Windows,” shot back Gassee, naming Microsoft’s premier product - a +product over which Apple sued Microsoft five years ago. Not the right answer - +it’s “The Obfuscated C Contest [sic]” - but it brought down the house of Apple +partisans…
+
[The expression on Bill Gates’ face was a sight to behold, as reported to us by several who were there].
You must set where: where: where $DISPLAY in your environment or the program will
diff --git a/1993/dgibson/README.md b/1993/dgibson/README.md
index fd860b4fa..429e97ca3 100644
--- a/1993/dgibson/README.md
+++ b/1993/dgibson/README.md
@@ -13,7 +13,8 @@
where:
-`datafile` is the initial pattern (default is the [dgibson.data1](%%REPO_URL%%/1993/dgibson/dgibson.data1) file)
+`datafile` is the initial pattern (default is the
+[dgibson.data1](%%REPO_URL%%/1993/dgibson/dgibson.data1) file).
## Try:
diff --git a/1993/dgibson/index.html b/1993/dgibson/index.html
index 58899813b..9957ab7cf 100644
--- a/1993/dgibson/index.html
+++ b/1993/dgibson/index.html
@@ -406,7 +406,8 @@ Location: ZA - Republic of South Africa
To use:
./dgibson.sh [datafile]datafile is the initial pattern (default is the dgibson.data1 file)datafile is the initial pattern (default is the
+dgibson.data1 file).Try:
./try.shJudges’ remarks:
diff --git a/1993/ejb/README.md b/1993/ejb/README.md
index d89d8a6f9..da200aa71 100644
--- a/1993/ejb/README.md
+++ b/1993/ejb/README.md
@@ -11,11 +11,7 @@
./ejb level
```
-where:
-
-```
- level a value from -128 to 127
-```
+where `level` is a value from `-128` to `127`.
## Try:
@@ -88,8 +84,8 @@ reasonably, however.)
Although this program has only been tested on UNIX systems it will probably run
on just about any machine with an ANSI C compiler. It does not use the C
-preprocessor at all. The only functions it uses are `atoi()`, `malloc()`,
-`memset()`, `printf()`, and `puts()`. It does, however, require that the
+preprocessor at all. The only functions it uses are `atoi(3)`, `malloc(3)`,
+`memset(3)`, `printf(3)`, and `puts(3)`. It does, however, require that the
architecture it runs on have bytes that are at least eight bits long and
pointers that are at least four bytes long. In addition, it requires an ANSI
compiler since it uses `signed char` and ANSI-style function declarations.
diff --git a/1993/ejb/index.html b/1993/ejb/index.html
index 8ba10882a..806ec3b31 100644
--- a/1993/ejb/index.html
+++ b/1993/ejb/index.html
@@ -405,8 +405,7 @@ Location: US - United States of America
make allTo use:
- ./ejb level
+ level a value from -128 to 127level is a value from -128 to 127.Try:
./try.shJudges’ remarks:
@@ -451,8 +450,8 @@ indented properly. (It is pretty hard to indent this code
reasonably, however.)
Although this program has only been tested on UNIX systems it will probably run
on just about any machine with an ANSI C compiler. It does not use the C
-preprocessor at all. The only functions it uses are atoi(), malloc(),
-memset(), printf(), and puts(). It does, however, require that the
+preprocessor at all. The only functions it uses are atoi(3), malloc(3),
+memset(3), printf(3), and puts(3). It does, however, require that the
architecture it runs on have bytes that are at least eight bits long and
pointers that are at least four bytes long. In addition, it requires an ANSI
compiler since it uses signed char and ANSI-style function declarations.
U. This constraint
leads to a recursive solution to the puzzle. Like the
-Towers of Hanoi, the number of steps to solve this puzzle is
+Towers of Hanoi, the number of steps to solve this puzzle is
exponential in the number of rings.
Jump to: top
diff --git a/1993/ejb/patience.md b/1993/ejb/patience.md index f7fc03a95..e1a52bcbe 100644 --- a/1993/ejb/patience.md +++ b/1993/ejb/patience.md @@ -139,7 +139,7 @@ restoration of ring 1 and the removal of ring 3. This is because ring 1 is always movable, and ring 3 is currently the second ring still attached to the `U`. This constraint leads to a recursive solution to the puzzle. Like the -[Towers of Hanoi](%%REPO_URL%%/1993/ejb/hanoi.md), the number of steps to solve this puzzle is +[Towers of Hanoi](hanoi.html), the number of steps to solve this puzzle is exponential in the number of rings. diff --git a/1993/index.html b/1993/index.html index 57c2285fc..b57c6b217 100644 --- a/1993/index.html +++ b/1993/index.html @@ -405,14 +405,14 @@ classic K&R C was allowed so long as ANSI C compilers could still compile the entry. If you do not have an ANSI C compiler, you may not be able to compile the entry, sorry!Be sure to wait until the 1994 rules are posted before submitting entries. -Rules differ from year to year, sometimes in significant ways.
-In 1994, we will retract the guideline that discouraged the use of C
-constructs such as 3["curds"]. At one time, certain ANSI compilers did
-not consider such expressions to be valid ANSI C. Alert readers noted
-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.
Be sure to wait until the 1994 rules are posted before +submitting entries. Rules differ from year to year, sometimes in significant +ways.
+In 1994, we will retract the guideline that discouraged
+the use of C constructs such as 3["curds"]. At one time, certain ANSI
+compilers did not consider such expressions to be valid ANSI C. Alert readers
+noted 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.
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:
diff --git a/1993/jonth/README.md b/1993/jonth/README.md index 4aedf83ff..b051c3596 100644 --- a/1993/jonth/README.md +++ b/1993/jonth/README.md @@ -1,9 +1,9 @@ ## To build: -NOTE: this entry requires `X11/Xlib.h` header file and the X11 library to -compile. macOS users running Mountain Lion and later will need to download and -install [XQuartz](https://www.xquartz.org) in order to compile and run this -entry. +NOTE: this entry requires the `X11/Xlib.h` header file and the X11 library to +compile. See [the FAQ on how to run entries that require X11](../../faq.html#X11) if +you need help. + ``` make all @@ -30,7 +30,7 @@ on inverse video. :-) This is `jonth` (`jon's t(h)etris`) for the X Window System. -This program is also an example of data abstraction. The X array is +This program is also an example of data abstraction. The `X` array is after initialization hidden by the well defined macros `t`, `u` and `F`. This program is highly portable as it runs on a "Notebook" size SPARC. diff --git a/1993/jonth/index.html b/1993/jonth/index.html index 29bece03d..6f3f3c751 100644 --- a/1993/jonth/index.html +++ b/1993/jonth/index.html @@ -402,10 +402,9 @@ Location: NO - Kingdom of Norway (NOTE: this entry requires X11/Xlib.h header file and the X11 library to
-compile. macOS users running Mountain Lion and later will need to download and
-install XQuartz in order to compile and run this
-entry.
NOTE: this entry requires the X11/Xlib.h header file and the X11 library to
+compile. See the FAQ on how to run entries that require X11 if
+you need help.
make all ./jonth # must be run on an X11 serverThis is jonth (jon's t(h)etris) for the X Window System.
This program is also an example of data abstraction. The X array is +
This program is also an example of data abstraction. The X array is
after initialization hidden by the well defined macros t, u and F.
This program is highly portable as it runs on a “Notebook” size SPARC.
This program will not work on machines where sizeof(int)!=sizeof(void *).
This program plays
Mastermind, if you call
-it by a name ending by ‘d’, otherwise it solves Mastermind. Call it without
+it by a name ending by d, otherwise it solves Mastermind. Call it without
parameters to use 6 digits (colors), or indicate the number of possible digits
(you cannot change the number of positions so easily).
The number in parentheses is the number of possible combinations, @@ -439,7 +439,7 @@ of binary coded colors-base numbers is.
Suggestions: Use terminal (or emulator) with non-destructive backspaces. Do “disable scrolling” on cmdtool or similar emulators.
Please don’t type ^D at the prompt!!
+Please don’t type ^D at the prompt!!
$ ./leo
(1296): 6433
diff --git a/1993/lmfjyh/README.md b/1993/lmfjyh/README.md
index 273e8b1fc..fbc53a9cf 100644
--- a/1993/lmfjyh/README.md
+++ b/1993/lmfjyh/README.md
@@ -28,9 +28,8 @@ _a long time ago_ (.. _in a galaxy far, far away_?).
If `make all` fails to compile, a suggestion of compiling and running
the alternate version is printed. This alternate version is a variant
-for [those of us](https://www.collinsdictionary.com/dictionary/english/everyone)
-with gcc >= 2.3.3 or using clang. See [Alternate code](#alternate-code)
-section below for more details.
+for those of us with gcc >= 2.3.3 or using clang. See [Alternate
+code](#alternate-code) section below for more details.
### Bugs and (Mis)features:
@@ -57,7 +56,6 @@ If you have gcc < 2.3.3 (i.e. the entry can compile):
This version does what the code did but in a way that will work with modern
compilers. We'd like to say there's something special about it but there isn't.
-Nonetheless it will be compiled in case the original entry fails to compile.
### Alternate build:
@@ -201,7 +199,7 @@ These failed miserably:
- `dbx` - Quit with a very 'informative' error message:
`"dbx: fatal error: Is a directory"`
-- gdb - Printed almost the same error message `": Is a directory"`.
+- `gdb` - Printed almost the same error message `": Is a directory"`.
It was, however, possible to step through the code but
not list it.
diff --git a/1993/lmfjyh/index.html b/1993/lmfjyh/index.html
index 489ae95a8..56454efcf 100644
--- a/1993/lmfjyh/index.html
+++ b/1993/lmfjyh/index.html
@@ -418,9 +418,8 @@ on a bug which was later fixed in gcc 2.3.3, and that happened
a long time ago (.. in a galaxy far, far away?).
If make all fails to compile, a suggestion of compiling and running
the alternate version is printed. This alternate version is a variant
-for those of us
-with gcc >= 2.3.3 or using clang. See Alternate code
-section below for more details.
+for those of us with gcc >= 2.3.3 or using clang. See Alternate
+code section below for more details.
Bugs and (Mis)features:
The current status of this entry is:
STATUS: INABIAF - please DO NOT fix
@@ -430,8 +429,7 @@ section below for more details.
./lmfjyh
Alternate code:
This version does what the code did but in a way that will work with modern
-compilers. We’d like to say there’s something special about it but there isn’t.
-Nonetheless it will be compiled in case the original entry fails to compile.
+compilers. We’d like to say there’s something special about it but there isn’t.
Alternate build:
Should you wish to build this version manually:
make alt
@@ -518,7 +516,7 @@ with some older UNIX variants).
dbx - Quit with a very ‘informative’ error message:
"dbx: fatal error: Is a directory"
gdb - Printed almost the same error message ": Is a directory".
+
gdb - Printed almost the same error message ": Is a directory".
It was, however, possible to step through the code but
not list it.
diff --git a/1993/plummer/README.md b/1993/plummer/README.md
index dd38e0786..0df6ef2ea 100644
--- a/1993/plummer/README.md
+++ b/1993/plummer/README.md
@@ -64,8 +64,7 @@ bypass](https://hitchhikers.fandom.com/wiki/Bypass).
## Original code:
This version, the original, does not sleep in between writes, and is thus much
-faster (depending on the `SLEEP` parameter specified in the build of `alt`, of
-course).
+faster, at least with modern systems.
### Original build:
@@ -117,7 +116,7 @@ but must be present.
Variable names are single characters chosen for their similarity to other
characters (`O` for `0` (zero), `l` for `1` (one), `S` for `5` (five) in some
fonts, and `_` for ... well nothing really, but it is easy to miss). To
-prevent the need for `strlen()`, the fact that argv is laid out sequentially is
+prevent the need for `strlen(3)`, the fact that argv is laid out sequentially is
exploited (i.e. `argv[i + 1] == argv[i] + strlen(argv[i]) + 1`). This is not
portable (by the books), but it seems to work everywhere I try (actually, for
VMS, that only holds for `i > 1`). Also, I depend on the fact that a carriage
@@ -131,11 +130,11 @@ who don't mind ruining our eyes with 132 column screens).
The first statement points the base of `l` (the argument vector) to
be the first argument by incrementing it. It then assigns `O` to
point to the character before the first character of the second
-argument which also happens to be the NUL termination of the first
+argument which also happens to be the `NUL` termination of the first
argument. `*O` gets a `\r` assigned to it. Finally `0` is assigned to
the first character of the second argument which has the effect of
-NUL terminating the first argument after the carriage return had
-removed its NUL termination. I really tried to make the last part
+`NUL` terminating the first argument after the carriage return had
+removed its `NUL` termination. I really tried to make the last part
of that statement part of the original expression, but the best I
could do was attach it with a comma (against the advice of K&R).
The for loop runs the next for loop continuously (actually until
diff --git a/1993/plummer/index.html b/1993/plummer/index.html
index 41b54df95..1f5ab3ccf 100644
--- a/1993/plummer/index.html
+++ b/1993/plummer/index.html
@@ -441,8 +441,7 @@ bypass.
SLEEP=1200 ./try.alt.sh xyzzyzzyx 5555This version, the original, does not sleep in between writes, and is thus much
-faster (depending on the SLEEP parameter specified in the build of alt, of
-course).
make allVariable names are single characters chosen for their similarity to other
characters (O for 0 (zero), l for 1 (one), S for 5 (five) in some
fonts, and _ for … well nothing really, but it is easy to miss). To
-prevent the need for strlen(), the fact that argv is laid out sequentially is
+prevent the need for strlen(3), the fact that argv is laid out sequentially is
exploited (i.e. argv[i + 1] == argv[i] + strlen(argv[i]) + 1). This is not
portable (by the books), but it seems to work everywhere I try (actually, for
VMS, that only holds for i > 1). Also, I depend on the fact that a carriage
@@ -486,11 +485,11 @@ who don’t mind ruining our eyes with 132 column screens).
The first statement points the base of l (the argument vector) to
be the first argument by incrementing it. It then assigns O to
point to the character before the first character of the second
-argument which also happens to be the NUL termination of the first
+argument which also happens to be the NUL termination of the first
argument. *O gets a \r assigned to it. Finally 0 is assigned to
the first character of the second argument which has the effect of
-NUL terminating the first argument after the carriage return had
-removed its NUL termination. I really tried to make the last part
+NUL terminating the first argument after the carriage return had
+removed its NUL termination. I really tried to make the last part
of that statement part of the original expression, but the best I
could do was attach it with a comma (against the advice of K&R).
The for loop runs the next for loop continuously (actually until
diff --git a/1993/rince/README.md b/1993/rince/README.md
index 523e65fbe..bbd9ab90f 100644
--- a/1993/rince/README.md
+++ b/1993/rince/README.md
@@ -78,7 +78,8 @@ The author has provided several CABBAGE files for your amusement:
for left, `/` for right, and `.` for 'fire the ball'.
- [rince.data2](%%REPO_URL%%/1993/rince/rince.data2) plays the old [James Bonfield](../../authors.html#James_Bonfield)'s
-([1991/rince](../../1991/rince/index.html) game from IOCCC 1991.
+([1991/rince](../../1991/rince/index.html) game from [IOCCC
+1991](../../1991/index.html)).
- [rince.data3](%%REPO_URL%%/1993/rince/rince.data3) Sokoban screen 11. You are the `o` character.
You must push the money `m` into the dotted region of the screen. The game is
@@ -166,7 +167,7 @@ conflict of the two).
The use of `select(2)` no doubt makes it less portable to STRICT SysV machines.
However I have tested this on several so-called SysV machines, and all of them
support `select(2)`. In fact, the `select(2)` they support appears to be more
-portable between them than their `poll()` call.
+portable between them than their `poll(2)` call.
### Obfuscation
@@ -174,11 +175,11 @@ portable between them than their `poll()` call.
I have tried to use as many different obfuscation techniques, including
some of which (such as `sizeof` confusion) I have not seen in any entries
(hmmm - perhaps there's a reason for that...) so far. Also, very poor
-structure (yes, I use `goto`'s) has led to apparently having an `fgets()` as
+structure (yes, I use `goto`'s) has led to apparently having an `fgets(3)` as
the last line of main. Note that I have still tried to aim at least some
efficiency (provided it makes things slightly more obfuscated of course).
One such thing is the way I dynamically allocate a 2-dimensional array
-using only ONE `malloc()`. Hence this program could be used as a tutorial
+using only ONE `malloc(3)`. Hence this program could be used as a tutorial
for all those people who consistently ask this question in the C
newsgroups.
diff --git a/1993/rince/index.html b/1993/rince/index.html
index ddce6e82b..74f214277 100644
--- a/1993/rince/index.html
+++ b/1993/rince/index.html
@@ -437,7 +437,8 @@ changed).
,
for left, / for right, and . for ‘fire the ball’.
rince.data2 plays the old James Bonfield’s -(1991/rince game from IOCCC 1991.
rince.data3 Sokoban screen 11. You are the o character.
You must push the money m into the dotted region of the screen. The game is
considered finished when all the ms are then Ms.
The use of select(2) no doubt makes it less portable to STRICT SysV machines.
However I have tested this on several so-called SysV machines, and all of them
support select(2). In fact, the select(2) they support appears to be more
-portable between them than their poll() call.
poll(2) call.
I have tried to use as many different obfuscation techniques, including
some of which (such as sizeof confusion) I have not seen in any entries
(hmmm - perhaps there’s a reason for that…) so far. Also, very poor
-structure (yes, I use goto’s) has led to apparently having an fgets() as
+structure (yes, I use goto’s) has led to apparently having an fgets(3) as
the last line of main. Note that I have still tried to aim at least some
efficiency (provided it makes things slightly more obfuscated of course).
One such thing is the way I dynamically allocate a 2-dimensional array
-using only ONE malloc(). Hence this program could be used as a tutorial
+using only ONE malloc(3). Hence this program could be used as a tutorial
for all those people who consistently ask this question in the C
newsgroups.
Also, the program does require a volatile type (especially when diff --git a/1993/schnitzi/README.md b/1993/schnitzi/README.md index a36c71491..009256365 100644 --- a/1993/schnitzi/README.md +++ b/1993/schnitzi/README.md @@ -79,7 +79,7 @@ The author suggests the following questions when using - Do colorless green ideas sleep furiously? We suggest you try using the body (minus the header and signature line) -of a Usenet article. You might want to try something from alt.flame. :-) +of a Usenet article. You might want to try something from _alt.flame_. :-) NOTE: If you have certain `'` in the question this entry might fail. diff --git a/1993/schnitzi/index.html b/1993/schnitzi/index.html index 45c9038e8..b8b888deb 100644 --- a/1993/schnitzi/index.html +++ b/1993/schnitzi/index.html @@ -443,7 +443,7 @@ some questions related to the text.
We suggest you try using the body (minus the header and signature line) -of a Usenet article. You might want to try something from alt.flame. :-)
+of a Usenet article. You might want to try something from alt.flame. :-)NOTE: If you have certain ' in the question this entry might fail.
I wanted to write a program that would read in a text file in diff --git a/bugs.html b/bugs.html index e556368a1..31876007d 100644 --- a/bugs.html +++ b/bugs.html @@ -1297,7 +1297,7 @@ the index.html file for details.
Although the code checks if the file can be opened or not, badly formatted files will cause problems. No other checks are performed either.
-There is no end of game checking method so you will have to quit the game +
There is no end of game checking function so you will have to quit the game through ctrl-c or such.