for(signal=0;*k * x * __FILE__ *i;) do {to:
for(signal=0;*k *x * __FILE__ *i;) do {To see what we mean look at the original source file. The -alternate code is the version that has this modification. The +
To see what we mean look at the original source file. The +alternate code is the version that has this modification. The fixed version has instead:
for(signal=0;*k *= * __FILE__ *i;) do {In 2023 remarks were discovered from Sjoerd Mullender, one of the authors, and so was the program that was used by the authors to generate the array that he referred to. -Because a.out.h, which gentab.c uses, is not available in -all systems (like macOS) and more importantly because we wanted it to be as +Because a.out.h, which gentab.c uses, +is not available in all systems (like macOS) and more importantly because we wanted it to be as close to as the original as possible we used a copy of https://raw.githubusercontent.com/dspinellis/unix-history-repo/Research-Release/usr/include/a.out.h in the fabulous Unix History @@ -661,7 +661,7 @@ formats for each constant in the resulting array, and we wanted to choose the format randomly. So we wrote a program to choose an appropriate format at random. The program we wrote for that follows. This program actually also extracted the machine code from the object file.
-NOTE from judges: see gentab.c for a copy of this file that can be +
NOTE from judges: see gentab.c for a copy of this file that can be compiled in modern systems.
#include <stdio.h>
#include <a.out.h>
diff --git a/1986/marshall/README.md b/1986/marshall/README.md
index 54c90a0bb..59c064072 100644
--- a/1986/marshall/README.md
+++ b/1986/marshall/README.md
@@ -27,7 +27,7 @@ if nothing else.
Due to the different [conflicting problems](compilers.html) with gcc and clang, we
instead offer the problematic code as an alternate version whereas
-[marshall.c](marshall.c) has both the infinite loop and the complicated arg to
+[marshall.c](%%REPO_URL%%/1986/marshall/marshall.c) has both the infinite loop and the complicated arg to
`_exit()` commented out, changing the value passed into `_exit()` to `1`.
diff --git a/1986/marshall/index.html b/1986/marshall/index.html
index 54508cdb3..26504ebfa 100644
--- a/1986/marshall/index.html
+++ b/1986/marshall/index.html
@@ -393,7 +393,7 @@ if nothing else.
Alternate code:
Due to the different conflicting problems with gcc and clang, we
instead offer the problematic code as an alternate version whereas
-marshall.c has both the infinite loop and the complicated arg to
+marshall.c has both the infinite loop and the complicated arg to
_exit() commented out, changing the value passed into _exit() to 1.
Alternate build:
To see if your compiler has the problems noted:
diff --git a/1989/README.md b/1989/README.md
index e47e450be..2e3c8d3a3 100644
--- a/1989/README.md
+++ b/1989/README.md
@@ -8,15 +8,15 @@ You may then wish to look at the Author's remarks for even more details.
Instructions for use: Run `make` to compile entries (it is possible that on
System V or non-Unix systems the Makefile needs to be changed).
-The Makefile for ["Best self modifying program"](fubar/indx.html) always uses
+The Makefile for ["Best self modifying program"](fubar/index.html) always uses
the most portable version because there is no loss of functionality in
-using it. In the case of the ["Best game"](tromp/README) entry, however, some
+using it. In the case of the ["Best game"](tromp/index.html) entry, however, some
functionality is lost in the portable version and so its Makefile uses
the original program.
This year, the [Best of Show](jar.2/index.html) was given to the most useful program.
-The ["Strangest abuse of the rules"](jar.1/indx.html) award was given this year
+The ["Strangest abuse of the rules"](jar.1/index.html) award was given this year
to stress the fact that starting in 1990, compiling entries must result a
regular executable file.
diff --git a/1989/index.html b/1989/index.html
index 1939dafb8..6fb30593f 100644
--- a/1989/index.html
+++ b/1989/index.html
@@ -369,13 +369,13 @@ Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author’s remarks for even more details.
Instructions for use: Run make to compile entries (it is possible that on
System V or non-Unix systems the Makefile needs to be changed).
-The Makefile for “Best self modifying program” always uses
+
The Makefile for “Best self modifying program” always uses
the most portable version because there is no loss of functionality in
-using it. In the case of the “Best game” entry, however, some
+using it. In the case of the “Best game” entry, however, some
functionality is lost in the portable version and so its Makefile uses
the original program.
This year, the Best of Show was given to the most useful program.
-The “Strangest abuse of the rules” award was given this year
+
The “Strangest abuse of the rules” award was given this year
to stress the fact that starting in 1990, compiling entries must result a
regular executable file.
Rules and results were posted to
diff --git a/1990/tbr/README.md b/1990/tbr/README.md
index 9252af293..9a0a3c377 100644
--- a/1990/tbr/README.md
+++ b/1990/tbr/README.md
@@ -92,7 +92,7 @@ of the program which we include below:
e(x){x<0?write(2,"?\n$ "-x/4,2),x+1||(exit(1),0):5;}
```
-and in the [alternate source](tbr.alt.c). It has the `exit()` returns `void` fix
+and in the [alternate source](%%REPO_URL%%/1990/tbr/tbr.alt.c). It has the `exit()` returns `void` fix
as well as the `gets()` to `fgets()` fix applied to it to make it functionally
equivalent like the authors intended.
diff --git a/1990/tbr/index.html b/1990/tbr/index.html
index 31cfd724a..26f9a5d31 100644
--- a/1990/tbr/index.html
+++ b/1990/tbr/index.html
@@ -436,7 +436,7 @@ of the program which we include below:
0),e(open(*i,0)):5,t?dup2(t,1)D t):i[2]?9 D
1),e(creat(i[2],438)):2,e(execvp(*u,u))):e(chdir(u[1])*2):6;}
e(x){x<0?write(2,"?\n$ "-x/4,2),x+1||(exit(1),0):5;}and in the alternate source. It has the exit() returns void fix
+
and in the alternate source. It has the exit() returns void fix
as well as the gets() to fgets() fix applied to it to make it functionally
equivalent like the authors intended.
The shell script determines when the game is over, and automatically replaces
-merlyn.c (copied from westley.c with an improved version after a
+merlyn.c (copied from westley.c with an improved version after a
loss). The ttt script has two other modes:
./ttt quitgame # cancel any game in progress, revert to merlyn.c
./ttt clobber # remove all game files, revert to original sourceThe albert.alt.c file is the fixed file, whereas the -albert.c is the file before applying Leo Broukhis’ fix.
+albert.c is the file before applying Leo Broukhis’ fix.To compile this alternate version:
make altwhere /usr/share/dict/words is the dictionary file.
Then it uses the mkdict.sh script to create a dictionary file out -of the files README.md, try.sh (itself) and +of the files index.html, try.sh (itself) and Makefile and it repeats the same commands as above. In the case no dictionary file can be found in the first step it only runs the commands once with the created dictionary file.
diff --git a/1992/kivinen/README.md b/1992/kivinen/README.md index 1a3b0674f..a482642b0 100644 --- a/1992/kivinen/README.md +++ b/1992/kivinen/README.md @@ -77,7 +77,7 @@ you have with the program. :-) NOTE: Some systems do not need (or have) `-lsocket -lresolv -lnsl`. Such systems should compile using `-lX11`. -NOTE: The original winning source [kivinen.orig.c](kivinen.orig.c) assumed that +NOTE: The original winning source [kivinen.orig.c](%%REPO_URL%%/1992/kivinen/kivinen.orig.c) assumed that `exit(3)` returned a value which cause problems for some systems where `exit(3)` returns `void`. The file [kivinen.c](%%REPO_URL%%/1992/kivinen/kivinen.c) avoids this problem. diff --git a/1992/kivinen/index.html b/1992/kivinen/index.html index 5e0644849..aa149cc4e 100644 --- a/1992/kivinen/index.html +++ b/1992/kivinen/index.html @@ -414,7 +414,7 @@ code. you have with the program. :-)NOTE: Some systems do not need (or have) -lsocket -lresolv -lnsl.
Such systems should compile using -lX11.
NOTE: The original winning source kivinen.orig.c assumed that +
NOTE: The original winning source kivinen.orig.c assumed that
exit(3) returned a value which cause problems for some systems where exit(3) returns
void. The file kivinen.c avoids this problem.
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, found in +
NOTE: The original winning source 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 avoids this problem.
and
refresh(),c=select(k,&y,0,0,(v.tv_usec=1<<17,&v))?getch():0;to another value like 18 or 19 which you can do with the alternate code.
-In the case of rince.alt2.c the movement keys for the default +
In the case of rince.alt2.c the movement keys for the default
game are slightly different and will feel more familiar to vi users: h for
left, l for right (that was not changed) and k for fire (that was also not
changed).
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, when dodsond2.gz is uncompressed, it is identical -to the dodsond2.c file you find today.
+Indeed the dodsond2.c file is +what you find today.
The IOCCC rules and guidelines were modified in an effort to address this fun “abuse of the rules” style hack.
It is worth noting that without this compression “abuse of the rules” diff --git a/1994/shapiro/README.md b/1994/shapiro/README.md index 0dff6ad5c..4ee67bbd4 100644 --- a/1994/shapiro/README.md +++ b/1994/shapiro/README.md @@ -51,7 +51,7 @@ source file is self documenting. :-) From time to time, run `ps(1)` and look at the new processes. See [shapiro.html](shapiro.html) for more information in the internals of this program. -The file [shapiro.alt.c](shapiro.alt.c) contains a non-obfuscated version of +The file [shapiro.alt.c](%%REPO_URL%%/1994/shapiro/shapiro.alt.c) contains a non-obfuscated version of this program. Note that this alt file is currently missing. See [1994 shapiro bugs](../../bugs.html#1994_shapiro) for details. @@ -67,18 +67,18 @@ The basic theme (pun) of this program is: ``` -My entry ([shapiro.c](shapiro.c)) is mostly comments, formatted in the shape of a +My entry ([shapiro.c](%%REPO_URL%%/1994/shapiro/shapiro.c)) is mostly comments, formatted in the shape of a clock. If you strip out the comments and look at the code you will quickly realize that the comments were the important part and that the code does very little (see pun above). It writes (to `stdout`) -another C program ([shapiro_t2.c](shapiro_t2.c)). This is the first level of +another C program ([shapiro_t2.c](%%REPO_URL%%/1994/shapiro/shapiro_t2.c)). This is the first level of obfuscation. -The second program ([shapiro_t2.c](shapiro_t2.c) (use `make everything` first) +The second program ([shapiro_t2.c](%%REPO_URL%%/1994/shapiro/shapiro_t2.c) (use `make everything` first) prints a clock in the upper right hand corner of your VTxxx/ANSI display. Most of the surface obfuscation in the second program -([shapiro_t2.c](shapiro_t2.c)) was an attempt to make it as small as possible. +([shapiro_t2.c](%%REPO_URL%%/1994/shapiro/shapiro_t2.c)) was an attempt to make it as small as possible. You should be able to see around this with `cb(1)` and some more intelligent variable names. Once you get past this you will realize that the third level of obfuscation is a six member client/server hierarchy. (See the diff --git a/1994/shapiro/index.html b/1994/shapiro/index.html index 7e4542b13..6306263e0 100644 --- a/1994/shapiro/index.html +++ b/1994/shapiro/index.html @@ -403,23 +403,23 @@ bring it back to the foreground.
source file is self documenting. :-)From time to time, run ps(1) and look at the new processes.
See shapiro.html for more information in the internals of this program. -The file shapiro.alt.c contains a non-obfuscated version of +The file shapiro.alt.c contains a non-obfuscated version of this program. Note that this alt file is currently missing. See 1994 shapiro bugs for details.
The basic theme (pun) of this program is:
"This time (everything) is not where it should be."
~~~~My entry (shapiro.c) is mostly comments, formatted in the shape of a +
My entry (shapiro.c) is mostly comments, formatted in the shape of a
clock. If you strip out the comments and look at the code you will
quickly realize that the comments were the important part and that
the code does very little (see pun above). It writes (to stdout)
-another C program (shapiro_t2.c). This is the first level of
+another C program (shapiro_t2.c). This is the first level of
obfuscation.
The second program (shapiro_t2.c (use make everything first)
+
The second program (shapiro_t2.c (use make everything first)
prints a clock in the upper right hand corner of your VTxxx/ANSI display.
Most of the surface obfuscation in the second program
-(shapiro_t2.c) was an attempt to make it as small as possible.
+(shapiro_t2.c) was an attempt to make it as small as possible.
You should be able to see around this with cb(1) and some more intelligent
variable names. Once you get past this you will realize that the third level of
obfuscation is a six member client/server hierarchy. (See the
diff --git a/1994/weisberg/README.md b/1994/weisberg/README.md
index 447b73368..8a70f5a24 100644
--- a/1994/weisberg/README.md
+++ b/1994/weisberg/README.md
@@ -77,7 +77,7 @@ event of a system shutdown or reboot.
### Bugs
-The alternative version ([weisberg.alt.c](weisberg.alt.c)) has never actually run
+The alternative version ([weisberg.alt.c](%%REPO_URL%%/1994/weisberg/weisberg.alt.c)) has never actually run
to completion. After running for close to a week it had reached somewhere around
250e6, when it became necessary to test the reboot feature (which worked
remarkably well). As there are quite a lot of primes to be found before reaching
diff --git a/1994/weisberg/index.html b/1994/weisberg/index.html
index a81a1d526..84bad6850 100644
--- a/1994/weisberg/index.html
+++ b/1994/weisberg/index.html
@@ -413,7 +413,7 @@ run to completion, so as an added feature, it will cease execution upon
reception of a signal (any will do equally well), as well as in the
event of a system shutdown or reboot.
The alternative version (weisberg.alt.c) has never actually run +
The alternative version (weisberg.alt.c) has never actually run
to completion. After running for close to a week it had reached somewhere around
250e6, when it became necessary to test the reboot feature (which worked
remarkably well). As there are quite a lot of primes to be found before reaching
diff --git a/1994/westley/README.md b/1994/westley/README.md
index 981fc43d1..466df2032 100644
--- a/1994/westley/README.md
+++ b/1994/westley/README.md
@@ -85,7 +85,7 @@ compiler line you will get a different message (**as compiler errors** due to
_This is independent of the previous (if there are any previous) compiler
invocations_ specified. That means with the right compiler invocation you can
-'win' the game on the first go. But unlike the [alternate code](westley.alt.c),
+'win' the game on the first go. But unlike the [alternate code](%%REPO_URL%%/1994/westley/westley.alt.c),
you do not run this program as it will not compile: instead it will be compiler
error messages; there is no running the program.
diff --git a/1994/westley/index.html b/1994/westley/index.html
index 20ae198f2..7a4f3f1aa 100644
--- a/1994/westley/index.html
+++ b/1994/westley/index.html
@@ -427,7 +427,7 @@ compiler line you will get a different message (as compiler errors
This is independent of the previous (if there are any previous) compiler
invocations specified. That means with the right compiler invocation you can
-‘win’ the game on the first go. But unlike the alternate code,
+‘win’ the game on the first go. But unlike the alternate code,
you do not run this program as it will not compile: instead it will be compiler
error messages; there is no running the program.Original try:
diff --git a/1996/august/README.md b/1996/august/README.md
index e936ff85e..b31e9bc5d 100644
--- a/1996/august/README.md
+++ b/1996/august/README.md
@@ -104,7 +104,7 @@ of operators, and control constructs.
The compiler has absolutely no error checking, so things
can go wrong. But this is what seasoned C programmers are used to.
-Assume that the interpreter has been compiled (source in [august.c](august.c)
+Assume that the interpreter has been compiled (source in [august.c](%%REPO_URL%%/1996/august/august.c)
and binary in august) and that we have this in a file named `test.oc`:
```
diff --git a/1996/august/index.html b/1996/august/index.html
index df54f4954..b25f1c093 100644
--- a/1996/august/index.html
+++ b/1996/august/index.html
@@ -429,7 +429,7 @@ syntax). Arrays can only be global. There is a rather limited set
of operators, and control constructs.
The compiler has absolutely no error checking, so things can go wrong. But this is what seasoned C programmers are used to.
-Assume that the interpreter has been compiled (source in august.c +
Assume that the interpreter has been compiled (source in august.c
and binary in august) and that we have this in a file named test.oc:
main() { putchar('!'); putchar('\n'); exit(0); }We can then compile by
diff --git a/1996/schweikh2/README.md b/1996/schweikh2/README.md index c226c8291..bf4d88267 100644 --- a/1996/schweikh2/README.md +++ b/1996/schweikh2/README.md @@ -48,7 +48,7 @@ make it easier to see what is happening. ## Judges' remarks: The original program, with only slight obfuscations, may be found -in [hunni.c](%%REPO_URL%%/1996/schweikh2/hunni.c). The perl script, [hunni.pl](hunni.pl), obfuscates it +in [hunni.c](%%REPO_URL%%/1996/schweikh2/hunni.c). The perl script, [hunni.pl](%%REPO_URL%%/1996/schweikh2/hunni.pl), obfuscates it appropriately. Try: ``` diff --git a/1996/schweikh2/index.html b/1996/schweikh2/index.html index a7676f88e..8d515d777 100644 --- a/1996/schweikh2/index.html +++ b/1996/schweikh2/index.html @@ -399,7 +399,7 @@ ctrl-c to stop it. Observe how the Judges’ remarks:The original program, with only slight obfuscations, may be found -in hunni.c. The perl script, hunni.pl, obfuscates it +in hunni.c. The perl script, hunni.pl, obfuscates it appropriately. Try:
less hunni.c
diff --git a/1996/schweikh3/README.md b/1996/schweikh3/README.md
index 930c1b921..94b0239ba 100644
--- a/1996/schweikh3/README.md
+++ b/1996/schweikh3/README.md
@@ -131,7 +131,7 @@ situation and effectively halts.
I had the pleasure and pain to find all three behaviours on the
platforms I use regularly.
-The file [schweikh3.info](schweikh3.info) has output for
+The file [schweikh3.info](%%REPO_URL%%/1996/schweikh3/schweikh3.info) has output for
Solaris, FreeBSD and Linux. The Linux case is interesting in that
the behaviour changes when `calloc(3)` is used instead of `malloc(3)`.
For FreeBSD, the last two lines are not messages stemming from
diff --git a/1996/schweikh3/index.html b/1996/schweikh3/index.html
index 485ea76b2..ebd59b00e 100644
--- a/1996/schweikh3/index.html
+++ b/1996/schweikh3/index.html
@@ -463,7 +463,7 @@ situation and effectively halts.
I had the pleasure and pain to find all three behaviours on the
platforms I use regularly.
-The file schweikh3.info has output for
+
The file schweikh3.info has output for
Solaris, FreeBSD and Linux. The Linux case is interesting in that
the behaviour changes when calloc(3) is used instead of malloc(3).
For FreeBSD, the last two lines are not messages stemming from
diff --git a/1996/westley/README.md b/1996/westley/README.md
index 28d24dabe..476a44a6a 100644
--- a/1996/westley/README.md
+++ b/1996/westley/README.md
@@ -60,8 +60,8 @@ This 1-line program allows various analog ASCII clocks to print out the time;
the ASCII clock is built from the command line arguments, so many different
types of clocks can be generated. Three different scripts are supplied to print
out a grandfather clock, a mantle clock that runs backwards, and a linear-style
-clock. (they are [clock1.sh](clock1.sh), [clock2.sh](clock2.sh), and
-[clock3.sh](clock3.sh))
+clock. (they are [clock1.sh](%%REPO_URL%%/1996/westley/clock1.sh), [clock2.sh](%%REPO_URL%%/1996/westley/clock2.sh), and
+[clock3.sh](%%REPO_URL%%/1996/westley/clock3.sh))
The program makes the following (possibly non-portable) assumptions:
diff --git a/1996/westley/index.html b/1996/westley/index.html
index c37f68bd0..5f3da1911 100644
--- a/1996/westley/index.html
+++ b/1996/westley/index.html
@@ -406,8 +406,8 @@ understand it.
the ASCII clock is built from the command line arguments, so many different
types of clocks can be generated. Three different scripts are supplied to print
out a grandfather clock, a mantle clock that runs backwards, and a linear-style
-clock. (they are clock1.sh, clock2.sh, and
-clock3.sh)
+clock. (they are clock1.sh, clock2.sh, and
+clock3.sh)
The program makes the following (possibly non-portable) assumptions:
Command line strings can be written to.
-
Simple obstacle course. Try to fly over the buildings and under the
bridges.
--
+
-
Fly over the tombs of the ancient Pharaohs, in this (fictitious) Egyptian
landscape.
-
diff --git a/1998/fanf/README.md b/1998/fanf/README.md
index 5c08f365e..0e62ccbde 100644
--- a/1998/fanf/README.md
+++ b/1998/fanf/README.md
@@ -28,7 +28,7 @@ Enter an expression on standard input. To try some we have selected:
### Historical aside:
-At a time the code in [fanf.c](%%REPO_URL%%/1998/fanf/fanf.c) was that of [fanf.orig.c](fanf.orig.c)
+At a time the code in [fanf.c](%%REPO_URL%%/1998/fanf/fanf.c) was that of [fanf.orig.c](%%REPO_URL%%/1998/fanf/fanf.orig.c)
but to get this to compile in modern systems it had to be translated to what you
now see. The intermediate steps can still be performed but they might be
different from the past. This should be kept in mind as you read the below
diff --git a/1998/fanf/index.html b/1998/fanf/index.html
index 9399ee304..a416d0bb0 100644
--- a/1998/fanf/index.html
+++ b/1998/fanf/index.html
@@ -388,7 +388,7 @@ this entry because of the system resources it requires.
./try.sh
Judges’ remarks:
Historical aside:
-At a time the code in fanf.c was that of fanf.orig.c
+
At a time the code in fanf.c was that of fanf.orig.c
but to get this to compile in modern systems it had to be translated to what you
now see. The intermediate steps can still be performed but they might be
different from the past. This should be kept in mind as you read the below
diff --git a/1998/schnitzi/README.md b/1998/schnitzi/README.md
index cbec70cfd..d7fc68330 100644
--- a/1998/schnitzi/README.md
+++ b/1998/schnitzi/README.md
@@ -78,7 +78,7 @@ the letter `e`.
The IOCCC has been no stranger to this concept. Several winning entries from
years past have accomplished interesting feats while completely avoiding the use
of certain C constructs thought to be essential (e.g.
-[1988/robison.c](../../1988/robison/robison.c)). If you have to ask why they would
+[1988/robison.c](%%REPO_URL%%/1988/robison/robison.c)). If you have to ask why they would
do it this way, then this contest just isn't for you.
In continuing with this fine tradition, this program suggests to the ANSI
diff --git a/1998/schnitzi/index.html b/1998/schnitzi/index.html
index 957578ffc..e86873ac8 100644
--- a/1998/schnitzi/index.html
+++ b/1998/schnitzi/index.html
@@ -422,7 +422,7 @@ the letter e.
The IOCCC has been no stranger to this concept. Several winning entries from
years past have accomplished interesting feats while completely avoiding the use
of certain C constructs thought to be essential (e.g.
-1988/robison.c). If you have to ask why they would
+1988/robison.c). If you have to ask why they would
do it this way, then this contest just isn’t for you.
In continuing with this fine tradition, this program suggests to the ANSI
committee some new practical simplifications for the C language. For instance,
diff --git a/1998/schweikh1/README.md b/1998/schweikh1/README.md
index c7729e283..e6b90de6e 100644
--- a/1998/schweikh1/README.md
+++ b/1998/schweikh1/README.md
@@ -247,7 +247,7 @@ printer when you make a hard copy of the source...
While I'm at it, the rules state that only space, tab and newline
are ignored for the count (plus '`{`', '`}`', '`;`' followed by
-whitespace). The [mkentry.c](../mkentry.c) program, however, uses `isspace(3)` which
+whitespace). The [mkentry.c](%%REPO_URL%%/1998/mkentry.c) program, however, uses `isspace(3)` which
returns nonzero for `\v` and `\f` and other characters as well.
I could have used a lot more `^K` and `^L` probably undetected by your
counter but decided to err on the side of safety. I use a perl
diff --git a/1998/schweikh1/index.html b/1998/schweikh1/index.html
index 85e81b98e..ed2722cca 100644
--- a/1998/schweikh1/index.html
+++ b/1998/schweikh1/index.html
@@ -546,7 +546,7 @@ something new – after 14 years of IOCCC. Be sure to have enough paper in your
printer when you make a hard copy of the source…
While I’m at it, the rules state that only space, tab and newline
are ignored for the count (plus ‘{’, ‘}’, ‘;’ followed by
-whitespace). The mkentry.c program, however, uses isspace(3) which
+whitespace). The mkentry.c program, however, uses isspace(3) which
returns nonzero for \v and \f and other characters as well.
I could have used a lot more ^K and ^L probably undetected by your
counter but decided to err on the side of safety. I use a perl
diff --git a/2000/README.md b/2000/README.md
index 94895be1e..e9b7e9206 100644
--- a/2000/README.md
+++ b/2000/README.md
@@ -45,7 +45,7 @@ them for the next IOCCC.
We believe you will be impressed with this year's winning entries. The [Best of
Show](jarijyrki/index.html) is a fine example of compact obfuscation. But don't
ignore the shorter entries. The [Best Small Program](natori/index.html), [Best
-Abuse of User](briddlebane/README.m) and [Most Complete Program](tomx/index.html)
+Abuse of User](briddlebane/index.html) and [Most Complete Program](tomx/index.html)
are well worth studying in detail.
The [Worst Abuse of the Rules](dlowe/index.html) is technically allowed by the
diff --git a/2000/bmeyer/README.md b/2000/bmeyer/README.md
index 7e13881b7..146a5775d 100644
--- a/2000/bmeyer/README.md
+++ b/2000/bmeyer/README.md
@@ -324,7 +324,7 @@ en/decoded[^4].
### Photo Credit:
[Lavabus](%%REPO_URL%%/2000/bmeyer/lavabus.pgm) was taken by the judge, Landon Curt Noll.
-[Michael](%%REPO_URL%%/2000/bmeyer/michael.pgm) was provided by the author. [Lenna](lenna.glic) is a
+[Michael](%%REPO_URL%%/2000/bmeyer/michael.pgm) was provided by the author. [Lenna](%%REPO_URL%%/2000/bmeyer/lenna.glic) is a
1972 Playboy centerfold (doesn't show very much).
- [michael.pgm](%%REPO_URL%%/2000/bmeyer/michael.pgm)
diff --git a/2000/bmeyer/index.html b/2000/bmeyer/index.html
index bfc846303..8ea6eb668 100644
--- a/2000/bmeyer/index.html
+++ b/2000/bmeyer/index.html
@@ -584,7 +584,7 @@ interval halving repeated until the precise value has been
en/decoded5.
Photo Credit:
Lavabus was taken by the judge, Landon Curt Noll.
-Michael was provided by the author. Lenna is a
+Michael was provided by the author. Lenna is a
1972 Playboy centerfold (doesn’t show very much).
-
diff --git a/2000/index.html b/2000/index.html
index 7b9733c0b..47f585126 100644
--- a/2000/index.html
+++ b/2000/index.html
@@ -394,7 +394,7 @@ that was not supplied with the entry.
them for the next IOCCC.
We believe you will be impressed with this year’s winning entries. The Best of
Show is a fine example of compact obfuscation. But don’t
-ignore the shorter entries. The Best Small Program, Best
+ignore the shorter entries. The Best Small Program, Best
Abuse of User and Most Complete Program
are well worth studying in detail.
The Worst Abuse of the Rules is technically allowed by the
diff --git a/2000/rince/README.md b/2000/rince/README.md
index 935575c1d..1c2f655d0 100644
--- a/2000/rince/README.md
+++ b/2000/rince/README.md
@@ -81,7 +81,7 @@ Julian day number (given as a fractional component). E.g.:
A Julian day is defined to be the number of days since January 1st in the year
`-4712 (4713BC)`, starting at 12 noon GMT.[^1][^2] To aid conversion from our time
(GMT) to Julian day there is a supplementary program named:
-[dmy2jd.c](dmy2jd.c). Run it with `day_float month year` as arguments. See below
+[dmy2jd.c](%%REPO_URL%%/2000/rince/dmy2jd.c). Run it with `day_float month year` as arguments. See below
for an example.
diff --git a/2000/rince/index.html b/2000/rince/index.html
index a224714ea..6e9ac3cc1 100644
--- a/2000/rince/index.html
+++ b/2000/rince/index.html
@@ -417,7 +417,7 @@ Julian day number (given as a fractional component). E.g.:
A Julian day is defined to be the number of days since January 1st in the year
-4712 (4713BC), starting at 12 noon GMT.12 To aid conversion from our time
(GMT) to Julian day there is a supplementary program named:
-dmy2jd.c. Run it with day_float month year as arguments. See below
+dmy2jd.c. Run it with day_float month year as arguments. See below
for an example.
What it does
This program plots the positions of the four Galilean
diff --git a/2000/schneiderwent/README.md b/2000/schneiderwent/README.md
index a6a9c00f7..fb86bec16 100644
--- a/2000/schneiderwent/README.md
+++ b/2000/schneiderwent/README.md
@@ -61,7 +61,7 @@ FWIW, none of the compilers with which this entry was tested issued
any warnings or errors in compiling the source for this entry. No
doubt lint will complain about the goto statements.
-The [schneiderwent.data](schneiderwent.data) file consists of the values used by
+The [schneiderwent.data](%%REPO_URL%%/2000/schneiderwent/schneiderwent.data) file consists of the values used by
multiple table lookups. This is simply good program design, separating these
values from the source code allows changing the behavior of the application
without recompiling.
diff --git a/2000/schneiderwent/index.html b/2000/schneiderwent/index.html
index 5b081e0bb..e390451fc 100644
--- a/2000/schneiderwent/index.html
+++ b/2000/schneiderwent/index.html
@@ -406,7 +406,7 @@ keeping the program portable between different encodings
FWIW, none of the compilers with which this entry was tested issued
any warnings or errors in compiling the source for this entry. No
doubt lint will complain about the goto statements.
-The schneiderwent.data file consists of the values used by
+
The schneiderwent.data file consists of the values used by
multiple table lookups. This is simply good program design, separating these
values from the source code allows changing the behavior of the application
without recompiling.
diff --git a/2000/tomx/README.md b/2000/tomx/README.md
index d39e369fd..872800c5e 100644
--- a/2000/tomx/README.md
+++ b/2000/tomx/README.md
@@ -4,7 +4,7 @@
make
```
-There is an alternate version that compiles [mkentry.c](mkentry.c). See
+There is an alternate version that compiles [mkentry.c](%%REPO_URL%%/2000/mkentry.c). See
[alternate code](#alternate-code).
diff --git a/2000/tomx/index.html b/2000/tomx/index.html
index 6b9d47dd2..d820463ca 100644
--- a/2000/tomx/index.html
+++ b/2000/tomx/index.html
@@ -379,7 +379,7 @@ Location: NL - Kingdom of the Netherlan
To build:
make
-There is an alternate version that compiles mkentry.c. See
+
There is an alternate version that compiles mkentry.c. See
alternate code.
To use:
./tomx
diff --git a/2001/anonymous/README.md b/2001/anonymous/README.md
index 8b77adac2..b653e2df5 100644
--- a/2001/anonymous/README.md
+++ b/2001/anonymous/README.md
@@ -41,7 +41,7 @@ For more detailed information see [2001 anonymous bugs](../../bugs.html#2001_ano
```
NOTE: if the 32-bit version cannot be compiled the script will at least compile
-[anonymous.ten](anonymous.ten.c) as a 64-bit program (or whatever your system is
+[anonymous.ten](%%REPO_URL%%/2001/anonymous/anonymous.ten.c) as a 64-bit program (or whatever your system is
set to) and run it directly.
What happens if the x86 program has already been modified by this program? The
@@ -105,7 +105,7 @@ run x86 programs on any machine (x86 or otherwise).
I have included a simple [10 Green
Bottles](https://www.bbc.co.uk/teach/school-radio/nursery-rhymes-ten-green-bottles/zncyt39)
-[program](anonymous.ten.c) (try `make anonymous.ten`), meant to be compiled as a
+[program](%%REPO_URL%%/2001/anonymous/anonymous.ten.c) (try `make anonymous.ten`), meant to be compiled as a
32-bit ELF binary.
The program `anonymous.ten`, and its source (dull) are included as data
@@ -129,7 +129,7 @@ generates a translation for an entire basic block of subject code. Having
translated a block once, the target code generated will be stored for the
duration that the program is running, so as a program runs its performance will
improve, as it hits cached blocks. This can be clearly observed in the example
-program, [anonymous.ten](anonymous.ten.c) which must be compiled as a 32-bit ELF
+program, [anonymous.ten](%%REPO_URL%%/2001/anonymous/anonymous.ten.c) which must be compiled as a 32-bit ELF
binary.
### Target Library Linking:
@@ -221,7 +221,7 @@ Despite all this, the translator is not exclusively limited to running the
[anonymous.ten](%%REPO_URL%%/2001/anonymous/anonymous.ten.c) program. Other trivial **_x86_** programs may
run on the translator \- and I have successfully run a wide range of "Hello
World" programs, including one of last year's IOCCC entries,
-[tomx](2001/anonymous/2000/tomx/tomx.c).
+[tomx](%%REPO_URL%%/2000/tomx/index.html).
### Complete Program
diff --git a/2001/anonymous/index.html b/2001/anonymous/index.html
index 94f75f30e..8863a5fe7 100644
--- a/2001/anonymous/index.html
+++ b/2001/anonymous/index.html
@@ -398,7 +398,7 @@ whatever your system will compile them as).
./anonymous anonymous.bed # if able to compile as a 32-bit (-m32) ELF binary
NOTE: if the 32-bit version cannot be compiled the script will at least compile -anonymous.ten as a 64-bit program (or whatever your system is +anonymous.ten as a 64-bit program (or whatever your system is set to) and run it directly.
What happens if the x86 program has already been modified by this program? The judges’ remarks below might give you a hint!
@@ -436,7 +436,7 @@ quite a lot of bit twiddling. run x86 programs on any machine (x86 or otherwise).I have included a simple 10 Green
Bottles
-program (try make anonymous.ten), meant to be compiled as a
+program (try make anonymous.ten), meant to be compiled as a
32-bit ELF binary.
The program anonymous.ten, and its source (dull) are included as data
files.
The program runs dynamically @@ -523,7 +523,7 @@ turn up - yes the program is unsafe, but it’s pretty cool anyway.
anonymous.ten program. Other trivial x86 programs may run on the translator - and I have successfully run a wide range of “Hello World” programs, including one of last year’s IOCCC entries, -tomx. +tomx.The fact that the program makes calls to system(3) and execv(3) may imply that
it is not a complete program in its own right, as it relies on other programs.
diff --git a/2001/bellard/README.md b/2001/bellard/README.md
index bee0b9db5..f159d7c57 100644
--- a/2001/bellard/README.md
+++ b/2001/bellard/README.md
@@ -82,7 +82,10 @@ put `#!/usr/local/bin/otcc` at the beginning of your C source if
you installed `otcc` at this place.
-### Supported C language subset (read joint example [bellard.otccex.c](bellard.otccex.c) to have an introduction to `OTCC` dialect)
+### Supported C language subset
+
+
+Read joint example [bellard.otccex.c](%%REPO_URL%%/2001/bellard/bellard.otccex.c) to have an introduction to `OTCC` dialect.
#### Expressions:
diff --git a/2001/bellard/index.html b/2001/bellard/index.html
index d92172b16..57d9ce546 100644
--- a/2001/bellard/index.html
+++ b/2001/bellard/index.html
@@ -418,7 +418,8 @@ program.
An alternate syntax is to use it as a script interpreter: you can
put #!/usr/local/bin/otcc at the beginning of your C source if
you installed otcc at this place.
OTCC dialect)Read joint example bellard.otccex.c to have an introduction to OTCC dialect.
binary operators, in decreasing precedence order: * / %,
diff --git a/2004/README.md b/2004/README.md
index c2b2f38ca..e6a6c3e62 100644
--- a/2004/README.md
+++ b/2004/README.md
@@ -26,11 +26,11 @@ local compiler.
## Remarks on some of the entries
We believe you will be impressed with this year's winning entries. The [Best of
-Show](gavin/gavin.c) is a fine example of obfuscation. But don't ignore the
+Show](%%REPO_URL%%/2004/gavin/gavin.c) is a fine example of obfuscation. But don't ignore the
other entries! There are games, utilities, programs that output images and a
one-liner that is incredibly compact for what it can do.
-The [Best Abuse of the Guidelines](hibachi/hibachi.c) is technically allowed by
+The [Best Abuse of the Guidelines](%%REPO_URL%%/2004/hibachi/hibachi.c) is technically allowed by
the rules. This year we allowed it due to the functionality of the program.
This entry is one of the easiest to read! Don't assume you can win using
similar techniques next time ... :-)
diff --git a/2004/index.html b/2004/index.html
index 6348628f0..8494b3bc8 100644
--- a/2004/index.html
+++ b/2004/index.html
@@ -379,11 +379,11 @@ require certain changes (add or remove a library, add or remove a
yours is lacking, you may need to compile using gcc instead of your
local compiler.
We believe you will be impressed with this year’s winning entries. The Best of
+ We believe you will be impressed with this year’s winning entries. The Best of
Show is a fine example of obfuscation. But don’t ignore the
other entries! There are games, utilities, programs that output images and a
one-liner that is incredibly compact for what it can do. The Best Abuse of the Guidelines is technically allowed by
+ The Best Abuse of the Guidelines is technically allowed by
the rules. This year we allowed it due to the functionality of the program.
This entry is one of the easiest to read! Don’t assume you can win using
similar techniques next time … :-)He=Np(2), Li=Pu(2), Ta=Np(3), W=Pu(3). To get other isotopes,
just change the last digit to a number greater than 3.
The build file runs jdalbec.c through the C preprocessor to +
The build file runs jdalbec.c through the C preprocessor to
generate jdalbec2.c which is edited with ed(1) (NOTE: this was
changed to sed(1) by the judges) to correct spacing
problems caused by some preprocessors. (I know you dislike
Perl, but hopefully ed(1) is more common on POSIX systems than
Perl.) The build file then compiles jdalbec2.c] and removes the
jdalbec2.c file.
I don’t think I’m abusing the Makefile since I’m only using +
I don’t think I’m abusing the Makefile since I’m only using
147 characters including white space and the #! line and the
-commented-out -Wall -pedantic options. The rules for the
+commented-out -Wall -pedantic options. The rules for the
16th IOCCC specifically allowed build files up to 521
characters long so my build file would have been well within
those limits. (What typo?)
??= as a trigraph
step on Mac OS X 10.1.5 generates lots of errors in “smart
mode” because the “smart” preprocessor expects a valid C
program as input. The preprocessor then falls back to “basic
-mode” and preprocesses jdalbec.c successfully without warnings,
+mode” and preprocesses jdalbec.c successfully without warnings,
even when I give it the -Wall -pedantic options. It inserts
a lot of extra spaces into the preprocessed output which is
why I had to add the ed(1) step to the build file so that my
@@ -500,7 +500,7 @@ it if you run into this feature (e.g. 1 22 instead of 122Note: you may want to be sure you have a limit on stack size before trying this.
I ran it on Debian GNU/Linux and discovered that I did not have a limit on stack
size. Fortunately the OS killed the process after a while. This is consistent
-with the output of 1996/schweikh3 which reports
+with the output of 1996/schweikh3 which reports
malloc lied! Killed by SIGKILL.
Arguments matching /(?:.){10,}/ will produce visually incorrect
results (e.g., generation 1 starting from 1111111111 will
diff --git a/2004/kopczynski/README.md b/2004/kopczynski/README.md
index ffabaa7fe..ad8d63bd2 100644
--- a/2004/kopczynski/README.md
+++ b/2004/kopczynski/README.md
@@ -101,7 +101,7 @@ the number from 8 to 11 that it thinks it is.
(`$?` is shorter)
* I achieved some additional tightness by `-Dif=while` which saved 9 chars of
-source for the cost of 11 chars of the [Makefile](Makefile). If I used
+source for the cost of 11 chars of the [Makefile](%%REPO_URL%%/2004/kopczynski/Makefile). If I used
`-DB=while`, I would save 12 for 10, but I think the current version is slightly
more obfuscated.
diff --git a/2004/kopczynski/index.html b/2004/kopczynski/index.html
index bab67d382..c496375de 100644
--- a/2004/kopczynski/index.html
+++ b/2004/kopczynski/index.html
@@ -436,7 +436,7 @@ number, not to print it, but if you think otherwise, the change would
cost 6 chars (plus a warning). Change return * to printf("%d",*).
($? is shorter)
I achieved some additional tightness by -Dif=while which saved 9 chars of
-source for the cost of 11 chars of the Makefile. If I used
+source for the cost of 11 chars of the Makefile. If I used
-DB=while, I would save 12 for 10, but I think the current version is slightly
more obfuscated.
goto the source and notice the lack of functions. Jump
to the switch statement. And if you think you can puzzle
-it out better, try solving insane1.sudoku all by yourself!
NOTE: the tarball named by the author was removed after the files were extracted into the directory instead. These files were added to the list.
Yes, the test suite really is 5 times larger than the actual program. You did say this was a parody of the software development process…
test.perl expects the sudoku-sf executable to be
+
test.perl expects the sudoku-sf executable to be
./sudoku-sf. If you rename it, please change the definition of $sf_exe to the
new name.
Judges’ note: this was done.
@@ -507,7 +507,7 @@ really. represented as a full stop (.) or zero (0). Other characters are ignored, so you
can cut-and-paste either example sudoku puzzle from above into a file and feed that
in. The program has coped with every input I’ve thrown at it so far, including
-an empty grid.
+an empty grid.
Output consists of the problem, then the solution, then a message of success/failure.
./aidan U may also be useful, or perhaps not. It only took
diff --git a/2006/meyer/README.md b/2006/meyer/README.md
index 265b4790b..32a0e64f9 100644
--- a/2006/meyer/README.md
+++ b/2006/meyer/README.md
@@ -37,8 +37,8 @@ NOTE: if your move is invalid it will prompt you again but not show the board.
This entry turns a newspaper solitaire puzzle into a competition
with the computer to be the last one moving. The object of this
-[source code](meyer.c) is to determine the object of this [source
-code](meyer.c)! :-)
+[source code](%%REPO_URL%%/2006/meyer/meyer.c) is to determine the object of this [source
+code](%%REPO_URL%%/2006/meyer/meyer.c)! :-)
## Author's remarks:
diff --git a/2006/meyer/index.html b/2006/meyer/index.html
index 3e7e8298d..d44a7579e 100644
--- a/2006/meyer/index.html
+++ b/2006/meyer/index.html
@@ -393,7 +393,7 @@ more text to fulfil the program’s requirements.
This entry turns a newspaper solitaire puzzle into a competition with the computer to be the last one moving. The object of this -source code is to determine the object of this source +source code is to determine the object of this source code! :-)
I wanted submit a fully object-oriented entry to show that diff --git a/2006/sykes1/README.md b/2006/sykes1/README.md index a40ca40b1..147fffaa0 100644 --- a/2006/sykes1/README.md +++ b/2006/sykes1/README.md @@ -4,7 +4,7 @@ make ``` -There is an alt version based on the author's remarks. The [try.sh](try.sh) +There is an alt version based on the author's remarks. The [try.sh](%%REPO_URL%%/2006/sykes1/try.sh) script will compile and use both but if you wish to see the alternate version specifically see the [Alternate code](#alternate-code) section below. @@ -127,7 +127,7 @@ Some instructions on how to make your own cube are in the included file [bedlam-cubes.pdf](%%REPO_URL%%/2006/sykes1/bedlam-cubes.pdf). Finally, you can watch it being solved with the video file here, -[solving-bedlam-cube.mp4](solving-bedlam-cube.mp4). +[solving-bedlam-cube.mp4](%%REPO_URL%%/2006/sykes1/solving-bedlam-cube.mp4). Actually the cube is very hard to do by hand by just trying to fit it together. I have not known anyone to solve it in this way - you would diff --git a/2006/sykes1/index.html b/2006/sykes1/index.html index 1d9352c67..f4228ac40 100644 --- a/2006/sykes1/index.html +++ b/2006/sykes1/index.html @@ -379,7 +379,7 @@ Location: FI - Republic of Finland
makeThere is an alt version based on the author’s remarks. The try.sh +
There is an alt version based on the author’s remarks. The try.sh script will compile and use both but if you wish to see the alternate version specifically see the Alternate code section below.
Some instructions on how to make your own cube are in the included file bedlam-cubes.pdf.
Finally, you can watch it being solved with the video file here, -solving-bedlam-cube.mp4.
+solving-bedlam-cube.mp4.Actually the cube is very hard to do by hand by just trying to fit it together. I have not known anyone to solve it in this way - you would need to be very lucky indeed to stumble across a solution.
diff --git a/2006/toledo2/README.md b/2006/toledo2/README.md index 9a8c67a7a..0042d36d7 100644 --- a/2006/toledo2/README.md +++ b/2006/toledo2/README.md @@ -102,8 +102,8 @@ and a disk controller, just like at the start of the personal computers revolution (circa 1975). It needs an initial memory image to do something usable, so along with it you -will find two files: ([C.BASIC](C.BASIC) and [C.BIOS](C.BIOS)). Rename -[C.BASIC](C.BASIC) to `C` (NOTE from the judges: running `make` will do this for +will find two files: ([C.BASIC](%%REPO_URL%%/2006/toledo2/C.BASIC) and [C.BIOS](%%REPO_URL%%/2006/toledo2/C.BIOS)). Rename +[C.BASIC](%%REPO_URL%%/2006/toledo2/C.BASIC) to `C` (NOTE from the judges: running `make` will do this for you), run the emulator, and et voila! you have the public domain Palo Alto [Tiny BASIC](https://en.wikipedia.org/wiki/Tiny_BASIC) (by Li-Chen Wang), published in the very first volume of [Dr. Dobb's diff --git a/2006/toledo2/index.html b/2006/toledo2/index.html index 282168dec..e7cd35a87 100644 --- a/2006/toledo2/index.html +++ b/2006/toledo2/index.html @@ -432,8 +432,8 @@ removes those files extracted from theKAYPROII.ZIP.
and a disk controller, just like at the start of the personal computers
revolution (circa 1975).
It needs an initial memory image to do something usable, so along with it you
-will find two files: (C.BASIC and C.BIOS). Rename
-C.BASIC to C (NOTE from the judges: running make will do this for
+will find two files: (C.BASIC and C.BIOS). Rename
+C.BASIC to C (NOTE from the judges: running make will do this for
you), run the emulator, and et voila! you have the public domain Palo Alto Tiny
BASIC (by Li-Chen Wang), published in
the very first volume of Dr. Dobb’s
diff --git a/2011/blakely/README.md b/2011/blakely/README.md
index 36d22c598..7e1a4a79f 100644
--- a/2011/blakely/README.md
+++ b/2011/blakely/README.md
@@ -96,7 +96,7 @@ When evolving forwards, the code can only be stopped by killing the
program. In the reverse direction, the code can either be killed, or
will stop if it is unable to find a grid that will evolve to the
current layout correctly. This can be seen with the sample grid
-[t0_3.dat](t0_3.dat), which evolves backwards by only two time-steps.
+[t0_3.dat](%%REPO_URL%%/2011/blakely/t0_3.dat), which evolves backwards by only two time-steps.
### Input file format
diff --git a/2011/blakely/index.html b/2011/blakely/index.html
index 9ed1f8bff..e0e6771b0 100644
--- a/2011/blakely/index.html
+++ b/2011/blakely/index.html
@@ -428,7 +428,7 @@ line option.
The input files must encode a square grid, where a space is a dead cell, and any
other character (except a newline) is a living cell. Each line must be the same
diff --git a/2011/dlowe/README.md b/2011/dlowe/README.md
index f8d195824..cd913e454 100644
--- a/2011/dlowe/README.md
+++ b/2011/dlowe/README.md
@@ -228,11 +228,11 @@ The learning rate is hard-coded as `0.3`. No momentum factor is used.
#### png corpora
-The [png-1](dlowe-aux-data/png-1) corpus was obtained by manually scraping the first results from an
+The `dlowe-aux-data/png-1` corpus was obtained by manually scraping the first results from an
0. Intervening directories (if any) will
intermediate target values.
The learning rate is hard-coded as 0.3. No momentum factor is used.
The png-1 corpus was obtained by manually scraping the first results from an +
The dlowe-aux-data/png-1 corpus was obtained by manually scraping the first results from an
https://images.google.com search for “obfuscate
filetype:png”.
The png-0 corpus was obtained by manually scraping the first results from an +
The dlowe-aux-data/png-0 corpus was obtained by manually scraping the first results from an
https://images.google.com search for “obfuscate
filetype:gif”.
*.gif and *.png files from my home computer as
a test set;> 0.5 as “probably a .png” and < 0.5 as “probably
a .gif”Making sure not to overfit the network to the training data is a bit of a -black art. I have enclosed earlystop.pl, a wrapper script that implements +black art. I have enclosed earlystop.pl, a wrapper script that implements a simple ‘early stopping’ algorithm; other techniques are possible.
Bad input (e.g. nonexistent files, non-numeric number of iterations, etc.) tends to result in empty output.
diff --git a/2011/hamaji/README.md b/2011/hamaji/README.md index c57ec59af..5dde2423c 100644 --- a/2011/hamaji/README.md +++ b/2011/hamaji/README.md @@ -159,7 +159,7 @@ cannot execute deeper recursions). First of all, as you see, my program looks like a nonogram puzzle which results in a [dragon](https://www.draconika.com/what). This puzzle is -[dragon.nono](dragon.nono) in this directory. Note that whitespaces in character +[dragon.nono](%%REPO_URL%%/2011/hamaji/dragon.nono) in this directory. Note that whitespaces in character literals, a string literal, and around the last comment are considered as a boxed cell. @@ -214,7 +214,7 @@ The second author wrote the picture, and the first author did everything else. The [dragon.nono](%%REPO_URL%%/2011/hamaji/dragon.nono), [samurai.nono](%%REPO_URL%%/2011/hamaji/samurai.nono), and -[penguin.nono](penguin.nono) were written by the +[penguin.nono](%%REPO_URL%%/2011/hamaji/penguin.nono) were written by the second author. The [soccer.nono](%%REPO_URL%%/2011/hamaji/soccer.nono) was from a wikipedia entry. This file is important because it requires some guesses. The [random.nono](%%REPO_URL%%/2011/hamaji/random.nono) file was randomly generated. The [codegolf.nono](%%REPO_URL%%/2011/hamaji/codegolf.nono) and diff --git a/2011/hamaji/index.html b/2011/hamaji/index.html index 1ed0d1486..da210d0ba 100644 --- a/2011/hamaji/index.html +++ b/2011/hamaji/index.html @@ -484,7 +484,7 @@ cannot execute deeper recursions).First of all, as you see, my program looks like a nonogram puzzle which results in a dragon. This puzzle is -dragon.nono in this directory. Note that whitespaces in character +dragon.nono in this directory. Note that whitespaces in character literals, a string literal, and around the last comment are considered as a boxed cell.
My program is based on bit operations for speed. Many values are @@ -518,7 +518,7 @@ dragon.
The second author wrote the picture, and the first author did everything else.
The dragon.nono, samurai.nono, and -penguin.nono were written by the +penguin.nono were written by the second author. The soccer.nono was from a wikipedia entry. This file is important because it requires some guesses. The random.nono file was randomly generated. The codegolf.nono and diff --git a/2011/toledo/README.md b/2011/toledo/README.md index 9b672e431..c91171a96 100644 --- a/2011/toledo/README.md +++ b/2011/toledo/README.md @@ -8,7 +8,7 @@ If you have X11 installed: There are two alternate versions, [one that lets you reconfigure the controls and size](%%REPO_URL%%/2011/toledo/toledo.alt.c) and [another that should work for -Windows](toledo.alt2.c). See [Alternate code](#alternate-code) below. +Windows](%%REPO_URL%%/2011/toledo/toledo.alt2.c). See [Alternate code](#alternate-code) below. ## To use: diff --git a/2011/toledo/index.html b/2011/toledo/index.html index a74c2d5f4..0dfad5790 100644 --- a/2011/toledo/index.html +++ b/2011/toledo/index.html @@ -381,7 +381,7 @@ Location: MX - United Mexican StatesIf you have X11 installed:
makeThere are two alternate versions, one that lets you reconfigure the -controls and size and another that should work for +controls and size and another that should work for Windows. See Alternate code below.
./toledoThe program expects two command line arguments. The first is a (very long)
string that contains the complete music font. Note that it should not be given
as a file name! The default music font is encoded in the (whitespace of the)
-source code deckmyn.c itself. Therefore, the first argument should
+source code deckmyn.c itself. Therefore, the first argument should
be "`` cat deckmyn.c ``".
The second command line argument is the music itself. This is, again, a string, not a file name. All music signs are entered as tokens of exactly 3 characters. The code is very sensitive to bad spacing! So for instance, if you use a file to -write the music (e.g. example_greensleeves), you should +write the music (e.g. example_greensleeves), you should keep in mind that newline is also a character!
To minimise the memory footprint, this program has no variable declarations at diff --git a/2012/tromp/README.md b/2012/tromp/README.md index 5b8d9666d..928b6030d 100644 --- a/2012/tromp/README.md +++ b/2012/tromp/README.md @@ -512,7 +512,7 @@ and detract from its single minded focus on conciseness. It implicitly declares functions `read(2)`, `write(2)`, `exit(3)` and `calloc(3)`, the latter two incompatibly. 32 bit and 64 bit executables are -separate [Makefile](Makefile) targets, involving a change from `int` to `long` +separate [Makefile](%%REPO_URL%%/2012/tromp/Makefile) targets, involving a change from `int` to `long` and from a hardcoded sizeof of 4 to 8. The program has been tested to work correctly on Linux/Solaris/MacOSX both in 32 diff --git a/2012/tromp/index.html b/2012/tromp/index.html index 2fd7d3129..c69ca32ef 100644 --- a/2012/tromp/index.html +++ b/2012/tromp/index.html @@ -715,7 +715,7 @@ many warnings;
and detract from its single minded focus on conciseness.It implicitly declares functions read(2), write(2), exit(3) and
calloc(3), the latter two incompatibly. 32 bit and 64 bit executables are
-separate Makefile targets, involving a change from int to long
+separate Makefile targets, involving a change from int to long
and from a hardcoded sizeof of 4 to 8.
The program has been tested to work correctly on Linux/Solaris/MacOSX both in 32 and 64 bits.
diff --git a/2013/birken/README.md b/2013/birken/README.md index b970a4902..95ef510b2 100644 --- a/2013/birken/README.md +++ b/2013/birken/README.md @@ -333,7 +333,7 @@ rate in which the terminal application receives and displays the [ANSI escape](https://en.wikipedia.org/wiki/ANSI_escape_code) sequences. To slow down the output programmatically, introduce a delay immediately after the -call to `fflush(3)` (N.B: see [birken.alt.c](birken.alt.c)). +call to `fflush(3)` (N.B: see [birken.alt.c](%%REPO_URL%%/2013/birken/birken.alt.c)). ### IOCCC Size Tool Bug diff --git a/2013/birken/index.html b/2013/birken/index.html index 400fe8cdd..37707de7c 100644 --- a/2013/birken/index.html +++ b/2013/birken/index.html @@ -600,7 +600,7 @@ represented using ANSI escape sequences. rate in which the terminal application receives and displays the ANSI escape sequences.To slow down the output programmatically, introduce a delay immediately after the
-call to fflush(3) (N.B: see birken.alt.c).
fflush(3) (N.B: see birken.alt.c).
This program demonstrates how to exploit a bug in IOCCC size tool version
2013-07-30-v17. The first line of the program is reproduced below.
iocccsize -i < cable3.c returns 1977 (the year the 4.77 MHz 8086 CPU was announced)and with Apple clang version 15.0.0 (clang-1500.0.40.1) in 2023, we get:
1840985120 -2033041452 35979112Which one is correct? :)
-NOTE: make all will compile fun.c but to provide a different compiler
+
NOTE: make all will compile fun.c but to provide a different compiler
you can do something like:
make CC=clang funNOTE: this has been provided in slflen.sh so you can try:
+NOTE: this has been provided in slflen.sh so you can try:
./slflen.shinstead (which try.sh also uses).
+instead (which try.sh also uses).
This is a handy little tool for visualizing numeric series from the
command line, using sparklines. Pass it a numeric series as arguments, and
diff --git a/2013/endoh4/README.md b/2013/endoh4/README.md
index 229ca0125..769500e20 100644
--- a/2013/endoh4/README.md
+++ b/2013/endoh4/README.md
@@ -142,7 +142,7 @@ So, try:
./endoh4 < endoh4.c # or ./endoh4.sh
```
-The [solids/](solids/) directory includes various solid data:
+The `solids` directory includes various solid data:
- [Platonic solids](http://en.wikipedia.org/wiki/Platonic_solid)
- [Archimedean solids](http://en.wikipedia.org/wiki/Archimedean_solid)
diff --git a/2013/endoh4/index.html b/2013/endoh4/index.html
index 38b7f34e7..6c5a96277 100644
--- a/2013/endoh4/index.html
+++ b/2013/endoh4/index.html
@@ -451,7 +451,7 @@ clang, and tcc. It should not trigger warnings with -pedantic and <
The shape of this code is the geometric net of a regular tetrahedron. So, try:
./endoh4 < endoh4.c # or ./endoh4.shThe solids/ directory includes various solid data:
+The solids directory includes various solid data:
sqrt(3) in
-a.c is for.
+a.c is for.
Going beyond colors, to define a shiny or dull surface one needs more maths, and
optics. The jargon for this is BRDF (Bidirectional Reflectance Distribution
Function) importance sampling. Let’s continue to function o.
https://github.com/ioccc-src/temp-test-ioccc/blob/master/## To build:
make allThe current status of this entry is:
@@ -468,7 +468,7 @@ don’t have to worry about conflicts.grep “size limit”). Please see the Self-imposed
+shows up in grep “size limit”). Please see the Self-imposed
restrictions section below for more details.hou does not terminate (as suggested by the second line of rule 6).Unfortunately, it became very difficult to get this entry to fit within the
size requirements. It’s currently at 2052 according to
-iocccsize, and 3994 according to wc -c.
wc -c.
The current size is a third to a half of the original size before compression.
Due to this, it does LOTS of things that subtly annoy compilers!
Flow control is by for and return. It is if-less, switch-less,
while-less, and hopeless. Literally, if not figuratively. ;-)
The code size is intentionally 2015, as stated by iocccsize -i, and can be
-reformatted without changes (as in rule2.c) to exactly 4096 octets.
Finally, calc is interesting, if for no other reason than it is practically
useful: Hex/decimal conversion, arithmetic, byte-swapping, bit-shifting, and
logical operations with memory, on the command line, or interactively.
The file prog.alt.c is the one I submitted.
+The file prog.alt.c is the one I submitted.
Gil Dogon noted a few unsafe statements (statements whose behaviour is undefined in the C standard and, as such, could cause issues with other compilers or optimization levels). These have been fixed in -prog.c.
+prog.c.After this fix, in order to remain rule-2-compliant, a variable name has also been shortened in this file.
(u0, v0) by default.
You can specify a pattern file when the executable is invoked (not
compile-time). The file should include a sequence of points, see
-ioccc.txt, center.txt, or line.txt as
+ioccc.txt,
+center.txt,
+or line.txt as
examples. Each amount in cells near to the point included in the file, will be
added by (u1, v1).
-DTIMESTEP=ts -DSPEED=spdmain() function call. And then it interprets main() as an
instruction sequence.
It supports the minimal subset of instructions and addressing modes which are -needed for mullender.c to work:
+needed for mullender.c to work:We suggest that you attempt to completely understand the endoh4 1-liner program: another impressive compact piece of C code.
-And while you are at it, cat the endoh2 prog.c code. Compile it +
And while you are at it, cat the endoh2 prog.c code. Compile it and look at the source code again.
In a “Back to the Future” moment, endoh3 gave us a twist on one of the all time best IOCCC entries from 1984.
@@ -414,7 +414,7 @@ and 22 (one third of 666). Identifying yourself, in an obvious way in your code, data, remarks or program output, unless you are Peter Honeyman or pretending to be Peter Honeyman, will be grounds for disqualification of your entry. -A number of other entries were based on iocccsize.c, making +
A number of other entries were based on iocccsize.c, making derivative works rather than original works.
Still other entries were too large, violating the first line of rule 2:
2) The size of your program source must be <= 4096 bytes in length.Included is a test script, useful for the corner cases. As in all good Unix programs, it is silent upon success; any output demonstrates an error. Instead -of checking correctness, the check.sh script can simply output the +of checking correctness, the check.sh script can simply output the results: (The Makefile contains the spoiler):
out=cat ./check.sh ./progInterestingly, and a spoiler here: macOS and FreeBSD implement the common @@ -423,7 +423,7 @@ Input should be less than ten million octets “toavoidthisproblem”.
No whitespace was harmed in the creation of this program. All your base belong to us, but the constants seem a bit … off?The script cow.sh provides a closer analog, and perhaps a more useful +
The script cow.sh provides a closer analog, and perhaps a more useful interface.
Included is a version without compilation warnings:
cc -Wall -Wextra -Weverything -pedantic -include stdio.h -o prog.clean prog.clean.cLETTERS must not repeat. The length of
is too long, and 2 if the command-line arguments are missing.
./getwords.sh LANGUAGE_CODE
outputs a sorted list of unique words in a given language, one per line. It
requires aspell with a dictionary for LANGUAGE_CODE.
./wrapprog.py LETTERS [N]
works similarly to ./prog LETTERS [N] except that it merges pangrams
before passing them to prog and expands them in prog’s output. This way,
it finishes the job faster than prog when there are millions of perfect
pangrams. It requires a UTF-8 locale.
de.sh, en.sh, fr.sh, it.sh, -pl.sh, and ru.sh output German, +
de.sh, en.sh, +fr.sh, it.sh, +pl.sh, and ru.sh output German, English, French, Italian, Polish, and Russian perfect pangrams, respectively. They require a UTF-8 locale.
To a casual eye, this entry may look similar to
-2005/klausler.
+2005/klausler.
However, prog is internationalized and way faster. On my machine,
./klausler abcdefghijklmnopqrstuvwxyz printed only 3,965 perfect
pangrams until I killed it after 144 hours running, while the
@@ -482,7 +483,7 @@ finished in 62 minutes, reporting 1,640,569,315 perfect pangrams, and
the example from section What is this? finished in 1.35
seconds. On the other hand, prog can only output series of words
with non-repeating characters, unlike klausler.
In contrast to prog.alt.c, prog.c does not call +
In contrast to prog.alt.c, prog.c does not call
fflush(stdout) after outputting each line, thus running faster.
I am grateful to Witold Jarnicki for suggesting this change.
The original prog finished the example above in 100 minutes
@@ -504,8 +505,8 @@ have no perfect pangrams.
goto M and goto H, I challenge the adherents of
structured programming to refactor goto T, which jumps back into a
nested if block.
-With the supplied Makefile, both gcc and clang compile
-prog.c without warnings in C11 and C99 mode. For a clean
+
With the supplied Makefile, both gcc and clang compile
+prog.c without warnings in C11 and C99 mode. For a clean
compilation with gcc -std=c90, add -Wno-format to
CSILENCE in Makefile.
https://github.com/ioccc-src/temp-test-ioccc/blob/master/2019/lynn/## To build:
makeThe current status of this entry is:
@@ -390,8 +390,8 @@ Location: IL - State of Israel (1991/davidguy, -2011/blakely, …
+1991/davidguy, +2011/blakely, …
…This entry likely concludes the IOCCC category “Cellular automata simulators”; it would be very hard to beat it on its field.
FYI: The .mc extension stands for Golly macrocell format.
L) and which zoom Scale you are watching
This entry is quite portable hopefully on most modern platforms. It assumes X
Window support of course. More than 2GB of memory is recommended. Configuration
-through Makefile is provided for the display windows size and for
+through Makefile is provided for the display windows size and for
the memory usage. The Makefile provided configuration (Z=0x20000000) will need a
system with 4GB DRAM to run nicely. There are several other salient assumptions
though:
Those wait for you, curious and intrepid reader, in the attached
-apholife.c file, which is a partially obfuscated version of the
+apholife.c file, which is a partially obfuscated version of the
program I wrote with a lot of helpful annotations and comments for myself and
posterity, revealing some of the magic under the hood. This program is also a
somewhat improved version which uses ldexp()s in the draw routine and has
diff --git a/2019/duble/README.md b/2019/duble/README.md
index 74ff128ac..a1731308e 100644
--- a/2019/duble/README.md
+++ b/2019/duble/README.md
@@ -91,7 +91,7 @@ directory which you'll have to delete manually. This is also discussed in
## Alternate code:
-An alternate version of this entry, [prog.alt.c](prog.alt.c), is provided. This
+An alternate version of this entry, [prog.alt.c](%%REPO_URL%%/2019/duble/prog.alt.c), is provided. This
alternate code might not work as well in macOS.
@@ -228,9 +228,9 @@ IMPORTANT NOTES:
so any peer reaching the session should have a terminal with the same
size or larger.
-### [prog.c](prog.c) vs [prog.alt.c](prog.alt.c)
+### [prog.c](%%REPO_URL%%/2019/duble/prog.c) vs [prog.alt.c](%%REPO_URL%%/2019/duble/prog.alt.c)
-The file [prog.alt.c](prog.alt.c) is the one I submitted.
+The file [prog.alt.c](%%REPO_URL%%/2019/duble/prog.alt.c) is the one I submitted.
The judges proposed a small update: the program was using macro `FD_SET` inside an
expression, which breaks compilation on macOS. Wrapping this macro into a
@@ -240,13 +240,13 @@ However, that was not enough to make the program work on macOS. If you analyse
the program you will see that it heavily relies on OS resources. And, for this
first version of the program, you even needed to increase default `sysctl`
parameters to make it work on FreeBSD (this was the purpose of file
-[check-os.sh](check-os.sh)). I tried hard to tune macOS the same, but failed.
+[check-os.sh](%%REPO_URL%%/2019/duble/check-os.sh)). I tried hard to tune macOS the same, but failed.
The simple fact the Judges proposed this update meant they wish it could work on
Mac. And if the judges wish something, it **has to** be done. ;) So I
refactored a little more the program to reduce OS resources consumption. Or
maybe not reduce consumption, but consume them differently... And I obtained
-[prog.c](prog.c). With this version, no need to touch `sysctl` parameters, and
+[prog.c](%%REPO_URL%%/2019/duble/prog.c). With this version, no need to touch `sysctl` parameters, and
it works on macOS too! I must confess it was challenging to remain below the
size limit with this little change.
diff --git a/2019/duble/index.html b/2019/duble/index.html
index 5a57e6f35..beb7e5e63 100644
--- a/2019/duble/index.html
+++ b/2019/duble/index.html
@@ -422,7 +422,7 @@ in the beginning this will also happen. This is discussed in
directory which you’ll have to delete manually. This is also discussed in
2019 duble bugs.
An alternate version of this entry, prog.alt.c, is provided. This +
An alternate version of this entry, prog.alt.c, is provided. This alternate code might not work as well in macOS.
make altThe file prog.alt.c is the one I submitted.
+The file prog.alt.c is the one I submitted.
The judges proposed a small update: the program was using macro FD_SET inside an
expression, which breaks compilation on macOS. Wrapping this macro into a
function was enough to fix this compilation issue.
sysctl
parameters to make it work on FreeBSD (this was the purpose of file
-check-os.sh). I tried hard to tune macOS the same, but failed.
+check-os.sh). I tried hard to tune macOS the same, but failed.
The simple fact the Judges proposed this update meant they wish it could work on
Mac. And if the judges wish something, it has to be done. ;) So I
refactored a little more the program to reduce OS resources consumption. Or
maybe not reduce consumption, but consume them differently… And I obtained
-prog.c. With this version, no need to touch sysctl parameters, and
+prog.c. With this version, no need to touch sysctl parameters, and
it works on macOS too! I must confess it was challenging to remain below the
size limit with this little change.
unsafeThisAndThat functions. All functions mus
cc -o prog prog.cTest the compiler on fib.hs:
+Test the compiler on fib.hs:
(./prog < fib.hs ; cat prog.c) > fib.cCompiling the output produces a binary that prints the 30th Fibonacci number.
-The file ghcfib.hs includes fib.hs with some glue code, +
The file ghcfib.hs +includes fib.hs with some glue code, and shows GHC also accepts our subset of Haskell:
ghc ghcfib.hsTo avoid spoiling this entry by revealing the original Haskell source, we -instead provide hint.hs, the output of a certain stage of the +instead provide hint.hs, the output of a certain stage of the compiler when run on itself. This intermediate output is hopefully difficult to understand, yet is accepted by our compiler:
(./prog < hint.hs ; cat prog.c) > hint.c
@@ -427,12 +428,12 @@ understand, yet is accepted by our compiler:
./hintThe output program behaves like the compiler itself.
Unlike the original source from which it is derived, GHC fails to compile
-hint.hs. This is because values have been replaced with their Scott
+hint.hs. This is because values have been replaced with their Scott
encodings
by this stage, which messes up type-checks; we’d need equirecursive types for
it to work.
The file lol.hs contains an adaptation of Doug McIlroy’s elegant code from
+ The file lol.hs contains an adaptation of Doug McIlroy’s elegant code from
“Enumerating the strings of regular
languages”. We exercise it by
showing the first entries of the length-ordered list of all strings consisting
@@ -443,7 +444,7 @@ of the characters A GHC wrapper is provided: See scc.hs (and its GHC wrapper ghcscc.hs) for an elegant
+ See scc.hs (and its GHC wrapper ghcscc.hs) for an elegant
way to print the strongly-connected components of a graph in reverse topological
order.a and b that contain an even number
ghc ghclol.hsStrongly-connected components:
-
@@ -547,7 +548,7 @@ represent the integer (./prog < scc.hs ; cat prog.c) > scc.cn with a term equivalent to Y(BT)nA sentinel in the heap often confused me, so ought to confuse others.
Other obfuscation techniques are better appreciated after decoding the -compiler. See hint.hs.
+compiler. See hint.hs.So, I followed the rules given by Gandalf the White and the Judges of the IOCCC.
-Output of Output of Cody Boone Ferguson: I really like that you enjoyed my
previous entry. I hope that you will like this entry too. Because I did not
want to give too many clues to the Judges, I tried to write this
-entry in a different way than Most Stellar, but in this
+entry in a different way than Most Stellar, but in this
code there is at least one recycled thing from it. By the way, the answers to
the questions I posed: (1) 255. (2) Try to compare binary representations of
those iocccsize, using the 2019 version of
+iocccsize, using the 2019 version of
iocccsize, is carefully selected. For
the sake of clarity, I used single letter variables in the code. I also avoided
unnecessary use of functions. Like a
@@ -521,7 +521,7 @@ arrays, so I did it.floats and binary representation of the string “25th IOCCC!”. (3) I
@@ -537,7 +537,7 @@ checksumgoto jumps to the end of the code.
I see that one of the Volker Diels-Grabsch’s winning entries is -awarded the category Most self-aware. In last +awarded the category Most self-aware. In last year, my entry incorporates the Fletcher’s 16 algorithm to ensure integrity of code. One of my first ideas for this year was to do the same diff --git a/2019/yang/README.md b/2019/yang/README.md index 14f69463b..a6be85f9c 100644 --- a/2019/yang/README.md +++ b/2019/yang/README.md @@ -209,7 +209,7 @@ Verified to work and compiles without warnings on these environments: I tried really hard to make `prog.c` fit in a 80x25 terminal without wrapping. If I were not constrained by space, I would have made an ASCII art out of it. -[violet.c](violet.c) is that program, and also comes with the minor benefit of +[violet.c](%%REPO_URL%%/2019/yang/violet.c) is that program, and also comes with the minor benefit of supporting lines longer than a million columns depending on `sizeof(int)`. Violet is named after [Violet diff --git a/2019/yang/index.html b/2019/yang/index.html index 68633fd83..3b050e14e 100644 --- a/2019/yang/index.html +++ b/2019/yang/index.html @@ -496,7 +496,7 @@ feeds (preserved) and tabs (expanded to 8 spaces).
I tried really hard to make prog.c fit in a 80x25 terminal without wrapping.
If I were not constrained by space, I would have made an ASCII art out of it.
-violet.c is that program, and also comes with the minor benefit of
+violet.c is that program, and also comes with the minor benefit of
supporting lines longer than a million columns depending on sizeof(int).
Violet is named after Violet Evergarden in the story with diff --git a/2020/burton/README.md b/2020/burton/README.md index 7945aef1e..c696c54fc 100644 --- a/2020/burton/README.md +++ b/2020/burton/README.md @@ -80,7 +80,7 @@ transformation occurs. ### Rule 2-ish: -Exporting the constants `B`,`I`,`T`,`S` to the [Makefile](Makefile) allows the +Exporting the constants `B`,`I`,`T`,`S` to the [Makefile](%%REPO_URL%%/2020/burton/Makefile) allows the code to be compiled for either LE (little-endian) or BE (big-endian) machines(!!), so they are truly configuration parameters, not logic. diff --git a/2020/burton/index.html b/2020/burton/index.html index 60f093dec..2da6ddedc 100644 --- a/2020/burton/index.html +++ b/2020/burton/index.html @@ -412,7 +412,7 @@ result?
Invoke this with a single non-negative integer less than 256, and a useful transformation occurs.
Exporting the constants B,I,T,S to the Makefile allows the
+
Exporting the constants B,I,T,S to the Makefile allows the
code to be compiled for either LE (little-endian) or BE (big-endian)
machines(!!), so they are truly configuration parameters, not logic.
An alternate version of this entry, prog.alt.c, is provided. This +
An alternate version of this entry, prog.alt.c, is provided. This alternate code lacks the additional rule to flag all unprobed cells. See the Author’s remarks for more details.
The judges pointed out a bug of the original version that I submitted -(prog.alt.c). Because this program does not provide a feature to +(prog.alt.c). Because this program does not provide a feature to flag unprobed cells manually, we can do nothing if the number of unprobed cells are equal to the number of mines remaining; unwinnable.txt is an example for such a case.
Thus, I implemented an additional rule to flag all unprobed cells in such a case -into the final version (prog.c).
+into the final version (prog.c).Ilya Kurdyukov also pointed out a warning
“ignoring return value of ‘fscanf’” only when -O3 is used. So I changed the
code a little to pretend to use the return value of fscanf(3).
./prog prog.c?
Clever use of the C99 complex data type. The spoiler directory +
Clever use of the C99 complex data type. The spoiler directory contains clues as to how some winning authors create / edit programs into ASCII shapes.
-With the source from the spoiler directory could you make the code +
With the source from the spoiler directory could you make the code render for a larger terminal window? How about adding more glyphs?
No! Try not. Do, or do not. There is no try.
diff --git a/2020/endoh3/README.md b/2020/endoh3/README.md index f091a3d26..7036e2411 100644 --- a/2020/endoh3/README.md +++ b/2020/endoh3/README.md @@ -25,7 +25,7 @@ code](#alternate-code) below. ## Alternate code: -An alternate version of this entry, [prog.alt.c](prog.alt.c), is provided. This +An alternate version of this entry, [prog.alt.c](%%REPO_URL%%/2020/endoh3/prog.alt.c), is provided. This alternate code uses Unicode letters. @@ -55,7 +55,7 @@ You may be tempted to use a mirror. Resist the temptation! Try figuring out how the clock hands are drawn. Can you change the program to make it draw a familiar (non-mirrored) clock face? Can you add the second hand? -When using the [run_clock.sh](run_clock.sh) shell script, your perception of +When using the [run_clock.sh](%%REPO_URL%%/2020/endoh3/run_clock.sh) shell script, your perception of time might depend on what time it is. diff --git a/2020/endoh3/index.html b/2020/endoh3/index.html index 098622999..0d39acea9 100644 --- a/2020/endoh3/index.html +++ b/2020/endoh3/index.html @@ -387,7 +387,7 @@ code below. ./run_clock
# And watch closely for 15-20 secondsAn alternate version of this entry, prog.alt.c, is provided. This +
An alternate version of this entry, prog.alt.c, is provided. This alternate code uses Unicode letters.
make altYou may be tempted to use a mirror. Resist the temptation! Try figuring out how the clock hands are drawn. Can you change the program to make it draw a familiar (non-mirrored) clock face? Can you add the second hand?
-When using the run_clock.sh shell script, your perception of +
When using the run_clock.sh shell script, your perception of time might depend on what time it is.
Prepare a mirror!
diff --git a/2020/ferguson1/README.md b/2020/ferguson1/README.md index 19849ff9e..cd2ce19ee 100644 --- a/2020/ferguson1/README.md +++ b/2020/ferguson1/README.md @@ -60,7 +60,7 @@ and non-zero). size to grow every time you eat a bug. Default 5; negative values are allowed. 'Negativity' creates for fun gameplay modes with enough creativity. See [gameplay.html](gameplay.html) - GitHub) as well as [play.sh](play.sh) for some examples. + GitHub) as well as [play.sh](%%REPO_URL%%/2020/ferguson1/play.sh) for some examples. * **SHED**SHED
every SHED movements you will grow (> 0), shrink (< 0) or
stay the same length (0) by the SHEDS (below) value. Again
@@ -431,7 +431,7 @@ eats a bug the counter isn’t incremented. Again with creativity
you can create some fun gameplay modes here. For instance you
can grow upon eating a bug but shrink every SHED movements
and then it’s a battle of whether you win by SIZE < 0 or
-SIZE >= MAXSIZE. See play.sh for examples.
+SIZE >= MAXSIZE. See play.sh for examples.
NOTE: the concept of shedding in this game is a misnomer; see
notes below.
CANNIBAL
@@ -793,12 +793,12 @@ been warned.
I submitted three Snake versions; these are the other layouts for those few (more likely none) who are interested to see them.
-The prog.2.c has more digraphs but I think no other significant differences.
-The prog.3.c is in a more artistic layout (a backwards S), has at least one +
The prog.2.c has more digraphs but I think no other significant differences.
+The prog.3.c is in a more artistic layout (a backwards S), has at least one
additional obfuscation technique (see spoilers) but it also has more digraphs
and as the judges said they feel that digraphs are dated so that’s probably why
-they chose the first layout. The prog.3-j.c version is
-prog.3.c with a shorter J macro.
J macro.
The prog.alt.c version is the one that allows for customising the bug colour and
it’s used in both snake-colours.sh and play.sh. It also calls erase()
first, clearing the screen, which the play.sh and snake-colours.sh scripts also
@@ -815,7 +815,7 @@ programmers. I’m especially proud to win besides Dave Burton and Yusuke Endoh
but Don Yang and Edward Giles too.
But there are some others who I don’t remember like Ilya Kurdyukov -(who’s offered a lot of interesting thoughts on Snake and +(who’s offered a lot of interesting thoughts on Snake and who plans to have his own version after the entries are published), Nathan Otterness, Nicholas Carlini (your entry is an absolutely brilliant @@ -825,7 +825,7 @@ list!) and tsoj too.
Well done and congratulations to all of you again! Thank you for submitting the wonderful entries and I’m honoured to have my two entries beside yours!
To Dave Burton I thank you for your wonderful comments as well as pointing out -that even with prog.alt.c it probably would be better to make use +that even with prog.alt.c it probably would be better to make use of the alt target instead of naming prog.c prog.alt.c. You’re quite right, I had thought of it but you brought it up so I could correct it. Much appreciated mate.
diff --git a/2020/ferguson2/README.md b/2020/ferguson2/README.md index 02f68776a..f4c85090c 100644 --- a/2020/ferguson2/README.md +++ b/2020/ferguson2/README.md @@ -1,4 +1,4 @@ -## To build: +%%REPO_URL%%/## To build: ``` make @@ -43,7 +43,7 @@ at once. See [Alternate code](#alternate-code) below. ./recode -v ``` -**NOTE**: in [recode](recode.c) no spaces between options and option arguments +**NOTE**: in [recode](%%REPO_URL%%/2020/ferguson2/recode.c) no spaces between options and option arguments are allowed. @@ -65,7 +65,7 @@ do? ## Alternate code: -This version, [prog.alt.c](prog.alt.c), writes a character at a time, sleeping +This version, [prog.alt.c](%%REPO_URL%%/2020/ferguson2/prog.alt.c), writes a character at a time, sleeping after each character, so that one can read it more easily (for longer output) and to make it a bit more like the real thing. @@ -107,7 +107,7 @@ This code is an [enigma](https://youtu.be/ybkkiGtJmkM). Try to decode it! There is a good deal of useful documentation that is provided with this entry: -* [enigma.1](enigma.1) - A useful man page for this entry. To render, try: +* [enigma.1](%%REPO_URL%%/2020/ferguson2/enigma.1) - A useful man page for this entry. To render, try: ``` @@ -116,7 +116,7 @@ There is a good deal of useful documentation that is provided with this entry: * [recode.html][] (or [recode.html](recode.html) if reading on GitHub) - - Some useful information about [recode.c](recode.c) + - Some useful information about [recode.c](%%REPO_URL%%/2020/ferguson2/recode.c) * [chocolate-cake.html][] (or [chocolate-cake.html](chocolate-cake.html) if reading on GitHub) @@ -131,7 +131,7 @@ There is a good deal of useful documentation that is provided with this entry: ## Author's remarks: My remarks about my [Heer][] (army) and [Luftwaffe][] (air force) [Enigma -machine](https://www.cryptomuseum.com/crypto/enigma/index.htm) [simulator](prog.c) for +machine](https://www.cryptomuseum.com/crypto/enigma/index.htm) [simulator](%%REPO_URL%%/2020/ferguson2/prog.c) for the 27th IOCCC. I want to dedicate this entry in part to the millions of poor souls that were @@ -405,7 +405,7 @@ Phew! The program redeemed itself after the test failure! :) is with some of the things I pasted in the other file and maybe others here too. Notice also how it showed the same output that my program gave it - `UUMMX`.) -What about the other [Morse code entry](../../1998/dorssel/dorssel.c)? +What about the other [Morse code entry](%%REPO_URL%%/1998/dorssel/dorssel.c)? ``` $ echo IOCCC | ./prog | ./dorssel @@ -433,7 +433,7 @@ It has a randomise mode and it can save/read the settings to/from a file to allow for duplicity (an archaic term for the state of being double but obviously for Enigma it has to also mean deceitful). -I recommend using this in a pipeline instead of the [simulator](prog.c) itself +I recommend using this in a pipeline instead of the [simulator](%%REPO_URL%%/2020/ferguson2/prog.c) itself if you want to change the configuration of the simulator because it offers a much richer experience (and because you can reuse the configuration without having to type it out again every time). @@ -453,7 +453,7 @@ For examples using it (and a delicious challenge) see [recode.html][] (or The parser is in a sense rather rudimentary but allows for both interactive and -automatic (e.g. via the [recode](recode.c) program) input. This does mean that +automatic (e.g. via the [recode]((%%REPO_URL%%/2020/ferguson2recode.c) program) input. This does mean that something like the following can happen: ``` @@ -499,7 +499,7 @@ is buffering at play I believe but it's useful for allowing the `recode` program to easily configure the Enigma machine. In the [recode.html](recode.html) file (or [recode.html](recode.html) if reading on GitHub) file I give a hint as to how this could be fixed but the caveat is it would necessitate a need for rewriting -[recode.c](recode.c). +[recode.c](%%REPO_URL%%/2020/ferguson2/recode.c). There's another thing to be aware of and that's the way the ranges are enforced. There are five rotors which obviously are in C 0-4 but in 'natural language' @@ -508,7 +508,7 @@ There are five rotors which obviously are in C 0-4 but in 'natural language' There are two [reflectors](https://www.ciphermachinesandcryptology.com/en/enigmatech.htm#Reflector) and the same applies: in C 0-1 but in human it's 1-2 (technically these were reflectors B and C in -the Enigma machine which I display by name in [recode.c](recode.c) just like +the Enigma machine which I display by name in [recode.c](%%REPO_URL%%/2020/ferguson2/recode.c) just like with the rotors). For more information see [recode.html][] (or [recode.html](recode.html) if viewing on @@ -531,7 +531,7 @@ accomplished and made use of! :) The layout of [recode.c][] isn't too significant (but see below) but I want to -mention [prog.c](prog.c) especially: +mention [prog.c](%%REPO_URL%%/2020/ferguson2/prog.c) especially: I did think of a more artistic layout but [reflecting](https://www.ciphermachinesandcryptology.com/en/enigmatech.htm#Reflector) @@ -587,7 +587,7 @@ The file [obfuscation.key][] is the key to decipher/encipher For the lazy [obfuscation.html](obfuscation.html) has the deciphered version. I am afraid I'm not so inclined to do that for the cake recipe: the idea there is to make it a fun exercise that when solved unlocks a wonderful double-layered chocolate fudge -cake recipe. But given that my ['Don't tread on me'](../ferguson1) award entry +cake recipe. But given that my ['Don't tread on me'](../ferguson1/index.html) award entry also has the [recipe](../ferguson1/chocolate-cake.html) ([ferguson1/chocolate-cake.html](../ferguson1/chocolate-cake.html) if reading on GitHub), not enciphered, one might just go there instead. Still it's a fun way @@ -639,7 +639,7 @@ can at least have the output played in Morse code as the Germans did; I think that's really cool (I think it's really cool even if there's a bug in it). That it pays homage to that (and another) entry is a bonus here. -* The [simulator](prog.c) doesn't report errors but tries to gracefully deal +* The [simulator](%%REPO_URL%%/2020/ferguson2/prog.c) doesn't report errors but tries to gracefully deal with them: if one chooses a value out of range it moves it into the range (if > the max then the max, if < min then the min). If invalid chars are input for the plugboard pairs then it's not added to the plugboard etc. @@ -798,7 +798,7 @@ rotor selection 'screen'. Then use the arrow buttons above each rotor to set from left to right B, B and C. After this you can type your message in the input field and watch the wiring of the rotors change and show the path it takes. -If I made use of the Enigma code in the [recode.c](recode.c) program I would +If I made use of the Enigma code in the [recode.c](%%REPO_URL%%/2020/ferguson2/recode.c) program I would maybe consider doing something like that but I intentionally do not use it there: as cool as it might be it would give a better idea of how the algorithm works (unless I were to make it just as obscure as I do in prog.c but that's @@ -886,7 +886,7 @@ but Don Yang and Edward Giles too. But there are some others who I don't remember like [Ilya Kurdyukov](../../authors.html#Ilya_Kurdyukov) -(who's offered a lot of interesting thoughts on [Snake](../ferguson1/prog.c) and +(who's offered a lot of interesting thoughts on [Snake](%%REPO_URL%%/2020/ferguson1/prog.c) and who plans to have his own version after the entries are published), [Nathan Otterness](../../authors.html#Nathan_Otterness), [Nicholas Carlini](../../authors.html#Nicholas_Carlini) (your entry is an absolutely brilliant diff --git a/2020/ferguson2/index.html b/2020/ferguson2/index.html index 9d956696c..5e6f4463e 100644 --- a/2020/ferguson2/index.html +++ b/2020/ferguson2/index.html @@ -377,7 +377,7 @@ Location: US - United States of America -https://github.com/ioccc-src/temp-test-ioccc/blob/master/## To build:
makeThe author provided alternate code that prints the output one character at a time to make it a bit more like the real thing in that it isn’t dumped out all @@ -412,7 +412,7 @@ at once. See Alternate code below.
# show Enigma machine settings after selection / generation: ./recode -v -NOTE: in recode no spaces between options and option arguments +
NOTE: in recode no spaces between options and option arguments are allowed.
./try.shdo?
This version, prog.alt.c, writes a character at a time, sleeping +
This version, prog.alt.c, writes a character at a time, sleeping after each character, so that one can read it more easily (for longer output) and to make it a bit more like the real thing.
This code is an enigma. Try to decode it!
There is a good deal of useful documentation that is provided with this entry:
man ./enigma.1My remarks about my Heer (army) and Luftwaffe (air force) Enigma -machine simulator for +machine simulator for the 27th IOCCC.
I want to dedicate this entry in part to the millions of poor souls that were lost during the tragedy that is the Second World @@ -653,7 +653,7 @@ idea anyway. Neither do I know if the original transcoding is correct.
(Technically above it didn’t print a newline after the output and this is how it
is with some of the things I pasted in the other file and maybe others here
too. Notice also how it showed the same output that my program gave it - UUMMX.)
What about the other Morse code entry?
+What about the other Morse code entry?
$ echo IOCCC | ./prog | ./dorssel
..- ..- -- -- -..-It has a randomise mode and it can save/read the settings to/from a file to allow for duplicity (an archaic term for the state of being double but obviously for Enigma it has to also mean deceitful).
-I recommend using this in a pipeline instead of the simulator itself +
I recommend using this in a pipeline instead of the simulator itself if you want to change the configuration of the simulator because it offers a much richer experience (and because you can reuse the configuration without having to type it out again every time).
@@ -688,7 +688,7 @@ make it more flexible by a wrapper program.The parser is in a sense rather rudimentary but allows for both interactive and -automatic (e.g. via the recode program) input. This does mean that +automatic (e.g. via the recode input. This does mean that something like the following can happen:
$ ./prog -
Ring 1: 1AB
@@ -728,14 +728,14 @@ is buffering at play I believe but it’s useful for allowing the recoderecode.html file
(or recode.html if reading on GitHub) file I give a hint as to how
this could be fixed but the caveat is it would necessitate a need for rewriting
-recode.c.
+recode.c.
There’s another thing to be aware of and that’s the way the ranges are enforced.
There are five rotors which obviously are in C 0-4 but in ‘natural language’
1-5 (they were labelled I, II, III, IV and V though).
There are two
reflectors and the
same applies: in C 0-1 but in human it’s 1-2 (technically these were reflectors B and C in
-the Enigma machine which I display by name in recode.c just like
+the Enigma machine which I display by name in recode.c just like
with the rotors).
For more information see recode.html (or recode.html if viewing on
GitHub).
@@ -751,7 +751,7 @@ accomplished and made use of! :)
On the source code layout
The layout of recode.c isn’t too significant (but see below) but I want to
-mention prog.c especially:
+mention prog.c especially:
I did think of a more artistic layout but
reflecting
on it I think that the blankness of it can be another way of honouring all the
@@ -784,7 +784,7 @@ has some of the ways I think this entry is obfuscated. To decipher try:
For the lazy obfuscation.html has the deciphered version. I am afraid I’m not
so inclined to do that for the cake recipe: the idea there is to make it a fun
exercise that when solved unlocks a wonderful double-layered chocolate fudge
-cake recipe. But given that my ‘Don’t tread on me’ award entry
+cake recipe. But given that my ‘Don’t tread on me’ award entry
also has the recipe
(ferguson1/chocolate-cake.html if reading on
GitHub), not enciphered, one might just go there instead. Still it’s a fun way
@@ -825,7 +825,7 @@ processes each letter - but with the 2014 Mo
can at least have the output played in Morse code as the Germans did; I think
that’s really cool (I think it’s really cool even if there’s a bug in it). That
it pays homage to that (and another) entry is a bonus here.
The simulator doesn’t report errors but tries to gracefully deal +
The simulator doesn’t report errors but tries to gracefully deal with them: if one chooses a value out of range it moves it into the range (if > the max then the max, if < min then the min). If invalid chars are input for the plugboard pairs then it’s not added to the plugboard etc.
If I made use of the Enigma code in the recode.c program I would +
If I made use of the Enigma code in the recode.c program I would maybe consider doing something like that but I intentionally do not use it there: as cool as it might be it would give a better idea of how the algorithm works (unless I were to make it just as obscure as I do in prog.c but that’s @@ -1003,7 +1003,7 @@ programmers. I’m especially proud to win besides Dave Burton and Yusuke Endoh but Don Yang and Edward Giles too.
But there are some others who I don’t remember like Ilya Kurdyukov -(who’s offered a lot of interesting thoughts on Snake and +(who’s offered a lot of interesting thoughts on Snake and who plans to have his own version after the entries are published), Nathan Otterness, Nicholas Carlini (your entry is an absolutely brilliant diff --git a/2020/ferguson2/recode.html b/2020/ferguson2/recode.html index 4e8815bb9..73b962f5b 100644 --- a/2020/ferguson2/recode.html +++ b/2020/ferguson2/recode.html @@ -362,7 +362,7 @@
N.B. At the end of this file I have given a fun exercise that can be used to explore my Enigma machine -simulator. I really encourage you to do this but of course you don’t +simulator. I really encourage you to do this but of course you don’t have to if you don’t wish to.
Though you won’t find some of those strings in recode.c or
-prog.c. Yes the WAR for the Ringstellung (Ring settings) is an
+
Though you won’t find some of those strings in [recode.c]((https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson2/recode.c) or
+[prog.c]((https://github.com/ioccc-src/temp-test-ioccc/blob/master/2020/ferguson2/prog.c). Yes the WAR for the Ringstellung (Ring settings) is an
amusing coincidence but it really did happen!
As for -f the contents would be output with the settings e.g. to pipe to
prog itself (as if you redirected the file contents to the Enigma machine for
@@ -565,7 +565,7 @@ pair; this can be done in
a number of ways but two dots is one. Notice also that it’s in a different order
than the simulator: because with the size restrictions on my entry I saved bytes
by using the same loop where I could. It just felt more natural to have them
-grouped together in a configurator for the simulator.
$ echo 1AA2AA3AA2ABCD..EFGHIJKLMNOPQRIOCCC | ./prog - 2>/dev/null
HQNVO
$ echo 1AA2AA3AA2ABCD..EFGHIJKLMNOPQRIOCCC | ./prog - 2>/dev/null | echo 1AA2AA3AA2ABCD..EFGHIJKLMNOPQRHQNVO | ./prog - 2>/dev/null
diff --git a/2020/ferguson2/recode.md b/2020/ferguson2/recode.md
index ba93b15b1..f8fb22658 100644
--- a/2020/ferguson2/recode.md
+++ b/2020/ferguson2/recode.md
@@ -2,7 +2,7 @@
N.B. At the end of this file I have given a fun exercise that can be used to
explore my [Enigma machine](https://www.cryptomuseum.com/crypto/enigma/index.htm)
-[simulator](prog.c). I really encourage you to do this but of course you don't
+[simulator](%%REPO_URL%%/2020/ferguson2/prog.c). I really encourage you to do this but of course you don't
have to if you don't wish to.
@@ -97,8 +97,8 @@ if you don't give the option to read in a file for input.
1WX5AK4RE1XEHJSAPYCIZBWDQNRUVGIOCCC
```
-Though you won't find some of those strings in [recode.c](recode.c) or
-[prog.c](prog.c). Yes the `WAR` for the Ringstellung (Ring settings) is an
+Though you won't find some of those strings in [recode.c]((%%REPO_URL%%/2020/ferguson2/recode.c) or
+[prog.c]((%%REPO_URL%%/2020/ferguson2/prog.c). Yes the `WAR` for the Ringstellung (Ring settings) is an
amusing coincidence *but it really did happen!*
As for `-f` the contents would be output with the settings e.g. to pipe to
@@ -265,7 +265,7 @@ pair](https://www.cryptomuseum.com/crypto/enigma/i/sb.htm); this can be done in
a number of ways but two dots is one. Notice also that it's in a different order
than the simulator: because with the size restrictions on my entry I saved bytes
by using the same loop where I could. It just felt more natural to have them
-grouped together in a configurator for the [simulator](prog.c).
+grouped together in a configurator for the [simulator]((%%REPO_URL%%/2020/ferguson2/prog.c).
```
$ echo 1AA2AA3AA2ABCD..EFGHIJKLMNOPQRIOCCC | ./prog - 2>/dev/null
diff --git a/2020/giles/README.md b/2020/giles/README.md
index 92ec47c3c..9d33dfad8 100644
--- a/2020/giles/README.md
+++ b/2020/giles/README.md
@@ -41,7 +41,7 @@ will be converted to the DTMF sound!
./prog 867-5309 > jenny.wav
```
-If the script [try.sh](try.sh) did not play a WAV file, it means you do not have
+If the script [try.sh](%%REPO_URL%%/2020/giles/try.sh) did not play a WAV file, it means you do not have
SoX installed; see [FAQ 3.10: How do I compile and use an IOCCC entry that
requires sound?](../../faq.html#sox)). In this case install it and try it again or
play the files `jenny.wav` and `ioccc28.wav` in a program that can play WAV
diff --git a/2020/giles/index.html b/2020/giles/index.html
index 5df7337fd..a8e76d128 100644
--- a/2020/giles/index.html
+++ b/2020/giles/index.html
@@ -398,7 +398,7 @@ will be converted to the DTMF sound!
# See
./prog 867-5309 > jenny.wavIf the script try.sh did not play a WAV file, it means you do not have +
If the script try.sh did not play a WAV file, it means you do not have
SoX installed; see FAQ 3.10: How do I compile and use an IOCCC entry that
requires sound?). In this case install it and try it again or
play the files jenny.wav and ioccc28.wav in a program that can play WAV
diff --git a/2020/kurdyukov1/README.md b/2020/kurdyukov1/README.md
index f04930f00..a482da091 100644
--- a/2020/kurdyukov1/README.md
+++ b/2020/kurdyukov1/README.md
@@ -32,19 +32,19 @@ code](#alternate-code) below for more details.
There are a number of alternate versions for this program, some in C and some in
assembly.
-The file [prog.alt.c](prog.alt.c) is smaller and does not contain any
+The file [prog.alt.c](%%REPO_URL%%/2020/kurdyukov1/prog.alt.c) is smaller and does not contain any
headers or any workaround for WIN32 based platforms.
-The file [prog.extra.c](prog.extra.c) has a number of layouts including some for
+The file [prog.extra.c](%%REPO_URL%%/2020/kurdyukov1/prog.extra.c) has a number of layouts including some for
different social media profile covers as well as different shapes.
-The files [prog.x86_64.asm](prog.x86_64.asm) and [prog.x86.asm](prog.x86.asm)
+The files [prog.x86_64.asm](%%REPO_URL%%/2020/kurdyukov1/prog.x86_64.asm) and [prog.x86.asm](%%REPO_URL%%/2020/kurdyukov1/prog.x86.asm)
are the program in assembly for x86_64 linux and x86 linux respectively.
### Alternate build:
-To build [prog.alt.c](prog.alt.c):
+To build [prog.alt.c](%%REPO_URL%%/2020/kurdyukov1/prog.alt.c):
```
make alt
@@ -100,17 +100,17 @@ under mingw64), otherwise the hashes can be incorrect.
### Bonus
-- [prog.extra.c](prog.extra.c) is the same with the sine function (so smaller),
+- [prog.extra.c](%%REPO_URL%%/2020/kurdyukov1/prog.extra.c) is the same with the sine function (so smaller),
and in different shapes.
-- [prog.x86_64.asm](prog.x86_64.asm) contains the same program, but written in
+- [prog.x86_64.asm](%%REPO_URL%%/2020/kurdyukov1/prog.x86_64.asm) contains the same program, but written in
assembly for x86_64 Linux, for the sake of smaller executable size which is 500
bytes long (where 120 is for the ELF headers) after compilation. Algorithm
details is slightly different (like constants packing), just to make smaller
binary code. It's interesting to compare density of binary code and obfuscated
C.
-- [prog.x86.asm](prog.x86.asm) is for x86, although the headers are smaller, but
+- [prog.x86.asm](%%REPO_URL%%/2020/kurdyukov1/prog.x86.asm) is for x86, although the headers are smaller, but
the binary code is larger due to fewer registers and lack of 64-bit multiply.
@@ -139,7 +139,7 @@ above:
For people eager to encode large files, an extra utility has been packaged
with this entry to preprocess the generated output to make them more
-acceptable to typical compilers. View the [cppp.cc](cppp.cc) source and
+acceptable to typical compilers. View the [cppp.cc](%%REPO_URL%%/2020/yang/cppp.cc) source and
then compile it with a c++ compiler of your choice.