From e5aeea8c9c20268b98f89b9a4b0f1c05328d24e1 Mon Sep 17 00:00:00 2001 From: Cody Boone Ferguson <53008573+xexyl@users.noreply.github.com> Date: Sun, 9 Apr 2023 09:15:57 -0700 Subject: [PATCH 1/2] Formatting and typo fixes in 1992/albert/README.md --- 1992/albert/README.md | 109 ++++++++++++++++++++++++------------------ 1 file changed, 63 insertions(+), 46 deletions(-) diff --git a/1992/albert/README.md b/1992/albert/README.md index 70b9378ed..03bf45424 100644 --- a/1992/albert/README.md +++ b/1992/albert/README.md @@ -1,26 +1,32 @@ # Most Useful Program: - Albert van der Horst - S P&A R&C - Oranjestraat 8 - 3511 RA UTRECHT - The Netherlands +Albert van der Horst +S P&A R&C +Oranjestraat 8 +3511 RA UTRECHT +The Netherlands ## To build: - make all +```sh +make all +``` ## To run: - ./albert number +```sh +./albert number +``` ## Try: - ./albert 1234567890123456789 +```sh +./albert 1234567890123456789 +``` ## Alternate code: -An alternate version of this entry, albert.alt.c, is provided. +An alternate version of this entry, [albert.alt.c](albert.alt.c), is provided. Leo Broukhis, before he was an IOCCC judge, sent the IOCCC judges this Email message: @@ -46,7 +52,9 @@ is the file before applying Leo Broukhis' fix. To compile this alternate version: - make alt +```sh +make alt +``` Use `albert.alt` as you would `albert` above. @@ -56,65 +64,74 @@ We were impressed with the speed at which it was able to factor arbitrarily large numbers consisting of factors that fit into a long. -## Author's comments +## Author's comments: The Obfuscated version of the Horst algorithm. This program will factor unlimited length numbers and print the factors in ascending order. Numbers of one digit (e.g. 8) are rejected without notice. -It quits as soon as there is at most one -factor left, but that factor will not be shown. -It accomplishes this efficiently, without resorting to division -or multiplication, until the candidate factor no longer fits in -a signed long. + +It quits as soon as there is at most one factor left, but that factor will not +be shown. It accomplishes this efficiently, without resorting to division or +multiplication, until the candidate factor no longer fits in a signed long. The nicest way is to rename the program into e.g. 4294967297 if you want to factor Fermat's 4th number. Then just run it. -Or you may type "prog " -A nice one is also (30 ones) -albert 111111111111111111111111111111 + +Or you may type `./albert ` +A nice one is also (30 ones): + +```sh +./albert 111111111111111111111111111111 +``` Apart from the foregoing there are no special execution instructions. To customize the program into a factorizer of a fixed number, use + +```sh cc albert.c -o 4294967297 +``` + or some such. There are no data files used, and it is not possible to feed input via stdin. -I think this program is a nice example of algorithmic obfuscation. -Several times two similar algorithms are merged into one. Then you -need quite some tricks to get it running, such as long jumps -through recursive subroutines. I felt like a sword smith, -welding the sword very long, folding it again to the proper -length, keep on hammering till it is tight, then fold again. -Always keeping it at the proper red hot temperature, but not too -hot lest the hardness fades. -The strict naming conventions for subroutines did not make things -much clearer after all, but it was not supposed to. +I think this program is a nice example of algorithmic obfuscation. Several +times two similar algorithms are merged into one. Then you need quite some +tricks to get it running, such as long jumps through recursive subroutines. I +felt like a sword smith, welding the sword very long, folding it again to the +proper length, keep on hammering till it is tight, then fold again. Always +keeping it at the proper red hot temperature, but not too hot lest the hardness +fades. -I would like to draw attention to the robustness of the program -with respect to error handling and the nice stopping criterion. -The aesthetic appeal of some lines is at the expense of clearness, -I apologize. -Running the program through the c-beautifier reveals nothing, -it will only destroy some of the lay out. -Running the program through lint shows the usual remarks for a -K&R program. Defeating this through casts does not make a program +The strict naming conventions for subroutines did not make things much clearer +after all, but it was not supposed to. + +I would like to draw attention to the robustness of the program with respect to +error handling and the nice stopping criterion. The aesthetic appeal of some +lines is at the expense of clearness, I apologize. + +Running the program through the C-beautifier reveals nothing, it will only +destroy some of the lay out. Running the program through lint shows the usual +remarks for a K&R program. Defeating this through casts does not make a program cleaner in my opinion. -Here are some hints, but they may not be too helpful. -1. The Horst algorithm is described in the Hobby Computer Club -Newsletter, year 82, part 4, a real Dutch treat. -Assembler, c and Forth version have been around for some years. +### Hints: + +Here are some hints, but they may not be too helpful: + +1. The Horst algorithm is described in the Hobby Computer Club Newsletter, year +82, part 4, a real Dutch treat. Assembly, C and Forth version have been around +for some years. 2. Does fractal programming exist after all? -3. You remember the ToomCook algorithm in Knuth? -It uses iteration instead of recursion and is quite jumpy. -This program shares these disadvantages in a modified form. -4. The Conversion is to be found in Knuth, not so the Observation. -The Observation: "if it ends in a zero, it is divisible by ten" +3. You remember the ToomCook algorithm in Knuth? It uses iteration instead of +recursion and is quite jumpy. This program shares these disadvantages in a +modified form. +4. The Conversion is to be found in Knuth, not so the Observation. The +Observation: "if it ends in a zero, it is divisible by ten". ## Copyright and CC BY-SA 4.0 License: From 460443fa4860a1e21ab977f9a6ce6f4795f41f41 Mon Sep 17 00:00:00 2001 From: Cody Boone Ferguson <53008573+xexyl@users.noreply.github.com> Date: Sun, 9 Apr 2023 09:18:36 -0700 Subject: [PATCH 2/2] Format fix 1992/ant/README.md --- 1992/ant/README.md | 40 ++++++++++++++++++++++++---------------- 1 file changed, 24 insertions(+), 16 deletions(-) diff --git a/1992/ant/README.md b/1992/ant/README.md index e18fa1d55..0644eeb4d 100644 --- a/1992/ant/README.md +++ b/1992/ant/README.md @@ -1,43 +1,51 @@ # Best Utility: - Anthony C Howe - Mortice Kern Systems Inc. - Unit 1, 14 Weber Street North - Waterloo, Ontario - N2J 3G4 - Canada +Anthony C Howe +Mortice Kern Systems Inc. +Unit 1, 14 Weber Street North +Waterloo, Ontario +N2J 3G4 +Canada ## To build: - make all +```sh +make all +``` ## To run: - ./am Makefile +```sh +./am Makefile +``` where `Makefile` is a Makefile to use. ## Try: - ./ant ant.test.mk +```sh +./ant ant.test.mk +``` We also suggest that you try: - make am - ./am Makefile am_clobber # clobber everything except am - ./am Makefile all +```sh +make am +./am Makefile am_clobber # clobber everything except am +./am Makefile all +``` -## Judges' comments +## Judges' comments: -Like much of Posix, obfuscation has its place. Your task is to +Like much of POSIX, obfuscation has its place. Your task is to figure out where. This entry comes complete with a Posix-like command description. -Interested Posix balloters should lobby the IEEE for an obfuscated -P1003 sub-committee. +Interested POSIX balloters should lobby the IEEE for an obfuscated +P1003 subcommittee. ## Author's comments: