makeThere is an alternate version that allows one to control the number of numbers -to print on a line. See alternate code below.
+to print on a line. See Alternate code below.The current status of this entry is:
@@ -547,7 +547,7 @@ previous paragraph applies here also. tailor-made for this competition!Although there are no comments, the program still manages to be self-documenting in an obscure fashion (periodic table of -the (non-primordial) elements, “OBFUSCATED C”).
+the (non-primordial) elements, “OBFUSCATED C”).Obfuscation
The program is obfuscated:
@@ -557,8 +557,8 @@ the (non-primordial) elements, “OBFUSCATED C”).
- By the use of global constants.
- By the use of global functions that replace the standard ones (I particularly like substituting
+highly unstable) forAt(Astatine, -highly unstable) forabort().) By overloading symbols (For example,Bis a -type, a structure, a structure member, a macro parameter, and a variable.).abort()). By overloading symbols (for example,Bis a +type, a structure, a structure member, a macro parameter, and a variable).- By standard tricks like writing
'\0'as1["3"]or2["22"].- By using ternary operators to avoid
else.- By using the
diff --git a/2004/kopczynski/README.md b/2004/kopczynski/README.md index 41627240c..f3c5cb323 100644 --- a/2004/kopczynski/README.md +++ b/2004/kopczynski/README.md @@ -4,7 +4,7 @@ make ``` -NOTE: We FORCE the use of -O0 even if someone overrides it because this entry +**NOTE**: We **FORCE** the use of `-O0` even if someone overrides it because this entry will not work with it enabled. @@ -57,7 +57,7 @@ we have seen in years! Compile and run without arguments. As input, give it an ASCII graphics figure 8, 9, 10, or 11 made of pound signs and spaces, of any size, shape, or orientation (that's right, an upside down 9 is still 9 :-) ). -There is one restriction: the only line not containing "#" characters +There is one restriction: the only line not containing `#` characters must be the last. The program will print what it thinks you've entered. If you enter @@ -67,7 +67,7 @@ a pattern when it does not resemble 8, 9, 10 or 11? Here is a related puzzle: how to continue the sequence: - 1, 0, 0, 0, 0, 0, 1, 0, 2, 1, ... +> `1, 0, 0, 0, 0, 0, 1, 0, 2, 1, ...` With certain arguments, you can alter the exit value / output. Can you figure out how and why? @@ -85,7 +85,7 @@ This program returns the number as its exit status. (In most shells, you can see the exit status of the last command with `echo $?` (or just `$?`).) -**NOTE: The judges altered the primary version to output a number.** +**NOTE**: The judges altered the primary version to output a number. On the input, give numbers formed as a sequences of empty spaces and `#` signs (you can also use dots instead of spaces), ending with an empty @@ -131,10 +131,10 @@ minus the number of "edges" ``` ## # #. .# - # .# #. ('.' must be empty) + # .# #. ``` -plus the number of "faces" +(`.` must be empty) plus the number of "faces" ``` ## @@ -163,7 +163,7 @@ a "magic trick". 4. I make a 16-character array; when indexed by 4-bit value which represents the 2x2 squares, it will return a number to add/subtract -`{-1,0,+1}` +`{-1,0,+1}`. 5. We convert lines of input to bitmaps (`N-bit` integers). Additionally, it is heavily obfuscated by using negative numbers (two's complement). For example, diff --git a/2004/kopczynski/index.html b/2004/kopczynski/index.html index 6f7457f9b..4153d832f 100644 --- a/2004/kopczynski/index.html +++ b/2004/kopczynski/index.html @@ -409,7 +409,7 @@ Location: PL - Republic of PolandSb()function to create sub-buffers from either end.To build:
-makeNOTE: We FORCE the use of -O0 even if someone overrides it because this entry +
NOTE: We FORCE the use of
-O0even if someone overrides it because this entry will not work with it enabled.To use:
@@ -434,14 +434,16 @@ we have seen in years!./kopczynski < input_fileCompile and run without arguments. As input, give it an ASCII graphics figure 8, 9, 10, or 11 made of pound signs and spaces, of any size, shape, or orientation (that’s right, an upside down 9 is still 9 :-) ). -There is one restriction: the only line not containing “#” characters +There is one restriction: the only line not containing
#characters must be the last.The program will print what it thinks you’ve entered. If you enter anything that does not resemble 8, 9, 10, or 11, the result is seemingly arbitrary. Actually it is not pseudo-random; can you find a pattern when it does not resemble 8, 9, 10 or 11?
Here is a related puzzle: how to continue the sequence:
-1, 0, 0, 0, 0, 0, 1, 0, 2, 1, …
+++
1, 0, 0, 0, 0, 0, 1, 0, 2, 1, ...With certain arguments, you can alter the exit value / output. Can you figure out how and why?
Author’s remarks:
@@ -453,7 +455,7 @@ digits should be separated, and numbers should be “complete”.)This program returns the number as its exit status. (In most shells, you can see the exit status of the last command with
-echo $?(or just$?).)NOTE: The judges altered the primary version to output a number.
+NOTE: The judges altered the primary version to output a number.
On the input, give numbers formed as a sequences of empty spaces and
#signs (you can also use dots instead of spaces), ending with an empty line. (No number has an empty line in it.) The program should return @@ -488,8 +490,8 @@ characteristics is the number of “vertexes”#minus the number of “edges”
-## # #. .# - # .# #. ('.' must be empty)plus the number of “faces”
+ # .# #. +(
.must be empty) plus the number of “faces”## ##@@ -508,7 +510,7 @@ a “magic trick”.
- +
I make a 16-character array; when indexed by 4-bit value which represents the 2x2 squares, it will return a number to add/subtract -
{-1,0,+1}{-1,0,+1}.- +
We convert lines of input to bitmaps (
-N-bitintegers). Additionally, it is heavily obfuscated by using negative numbers (two’s complement). For example, it turns out that6inz=6is the only 1-digit number which works here (and diff --git a/2004/omoikane/README.md b/2004/omoikane/README.md index 1140ec2b7..4124641b4 100644 --- a/2004/omoikane/README.md +++ b/2004/omoikane/README.md @@ -28,8 +28,8 @@ is modified to have the desired checksum! This does, we suppose, solve the problem that inserting a checksum would change the file's checksum; if you have to change it, you might as well change it! -This program was submitted under the name `Rinia`, so the Author's -Comments refer to it as such. +This program was submitted under the name `Rinia`, so the [Author's +remarks](#authors-remarks) refer to it as such. ## Author's remarks: diff --git a/2004/omoikane/index.html b/2004/omoikane/index.html index 59a42568c..f0f5cef33 100644 --- a/2004/omoikane/index.html +++ b/2004/omoikane/index.html @@ -420,8 +420,8 @@ strictly speaking, isn’t being computed at all. Rather, the file is modified to have the desired checksum! This does, we suppose, solve the problem that inserting a checksum would change the file’s checksum; if you have to change it, you might as well change it!This program was submitted under the name
+Rinia, so the Author’s -Comments refer to it as such.This program was submitted under the name
Rinia, so the Author’s +remarks refer to it as such.Author’s remarks:
Rinia(1/14/04)makes the program more obscure.
Riniais a tool for embedding CRCs in text files. No need to assign diff --git a/2004/schnitzi/README.md b/2004/schnitzi/README.md index e283a0b0b..7df265a37 100644 --- a/2004/schnitzi/README.md +++ b/2004/schnitzi/README.md @@ -11,6 +11,9 @@ ./schnitziUS - United States of America makeTo use:
+./schnitzi <foo | vi -nwhere
foois a valid input file (see the author’s input details +for more details).Try:
-./try.shNOTE: if you’re one of those who don’t know how to exit
+vi:-) don’t worry as -it will exit for you.NOTE: if you’re one of those who don’t know how to exit
vi:-) don’t worry +as it will exit for you.Judges’ remarks:
This exemplifies the meaning of Visual Editor, but we don’t think that any benchmarking sites are going to use this to tout the diff --git a/2004/vik1/README.md b/2004/vik1/README.md index e6fecc352..aad95092b 100644 --- a/2004/vik1/README.md +++ b/2004/vik1/README.md @@ -4,7 +4,7 @@ make ``` -NOTE: this entry requires the `X11/Xlib.h` header file and the X11 library to +**NOTE**: this entry requires the `X11/Xlib.h` header file and the X11 library to compile. For more information see the FAQ on "[X11](../../faq.html#X11)". @@ -86,26 +86,38 @@ Compile the source code and link X libraries if necessary. The program takes three options which have to be typed in a specific order as described below. +#### Usage: + ``` - Usage: ./vik1 ['a']['d'][#] - - a - Advanced racing in a winter landscape - d - Racing in at night in the dark - # - Race track selection 1-3 are valid numbers + ./vik1 ['a']['d'][#] ``` -Here are a few examples: +- `a` + * Advanced racing in a winter landscape. +- `d` + * Racing in at night in the dark. +- `#` + * Race track selection 1-3 are valid numbers. -``` - Command line: Description: +#### Examples: - ./vik1 Run track 1 at daytime in the summer - ./vik1 a Run track 1 at daytime in the winter - ./vik1 d Run track 1 at night in the summer - ./vik1 3 Run track 3 at daytime in the summer - ./vik1 d3 Run track 3 at night in the summer - ./vik1 ad2 Run track 2 at night in the winter -``` +- `./vik1` + * Run track 1 at daytime in the summer. + +- `./vik1 a` + * Run track 1 at daytime in the winter. + +- `./vik1 d` + * Run track 1 at night in the summer. + +- `./vik1 3` + * Run track 3 at daytime in the summer. + +- `./vik1 d3` + * Run track 3 at night in the summer. + +- `./vik1 ad2` + * Run track 2 at night in the winter. Note that the order in which the argument characters are entered is important. It is for example not possible to type `./vik1 da`. (Well it is @@ -142,7 +154,7 @@ makes the program more obscure. ### Compiler warnings There are no compiler warnings when compiling with `-ansi` but there are -many warnings from lclint. Mainly because the program is very +many warnings from lclint, mainly because the program is very optimized for code size. diff --git a/2004/vik1/index.html b/2004/vik1/index.html index c2461dd9f..37dcf66cd 100644 --- a/2004/vik1/index.html +++ b/2004/vik1/index.html @@ -409,7 +409,7 @@ Location: US - United States of America
To build:
-makeNOTE: this entry requires the
X11/Xlib.hheader file and the X11 library to +NOTE: this entry requires the
X11/Xlib.hheader file and the X11 library to compile. For more information see the FAQ on “X11”.To use:
@@ -454,20 +454,49 @@ glance at the feature list he provided below. Amazing!Compile the source code and link X libraries if necessary. The program takes three options which have to be typed in a specific order as described below.
--Usage: ./vik1 ['a']['d'][#] - - a - Advanced racing in a winter landscape - d - Racing in at night in the dark - # - Race track selection 1-3 are valid numbersHere are a few examples:
-+Command line: Description: - - ./vik1 Run track 1 at daytime in the summer - ./vik1 a Run track 1 at daytime in the winter - ./vik1 d Run track 1 at night in the summer - ./vik1 3 Run track 3 at daytime in the summer - ./vik1 d3 Run track 3 at night in the summer - ./vik1 ad2 Run track 2 at night in the winterUsage:
++./vik1 ['a']['d'][#]+
+- +
a++
- Advanced racing in a winter landscape.
+- +
d++
- Racing in at night in the dark.
+- +
#++
- Race track selection 1-3 are valid numbers.
+Examples:
++
- +
./vik1++
- Run track 1 at daytime in the summer.
+- +
./vik1 a++
- Run track 1 at daytime in the winter.
+- +
./vik1 d++
- Run track 1 at night in the summer.
+- +
./vik1 3++
- Run track 3 at daytime in the summer.
+- +
./vik1 d3++
- Run track 3 at night in the summer.
+- +
./vik1 ad2++
- Run track 2 at night in the winter.
+Note that the order in which the argument characters are entered is important. It is for example not possible to type
@@ -492,7 +521,7 @@ the entry point of the application../vik1 da. (Well it is possible, but the result will not be as expected.)Compiler warnings
There are no compiler warnings when compiling with
-ansibut there are -many warnings from lclint. Mainly because the program is very +many warnings from lclint, mainly because the program is very optimized for code size.Limitations
The program only compiles and runs on X based systems.
diff --git a/2004/vik2/README.md b/2004/vik2/README.md index f5c931225..23a0dcaff 100644 --- a/2004/vik2/README.md +++ b/2004/vik2/README.md @@ -57,26 +57,32 @@ represented by one symbol that are either defined or undefined. The ALU has six instructions: -- `CLR_X` - Clear [register](https://en.wikipedia.org/wiki/Processor_register) `X`. +- `CLR_X` + * Clear [register](https://en.wikipedia.org/wiki/Processor_register) `X`. -- `CLR_Y` - Clear [register](https://en.wikipedia.org/wiki/Processor_register) `Y`. +- `CLR_Y` + * Clear [register](https://en.wikipedia.org/wiki/Processor_register) `Y`. -- `ADD` - Calculates `X` + `Y` and stores the result in `X`. If the result - is larger than 11 bits, the [CARRY - bit](https://en.wikipedia.org/wiki/Carry_flag) in `SR` is set otherwise - the `CARRY` bit is cleared. +- `ADD` + * Calculates `X` + `Y` and stores the result in `X`. If the result + is larger than 11 bits, the [CARRY + bit](https://en.wikipedia.org/wiki/Carry_flag) in `SR` is set otherwise + the `CARRY` bit is cleared. -- `SUB` - Calculates `X` - `Y` and stores the result in `X`. If `Y` was larger - than `X`, the [CARRY bit](https://en.wikipedia.org/wiki/Carry_flag) - in `SR` is set otherwise the `CARRY` bit is cleared. +- `SUB` + * Calculates `X` - `Y` and stores the result in `X`. If `Y` was larger than + `X`, the [CARRY bit](https://en.wikipedia.org/wiki/Carry_flag) in `SR` is + set otherwise the `CARRY` bit is cleared. -- `TST` - If `X` == `Y` the `EQ` bit in `SR` is set, otherwise the `EQ` bit is - cleared. If `X` < `Y` the `LT` bit in `SR` is set, otherwise the `LT` - bit is cleared. +- `TST` + * If `X` == `Y` the `EQ` bit in `SR` is set, otherwise the `EQ` bit is + cleared. If `X` < `Y` the `LT` bit in `SR` is set, otherwise the `LT` bit is + cleared. -- `INC2` - Calculates `X` + 2 and stores the result in `X`. The [CARRY - bit](https://en.wikipedia.org/wiki/Carry_flag) is handled as in the - `ADD` instruction. +- `INC2` + * Calculates `X` + 2 and stores the result in `X`. The [CARRY + bit](https://en.wikipedia.org/wiki/Carry_flag) is handled as in the `ADD` + instruction. Internally the [ALU](https://en.wikipedia.org/wiki/Arithmetic_logic_unit) implements a one bit adder with a carry in and carry out. This adder is the core @@ -108,10 +114,10 @@ The choice of application may be a bit unfortunate since we've already seen a winning entry calculating [prime numbers](https://en.wikipedia.org/wiki/Prime_number) in the [pre-processor](https://en.wikipedia.org/wiki/C_preprocessor). -There is a big difference though. The [1988/applin](../../1988/applin/index.html) entry uses pre- -processor arithmetic (in a very nice way though). This program only -defines and undefines symbols in a well defined ;) way and doesn't do -any pre-processor arithmetics. +There is a big difference though. The +[1988/applin](../../1988/applin/index.html) entry uses pre-processor arithmetic +(in a very nice way though). This program only defines and undefines symbols in +a well defined ;) way and doesn't do any pre-processor arithmetics. The reason why I chose to do a [prime number](https://en.wikipedia.org/wiki/Prime_number) application is that the diff --git a/2004/vik2/index.html b/2004/vik2/index.html index 8cdcaef92..882a4058a 100644 --- a/2004/vik2/index.html +++ b/2004/vik2/index.html @@ -444,21 +444,39 @@ calculations and one status registerSR. Each bit in the registers represented by one symbol that are either defined or undefined.The ALU has six instructions:
-
- -
CLR_X- Clear registerX.- -
CLR_Y- Clear registerY.
ADD- CalculatesX+Yand stores the result inX. If the result +- +
CLR_X++
- Clear register
+X.- +
CLR_Y++
- Clear register
+Y.- +
ADD++
- Calculates
-X+Yand stores the result inX. If the result is larger than 11 bits, the CARRY bit inSRis set otherwise -theCARRYbit is cleared.- -
SUB- CalculatesX-Yand stores the result inX. IfYwas larger -thanX, the CARRY bit -inSRis set otherwise theCARRYbit is cleared.- -
TST- IfX==YtheEQbit inSRis set, otherwise theEQbit is -cleared. IfX<YtheLTbit inSRis set, otherwise theLT-bit is cleared.- +the
INC2- CalculatesX+ 2 and stores the result inX. The CARRY -bit is handled as in the -ADDinstruction.CARRYbit is cleared.- +
SUB++
- Calculates
+X-Yand stores the result inX. IfYwas larger than +X, the CARRY bit inSRis +set otherwise theCARRYbit is cleared.- +
TST++
- If
+X==YtheEQbit inSRis set, otherwise theEQbit is +cleared. IfX<YtheLTbit inSRis set, otherwise theLTbit is +cleared.INC2++
- Calculates
+X+ 2 and stores the result inX. The CARRY +bit is handled as in theADD+instruction.Internally the ALU implements a one bit adder with a carry in and carry out. This adder is the core @@ -487,10 +505,10 @@ calculation is made and the result is moved back to the memory.
seen a winning entry calculating prime numbers in the pre-processor. -There is a big difference though. The 1988/applin entry uses pre- -processor arithmetic (in a very nice way though). This program only -defines and undefines symbols in a well defined ;) way and doesn’t do -any pre-processor arithmetics. +There is a big difference though. The +1988/applin entry uses pre-processor arithmetic +(in a very nice way though). This program only defines and undefines symbols in +a well defined ;) way and doesn’t do any pre-processor arithmetics.The reason why I chose to do a prime number application is that the algorithm can be written to do a lot of calculations without a lot of nesting diff --git a/bugs.html b/bugs.html index 52f7e3f51..9bfeeb5e3 100644 --- a/bugs.html +++ b/bugs.html @@ -2228,24 +2228,21 @@ sentence 2, and so fails to display responses from
hibachi.Source code: 2004/jdalbec/jdalbec.c
Information: 2004/jdalbec/index.html
The author stated that:
-+Arguments matching `/[^2]22$/` cause the program to segfault - after rapidly exhausting the available stack space. I could - probably fix this by adding some special cases to the code, - but [Blaine the Mono] it's quite a bit more exciting this way, - don't you think?[/Blaine] Since the trailing `22` will be - its own atom anyway, you can just insert a space in front of - it if you run into this feature (e.g. `1 22` instead of `122`). - - Arguments matching `/(?:.){10,}/` will produce visually incorrect - results (e.g., generation 1 starting from 1111111111 will - print as `: 1`), but there's nothing interesting about these - arguments that can't be modeled using shorter runs of the same - symbol. - - Arguments matching `/(?:.){257,}/` may produce mathematically - incorrect results (e.g., generation 1 starting from a string - of 257 `1`s will be calculated as `11`); the remark from the - previous paragraph applies here also.+Arguments matching
+/[^2]22$/cause the program to segfault after rapidly +exhausting the available stack space. I could probably fix this by adding some +special cases to the code, but [Blaine the Mono] it’s quite a bit more exciting +this way, don’t you think?[/Blaine] Since the trailing22will be its own +atom anyway, you can just insert a space in front of it if you run into this +feature (e.g.1 22instead of122).Arguments matching
+/(?:.){10,}/will produce visually incorrect results +(e.g., generation 1 starting from 1111111111 will print as: 1), but there’s +nothing interesting about these arguments that can’t be modeled using shorter +runs of the same symbol.Arguments matching
+/(?:.){257,}/may produce mathematically incorrect +results (e.g., generation 1 starting from a string of 2571s will be +calculated as11); the remark from the previous paragraph applies here also.diff --git a/bugs.md b/bugs.md index 8d9784a60..eab65d7c7 100644 --- a/bugs.md +++ b/bugs.md @@ -2676,26 +2676,21 @@ sentence 2, and so fails to display responses from `hibachi`. The author stated that: -``` - Arguments matching `/[^2]22$/` cause the program to segfault - after rapidly exhausting the available stack space. I could - probably fix this by adding some special cases to the code, - but [Blaine the Mono] it's quite a bit more exciting this way, - don't you think?[/Blaine] Since the trailing `22` will be - its own atom anyway, you can just insert a space in front of - it if you run into this feature (e.g. `1 22` instead of `122`). - - Arguments matching `/(?:.){10,}/` will produce visually incorrect - results (e.g., generation 1 starting from 1111111111 will - print as `: 1`), but there's nothing interesting about these - arguments that can't be modeled using shorter runs of the same - symbol. - - Arguments matching `/(?:.){257,}/` may produce mathematically - incorrect results (e.g., generation 1 starting from a string - of 257 `1`s will be calculated as `11`); the remark from the - previous paragraph applies here also. -``` +> Arguments matching `/[^2]22$/` cause the program to segfault after rapidly +exhausting the available stack space. I could probably fix this by adding some +special cases to the code, but [Blaine the Mono] it's quite a bit more exciting +this way, don't you think?[/Blaine] Since the trailing `22` will be its own +atom anyway, you can just insert a space in front of it if you run into this +feature (e.g. `1 22` instead of `122`). +> +> Arguments matching `/(?:.){10,}/` will produce visually incorrect results +(e.g., generation 1 starting from 1111111111 will print as `: 1`), but there's +nothing interesting about these arguments that can't be modeled using shorter +runs of the same symbol. +> +> Arguments matching `/(?:.){257,}/` may produce mathematically incorrect +results (e.g., generation 1 starting from a string of 257 `1`s will be +calculated as `11`); the remark from the previous paragraph applies here also.2004/sds
diff --git a/thanks-for-help.html b/thanks-for-help.html index c2d4c2106..eb9a59220 100644 --- a/thanks-for-help.html +++ b/thanks-for-help.html @@ -3101,7 +3101,7 @@ FAQ on “main function args” for more details.Cody also added the try.sh script and various data files: kopczynski-a to demonstrate what happens when art more -like a letter is fed to the program and the
kopczynski*-revfiles which are +like a letter is fed to the program, and thekopczynski*-revfiles which are the data files reversed withrev(1). One had to be modified additionally to get it to work, that beingkopczynski-10-rev.diff --git a/thanks-for-help.md b/thanks-for-help.md index 81e7b29b3..ea36099d7 100644 --- a/thanks-for-help.md +++ b/thanks-for-help.md @@ -3836,7 +3836,7 @@ for more details. Cody also added the [try.sh](%%REPO_URL%%/2004/kopczynski/try.sh) script and various data files: [kopczynski-a](%%REPO_URL%%/2004/kopczynski/kopczynski-a) to demonstrate what happens when art more -like a letter is fed to the program and the `kopczynski*-rev` files which are +like a letter is fed to the program, and the `kopczynski*-rev` files which are the data files reversed with `rev(1)`. One had to be modified additionally to get it to work, that being `kopczynski-10-rev`.