Fixes in 1995 winning entries' README.md files

...minus the ones that were fixed in earlier commits for specific
reasons.

Besides formatting and typo fixes I think the only thing noteworthy is
that 1995/spinellis was missing the URL which has been added now.
This commit is contained in:
Cody Boone Ferguson committed 2023-04-14 06:10:37 -07:00
1 parent c83c2674e1
commit 8efe343e63
10 files changed
+226 -142

No files matched your search

+1 -1
View File
@@ -20,7 +20,7 @@ macOS which he also fixed. Thank you Cody for your assistance!
NOTE: on modern systems this was hard to see it solve it in real time because it
goes so quickly so Cody added an alternate version which makes it easier with
modern systems to see the maze actually being solved in real time. We encourage
you to use this version but we keep the original here to both preserve the
you to use that version but we keep the original here to both preserve the
original code (the bug fixes notwithstanding) and it will also let you see just
how fast your computer is :-) (and you can also use both to see the difference).
For this alternate, slower version, please see below.
+19 -12
View File
@@ -1,32 +1,39 @@
# Most Humorous
Don Dodson
AG Communication Systems
4101 W Union Hills Dr #1104
Glendale, AZ 85308
USA
Don Dodson
AG Communication Systems
4101 W Union Hills Dr #1104
Glendale, AZ 85308
USA
## To build:
make all
```sh
make all
```
## To run:
./dodsond1 < text_file
```sh
./dodsond1 < text_file
```
## Try:
./dodsond1 < README.md
```sh
./dodsond1 < README.md
```
## Judges' remarks:
You might consider giving the following input:
```
... a male (who) gets very, very frustrated sitting in a chair all
the time because males are biologically driven to go out and hunt
giraffes.
-- Adjunct Professor Newt Gingrich, Reinhardt College, 1/7/95
```
... which can be done like:
@@ -41,12 +48,12 @@ The obfuscation is on several levels.
Most obviously, the shape of the program.
Underneath that, the variable names are in pig latin, as are the
Underneath that, the variable names are in pig Latin, as are the
names of the standard C functions, such as putchar. Even main is
written as ainma.
written as `ainma`.
The program construction is also very obfuscated, with all of the
code being inside the ()'s of one of the 6 "orfa" loops.
code being inside the ()'s of one of the 6 `orfa` loops.
## Copyright and CC BY-SA 4.0 License:
+11 -8
View File
@@ -1,19 +1,22 @@
# Best Game
Don Dodson
AG Communication Systems
4101 W Union Hills Dr #1104
Glendale, AZ 85308
USA
Don Dodson
AG Communication Systems
4101 W Union Hills Dr #1104
Glendale, AZ 85308
USA
## To build:
make all
```sh
make all
```
## To run:
./dodsond2
```sh
./dodsond2
```
## Judges' remarks:
+21 -16
View File
@@ -1,27 +1,32 @@
# Interesting Algorithm
Sebastian Deorowicz
ul. Radzionkowska 71a
42-605 Tarnowskie Gory
Poland
Sebastian Deorowicz
ul. Radzionkowska 71a
42-605 Tarnowskie Gory
Poland
## To build:
make all
```sh
make all
```
## To run:
./esde data-file word
```sh
./esde data-file word
```
where data-file contains lines of < 255 chars in length.
## Try:
./esde esde.data Johanson
./esde esde.data2 read
./esde README.md date
```sh
./esde esde.data Johanson
./esde esde.data2 read
./esde README.md date
```
## Judges' remarks:
@@ -32,19 +37,19 @@ If you still don't know what it does, try
[https://en.wikipedia.org/wiki/Soundex](https://en.wikipedia.org/wiki/Soundex).
## Author's remarks
## Author's remarks:
### what this program does:
### what this program does
This program searches in the file words which have the same Soundex code
like the given word, and print out lines with these words.
of the given word, and print out lines with those words.
The Soundex code is using to find similar sounds words.
The Soundex code is used to find similar sounding words.
Soundex code begins with the first letter of the word followed by a
three-digit code. There is the algorithm:
three-digit code. This is the algorithm:
0. Every letter in the word change by a digit (excluding the first letter).
0. Every letter in the word beyond the first letter is replaced by a digit.
1. Replace all pairs of the same code by single code (ex. R011235 -> R01235).
2. Remove all 0-codes (ex. R01235 -> R1235).
3. If length of code is > 4, get only first 4 codes (ex. R1235 -> R123).
+20 -15
View File
@@ -56,35 +56,40 @@ the source called [garry.fmt.c](garry.fmt.c).
## Author's remarks:
This program is a file filter, designed to do environment-expansion and
incorporating the ability to create binary from escaped data in the
incorporating the ability to create binary from escaped data in the
environment variables.
The calling syntax is pretty simple, just use it with stdio-redirection
The calling syntax is pretty simple, just use it with stdio-redirection
or inside pipelines, e.g.:
progname <file_to_convert >converted_file
```sh
./garry <file_to_convert >converted_file
```
or
cat all_my_files/* | progname | lp
```sh
cat all_my_files/* | ./garry | lp
```
The syntax of the conversion of the input file is as follows: To include
the value of an environment variable in the output file, place the name
of the variable between "$"-signs in the input, e.g.:
The syntax of the conversion of the input file is as follows: To include the
value of an environment variable in the output file, place the name of the
variable between "$"-signs in the input, e.g.:
My Home-Directory is: $HOME$
I'm using the path: $PATH$
Unknown Env-variables or malformed expressions are ignored and kept
intact.
Unknown Env-variables or malformed expressions are ignored and kept intact.
Additionally, the filter replaces escaped octal values in the
environment variables by their binary representation, e.g.:
Additionally, the filter replaces escaped octal values in the environment
variables by their binary representation, e.g.:
$ TEST="\110\145\154\154\157"
$ export TEST
$ echo '$TEST$' | progname
Hello
```sh
$ TEST="\110\145\154\154\157"
$ export TEST
$ echo '$TEST$' | ./garry
Hello
```
## Copyright and CC BY-SA 4.0 License:
+94 -54
View File
@@ -1,30 +1,37 @@
# Best Use of Obfuscation
Leonid A. Broukhis
46728 Crawford St., apt. 20
Fremont, CA 94539
USA
Leonid A. Broukhis
46728 Crawford St., apt. 20
Fremont, CA 94539
USA
## To build:
make all
```sh
make all
```
## To run:
./leo [ deep ] [ right ] [ Variable ] [ cycle [ freq ] ]
```sh
./leo [ deep ] [ right ] [ Variable ] [ cycle [ freq ] ]
```
See the author's information below on these details.
## Try:
./leo 1 | cat - /dev/tty | gs -
```sh
./leo 1 | cat - /dev/tty | gs -
./leo 37 80 | cat - /dev/tty | gs -
./leo 37 80 | cat - /dev/tty | gs -
```
If you don't have gs or an equivalent postscript viewer, try:
```sh
echo "" | ./leo 1 > foo.ps
```
and send foo.ps to your local postscript printer or open it in an appropriate
application (e.g. GIMP).
@@ -41,37 +48,39 @@ Some Ghostscripts/Postscript programs cleared the screen right after
the image is drawn, so we added element 106 which acts as an input
buffer.
To qualify for a category specially for yourself in the Geek code,
find out all the secret switches that the author doesn't divulge !
(All switches are single characters on the command line - anything that's
not a number is a candidate)
To qualify for a category specially for yourself in the Geek code, find out all
the secret switches that the author doesn't divulge ! (All switches are single
characters on the command line - anything that's not a number is a candidate.)
## Author's remarks:
The usage is:
./leo [ deep ] [ right ] [ Variable ] [ cycle [ freq ] ]
```sh
./leo [ deep ] [ right ] [ Variable ] [ cycle [ freq ] ]
```
where the first three are literal words, `cycle' is a positive
integer (0 is ignored), and `freq' is an integer (default = 0)
supposed to be in range 0..100 (bigger values are allowed, however).
Invalid parameters and options usually stop the command line
parsing (but not always, why?). The actual position of the word
options does not matter, so "prog.sh right Variable 1 70"
is equivalent to "prog.sh 0 0 0 1 Variable 70 right", etc.
where the first three are literal words, `cycle` is a positive integer (0 is
ignored), and `freq` is an integer (default = 0) that's supposed to be in the
range 0..100 (bigger values are allowed, however). Invalid parameters and
options usually stop the command line parsing (but not always, why?). The actual
position of the word options does not matter, so `./leo right Variable 1 70` is
equivalent to `./leo 0 0 0 1 Variable 70 right`, etc.
If `Variable' is used, `cycle' is almost ignored (see below) but has
to be present if you want to enter `freq' (and you usually do).
Some options to try (besides the obvious):
./leo 1 | cat - /dev/tty | gs -
```sh
./leo 1 | cat - /dev/tty | gs -
```
This draws the basic pattern I invented in high school:
You take a big sheet of "arithmetic" paper and draw a line
of length 1 (between 2 crossings) it the center of the sheet:
of length 1 (between 2 crossings) at the center of the sheet:
|
@@ -79,23 +88,31 @@ This makes 2 open ends (I think the notion of an "open end" doesn't
require explanations) in step 1. Now, until there are open ends in step N,
repeat: for each open end pretend it points north and draw 2 lines going
northwest and northeast from it to the nearest crossings. This needs to be
done "simultaneously" for all ends that are open at the moment.
done "simultaneously" for all ends that are open at that moment.
Step 2:
```
\./
|
/ \
```
Step 3:
```
__| |__
\./
|
__ / \ __
| |
```
Step 4:
```
.
\./ \./
\__| |__/
@@ -104,9 +121,11 @@ Step 4:
\__./ \.__/
/ | | \
/ \./ \
```
Step 5:
```
._| . |_.
__| \./ \./ |__
\__| |__/
@@ -117,18 +136,21 @@ Step 5:
|_./ \./ \._|
| |
The lines marked by I show the places where "simultaneity" is significant.
```
Note that so far all the drawings represent valid
structural formulas of some organic substances.
The lines marked by `I` show the places where "simultaneity" is significant.
Note that so far all the drawings represent valid structural formulas of some
organic substances.
step 1: ethane
step 2: 2,3-dimethylbutane
step 3: (2,5-dimethyl;3,4-isopropyl)-hexane
step 4 and 5: I don't know. Do you?
etc.
Step 6:
```
\./ \./ \./ \./
._| . |_. ._| . |_.
\__| \./ \./ |__/ \__| \./ \./ |__/
@@ -140,13 +162,16 @@ Step 6:
/ |_./ \./ \._| / |_./ \./ \._|
| | | |
/ \ / \ / \ / \
```
depending on the desired "hairiness". The original (paper-based)
algorithm was "hairy", but it didn't look as good on the screen.
The program cannot handle non-hairy mode 100% correctly - step 6 happens
to be
```
|__
...__/ ...__/
... \ ... \.
@@ -156,52 +181,66 @@ to be
...__/ ...__/
\ \.__
|
```
and so on: the horisontal symmetry has been lost. That's why
the opening for step 1 is not a single line but a cross:
```
\./
/ \
```
To watch it repeatedly (as a screen saver), use:
./leo 2 | cat - /dev/tty | gs -
To watch it repeatedly (as a screensaver), use:
```sh
./leo 2 | cat - /dev/tty | gs -
```
The command line:
./leo Variable 1 | cat - /dev/tty | gs -
```sh
./leo Variable 1 | cat - /dev/tty | gs -
```
This draws the same as above. Try:
./leo Variable 1 1 | cat - /dev/tty | gs -
draws the same as above. Try:
what happened to the picture? Increase `freq' and watch the changes.
```sh
./leo Variable 1 1 | cat - /dev/tty | gs -
```
If `cycle' is more than 1, the program loops, allowing the user to
enjoy randomly changing patterns (the delay is 3 sec),
but there is a secret switch to suppress looping : useful
What happened to the picture? Increase `freq` and watch the changes.
If `cycle` is more than 1, the program loops, allowing the user to
enjoy randomly changing patterns (the delay is 3 seconds),
but there is a secret switch to suppress looping: useful
if you want to pipe the output to a printer.
`uudecode` the spoiler below if you really want to know.
```
begin 664 spoiler1
M*%1H92!C;VQO;B J:7,J('1H92!S96-R970@<W=I=&-H("T@=&AE('-P86-E
=(&)E9F]R92!I="!I<R!N;W0@82!M:7-T86ME*0II
end
```
If `Variable' is used, the actual value of `cycle' doesn't matter,
If `Variable` is used, the actual value of `cycle` doesn't matter,
as far as it is > 1. To figure out what difference
`cycle' makes when `Variable' is not used, try
`cycle` makes when `Variable` is not used, try
./leo Variable 37 80 | cat - /dev/tty | gs -
```sh
./leo Variable 37 80 | cat - /dev/tty | gs -
```
and other values of `cycle'; smaller values usually require
smaller values of `freq' for the patterns to be non-trivial
and other values of `cycle`; smaller values usually require
smaller values of `freq` for the patterns to be non-trivial
The options `deep' and `right' make the patterns to be drawn in different
manners. Try all the examples above with `deep' and with `right'.
The options `deep` and `right` make the patterns to be drawn in different
manners. Try all the examples above with `deep` and with `right`.
What is the difference between them?
...There is a little flaw in the implementation of the algorithm,
@@ -212,12 +251,13 @@ otherwise it is hardly noticeable, if ever).
A quick and dirty fix (turned on by another secret switch)
makes the patterns symmetrical, but a little too HAIRY.
There is one more secret switch (it shall remain nameless), and I don't
There is one more secret switch (it shall also remain nameless), and I don't
even want to explain what it does. You've been warned!
* * *
```
* * *
```
Special thanks:
+13 -9
View File
@@ -1,25 +1,29 @@
# Best Short Program
Selene Makarios & Heather Downs
The Software Bungalow
900 High School Way, #2202
Mountain View, CA 94041
USA
Selene Makarios & Heather Downs
The Software Bungalow
900 High School Way, #2202
Mountain View, CA 94041
USA
## To build:
make all
```sh
make all
```
## To run:
./makarios
```sh
./makarios
```
## Judges' remarks
## Judges' remarks:
The judges were impressed that such a small program could do so much!
Can you figure out how it does it?
## Author's remarks
## Author's remarks:
This program takes no arguments. It emits the base 8 representation
of prime palindromes (palindromic in base 8, of course).
+18 -11
View File
@@ -1,23 +1,29 @@
# Most Obfuscated Syntax
Michael Savastio
Securicor Telesciences
925 1/2 Anchor St, Apt 2
Philadelphia, PA 19124
USA
Michael Savastio
Securicor Telesciences
925 1/2 Anchor St, Apt 2
Philadelphia, PA 19124
USA
## To build:
make all
```sh
make all
```
## To run:
./savastio
# enter a number such as 100
```sh
./savastio
# enter a number such as 100
```
## Try:
echo 42 | ./savastio
```sh
echo 42 | ./savastio
```
## Judges' remarks:
@@ -36,14 +42,15 @@ Aside from having an artistic code layout and confusing variable names,
the algorithm itself takes advantage of some cute C-isms. Try to
figure out how it prints the prompt "Enter number:".
Numbers are represented internally by a linked list of blocks each
Numbers are represented internally by a [linked
list](https://en.wikipedia.org/wiki/Linked_list) of blocks each
containing 1000 buckets of 4-digit integers. To further confuse
matters, the buckets are arranged backwards in the block. For example,
the number 8347108947139478934713847134 is represented as:
7134 1384 9347 3947 9471 7108 834
Platform limitations:
### Platform limitations
Long integers must be at least 4 bytes.
+14 -7
View File
@@ -5,23 +5,30 @@ ISX Corporation
3215-C Post Woods Dr.
Atlanta, GA 30339
USA
<http://computronium.org/ioccc.html>
<http://computronium.org/ioccc.html>
## To build:
make all
```sh
make all
```
## To run:
./schnitzi num
```sh
./schnitzi num
```
## Try:
./schnitzi 24
./schnitzi 18
./schnitzi 30
NOTE: as the author warns do not use too high a number! If you wish to ignore
```sh
./schnitzi 24
./schnitzi 18
./schnitzi 30
```
WARNING: the author warns to not use too high a number! If you wish to ignore
the warning it is an exercise to determine how high is too high. :-)
## Judges' remarks:
+15 -9
View File
@@ -1,27 +1,33 @@
# Abusing The Rules
Diomidis Spinellis
SENA S.A.
Kyprou 27
GR-152 37 Filothei
Greece
Diomidis Spinellis
SENA S.A.
Kyprou 27
GR-152 37 Filothei
Greece
<http://www.spinellis.gr>
## To build:
make all
```sh
make all
```
## To run:
./spinellis < spinellis.c
```sh
./spinellis < spinellis.c
```
## Judges' remarks
## Judges' remarks:
While the code does not abuse the rules, its output surely does!
P.S. Does the source have any spelling errors?
## Author's remarks
## Author's remarks:
96% of the program lines (631 out of the 658) are comment text rendering
the program readable and understandable. With the exception of the