From 353bad0527ee4cabf198d19b9fecf4671779effb Mon Sep 17 00:00:00 2001 From: Cody Boone Ferguson <53008573+xexyl@users.noreply.github.com> Date: Mon, 29 Apr 2024 10:46:10 -0700 Subject: [PATCH 1/5] Fix links in 2020/ferguson2/recode.md --- 2020/ferguson2/recode.html | 8 ++++---- 2020/ferguson2/recode.md | 8 ++++---- 2 files changed, 8 insertions(+), 8 deletions(-) diff --git a/2020/ferguson2/recode.html b/2020/ferguson2/recode.html index c20d0647b..8c8282e9c 100644 --- a/2020/ferguson2/recode.html +++ b/2020/ferguson2/recode.html @@ -409,8 +409,8 @@ have to if you don’t wish to.

What is recode and why is it recommended?

-

To demonstrate how to and why you should use the recode.c program with -the Enigma machine simulator I have included some examples here as +

To demonstrate how to and why you should use the recode.c program with +the Enigma machine simulator I have included some examples here as well as brief (‘brief?!’ I am sure many would think but it’s brief for me) commentary.

It would not be possible to do all that the recode program does in my entry @@ -482,7 +482,7 @@ Again note that this does not validate input! Although it detects out of range for the arrays it doesn’t detect duplicates. This is because it wasn’t meant to be any given file or anything else other than the direct output of a previous run (thus validated). I’m not even guaranteeing that I got the array tests valid -in recode.c -R option!

+in recode.c -R option!

Protecting against the same I/O file

@@ -798,7 +798,7 @@ delicious challenge).

Example additions

diff --git a/2020/ferguson2/recode.md b/2020/ferguson2/recode.md index 186dbf598..91ed6df3e 100644 --- a/2020/ferguson2/recode.md +++ b/2020/ferguson2/recode.md @@ -30,8 +30,8 @@ have to if you don't wish to. # What is recode and why is it recommended?
-To demonstrate how to and why you should use the [recode.c](%%REPO_URL%%/2020/ferguson1/recode.c) program with -the [Enigma machine simulator](%%REPO_URL%%/2020/ferguson1/prog.c) I have included some examples here as +To demonstrate how to and why you should use the [recode.c](%%REPO_URL%%/2020/ferguson2/recode.c) program with +the [Enigma machine simulator](%%REPO_URL%%/2020/ferguson2/prog.c) I have included some examples here as well as brief ('brief?!' I am sure many would think but it's brief for me) commentary. @@ -128,7 +128,7 @@ Again note that this does not validate input! Although it detects out of range for the arrays it doesn't detect duplicates. This is because it wasn't meant to be any given file or anything else other than the direct output of a previous run (thus validated). I'm not even guaranteeing that I got the array tests valid -in [recode.c](%%REPO_URL%%/2020/ferguson1/recode.c) `-R` option! +in [recode.c](%%REPO_URL%%/2020/ferguson2/recode.c) `-R` option!
@@ -550,7 +550,7 @@ delicious challenge). # Example additions
-* Add code, to [prog.c](%%REPO_URL%%/2020/ferguson1/prog.c), that tries to determine possible decipherments based on +* Add code, to [prog.c](%%REPO_URL%%/2020/ferguson2/prog.c), that tries to determine possible decipherments based on a given crib (or set of cribs). From 4cb22eed18647fd6d898b2bbab880e4b70e8f6ef Mon Sep 17 00:00:00 2001 From: Cody Boone Ferguson <53008573+xexyl@users.noreply.github.com> Date: Mon, 29 Apr 2024 10:46:24 -0700 Subject: [PATCH 2/5] Fix links in 1988/applin/README.md --- 1988/applin/README.md | 3 ++- 1988/applin/index.html | 3 ++- 2 files changed, 4 insertions(+), 2 deletions(-) diff --git a/1988/applin/README.md b/1988/applin/README.md index 23f80b1ba..7458aa65b 100644 --- a/1988/applin/README.md +++ b/1988/applin/README.md @@ -40,7 +40,8 @@ Dhyrstone/sec/cpu machine) using the System V `cpp`. (The GNU `cpp` when define `BIG_CPP` took only 45 seconds.) Your `cpp` may not be able to compile it due to a common bug that results in -`cpp` running out of space. The routine [zsmall](%%REPO_URL%%/1988/applin/zsmall.c) is a smaller version +`cpp` running out of space. The routine +[zsmall](%%REPO_URL%%/1988/applin/applin.alt.c) is a smaller version of the [applin.c](%%REPO_URL%%/1988/applin/applin.c) entry. diff --git a/1988/applin/index.html b/1988/applin/index.html index 563150fdd..0e08b950b 100644 --- a/1988/applin/index.html +++ b/1988/applin/index.html @@ -417,7 +417,8 @@ with this entry.

Dhyrstone/sec/cpu machine) using the System V cpp. (The GNU cpp when defined as BIG_CPP took only 45 seconds.)

Your cpp may not be able to compile it due to a common bug that results in -cpp running out of space. The routine zsmall is a smaller version +cpp running out of space. The routine +zsmall is a smaller version of the applin.c entry.

Judges’ remarks:

This entry is by far the most unusual abuse of the C preprocessor that From 399ecd1c038faca5126fcfd6d3ab97dfbb7af562 Mon Sep 17 00:00:00 2001 From: Cody Boone Ferguson <53008573+xexyl@users.noreply.github.com> Date: Mon, 29 Apr 2024 10:46:37 -0700 Subject: [PATCH 3/5] Fix links in 1990/theorem/README.md --- 1990/theorem/README.md | 2 +- 1990/theorem/index.html | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/1990/theorem/README.md b/1990/theorem/README.md index 4905690f1..7b3222467 100644 --- a/1990/theorem/README.md +++ b/1990/theorem/README.md @@ -45,7 +45,7 @@ where: The program's source implements four functions, all from the same source file! -When you compile [theorem.c](%%REPO_URL%%/1990/theorem/Rtheorem.c) as is and run with 5 args, it +When you compile [theorem.c](%%REPO_URL%%/1990/theorem/theorem.c) as is and run with 5 args, it numerically solves the equation `y'=f(x,y)`, with a step size of `h` (see above usage), over the interval `x=[x1,x2]`, with the initial condition of `y(x1)=y1`. diff --git a/1990/theorem/index.html b/1990/theorem/index.html index d68109a9c..158be9288 100644 --- a/1990/theorem/index.html +++ b/1990/theorem/index.html @@ -416,7 +416,7 @@ Location: US - United States of America

Judges’ remarks:

The program’s source implements four functions, all from the same source file!

-

When you compile theorem.c as is and run with 5 args, it +

When you compile theorem.c as is and run with 5 args, it numerically solves the equation y'=f(x,y), with a step size of h (see above usage), over the interval x=[x1,x2], with the initial condition of y(x1)=y1.

The ‘expression’ f(x,y) is any function of x and y with the From 94e05b1cf83cda11cd26be41c85cd155388a37b1 Mon Sep 17 00:00:00 2001 From: Cody Boone Ferguson <53008573+xexyl@users.noreply.github.com> Date: Mon, 29 Apr 2024 10:46:51 -0700 Subject: [PATCH 4/5] Fix links in 1992/ant/README.md --- 1992/ant/README.md | 2 +- 1992/ant/index.html | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/1992/ant/README.md b/1992/ant/README.md index 75333ae4d..f7140e6a0 100644 --- a/1992/ant/README.md +++ b/1992/ant/README.md @@ -35,7 +35,7 @@ P1003 subcommittee. ## Author's remarks: -See the file [ant.README.txt](%%REPO_URL%%/1992/ant/ant.README). +See the file [ant.README.txt](%%REPO_URL%%/1992/ant/ant.README.txt).