mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

force use of pandoc version >= 3.1.12.2

Browse Source 
The `bin/pandoc-wrapper.sh` tool will verify that the ssytem
has a recent enough version of `pandoc(1)`.

We explain why we insist on `pandoc(1)`. version >= 3.1.12.2
in comments where the $PANDOC_MIN_VERSION is set.

Added `--wrap=preserve` as a default argument to `pandoc(1)`.
While this change will impact every HTML file generated,
we believe this will improve the ability of someone to look
at the generated HTML and correlate with the original markdown.

Changed `bin/pandoc-wrapper.sh` VERSION from "1.4.2 2024-03-17"
to "1.4.3 2024-03-18".

Performed `make www` to achieve all of the above and to generate
HTML using the new  `--wrap=preserve` `pandoc(1)` mode.
This commit is contained in:
Landon Curt Noll committed 2024-03-18 01:26:39 -07:00
1 parent 9eb7a54e9f
commit b0b212acb1
402 files changed
+37061 -55132
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

1992/albert/index.html
+60 -89
View File
@@ -129,9 +129,9 @@
<h2 id="author"><a name="author"></a>Author:</h2>
<ul>
<li>Name: <a href="../../authors.html#Albert_van_der_Horst">Albert van
der Horst</a><br> Location: <a href="../../location.html#NL">NL</a> -
<em>Kingdom of the Netherlands</em> (<em>Netherlands</em>) <br><br></li>
<li>Name: <a href="../../authors.html#Albert_van_der_Horst">Albert van der Horst</a><br>
Location: <a href="../../location.html#NL">NL</a> - <em>Kingdom of the Netherlands</em> (<em>Netherlands</em>)
<br><br></li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-author.sh -->
@@ -141,21 +141,19 @@ der Horst</a><br> Location: <a href="../../location.html#NL">NL</a> -
<h2 id="to-build">To build:</h2>
<div class="sourceCode" id="cb1"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb1-1"><a href="#cb1-1" aria-hidden="true" tabindex="-1"></a><span class="fu">make</span> all</span></code></pre></div>
<p>An <a href="#alternate-code">alternate version</a> exists that fixes
a bug.</p>
<p>An <a href="#alternate-code">alternate version</a> exists that fixes a bug.</p>
<h3 id="bugs-and-misfeatures">Bugs and (Mis)features:</h3>
<p>The current status of this entry is:</p>
<pre><code>STATUS: known bug - please help us fix</code></pre>
<p>For more detailed information see <a
href="../../bugs.html#1992_albert">1992 albert bugs</a>.</p>
<p>For more detailed information see <a href="../../bugs.html#1992_albert">1992 albert bugs</a>.</p>
<h2 id="to-use">To use:</h2>
<div class="sourceCode" id="cb3"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb3-1"><a href="#cb3-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./albert</span> number</span></code></pre></div>
<h2 id="try">Try:</h2>
<div class="sourceCode" id="cb4"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb4-1"><a href="#cb4-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./try.sh</span></span></code></pre></div>
<h2 id="alternate-code">Alternate code:</h2>
<p>An alternate version of this entry, <a
href="albert.alt.c">albert.alt.c</a>, is provided. Leo Broukhis, before
he was an IOCCC judge, sent the IOCCC judges this Email message:</p>
<p>An alternate version of this entry, <a href="albert.alt.c">albert.alt.c</a>, is provided.
Leo Broukhis, before he was an IOCCC judge, sent the IOCCC
judges this Email message:</p>
<pre><code>From: leo _at_ zycad -dot- com (Leo Broukhis)
Date: Tue, 30 Jan 96 17:37:51 PST
To: judges _at_ toad -dot- com
@@ -170,124 +168,97 @@ in albert.orig.c that has been fixed in albert.c,
I&#39;ve found a number exposing another bug: 10000000001 (that&#39;s 9 0&#39;s).
Both albert and albert.orig loop without printing anything, although
the first factor is 101 and is usually found in an instant.</code></pre>
<p>The <a href="albert.c">albert.alt.c</a> file is the fixed file,
whereas the <a href="albert.c">albert.c</a> is the file before applying
Leo Broukhis’ fix.</p>
<p>The <a href="albert.c">albert.alt.c</a> file is the fixed file, whereas the
<a href="albert.c">albert.c</a> is the file before applying Leo Broukhis’ fix.</p>
<h3 id="alternate-build">Alternate build:</h3>
<p>To compile this alternate version:</p>
<div class="sourceCode" id="cb6"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb6-1"><a href="#cb6-1" aria-hidden="true" tabindex="-1"></a><span class="fu">make</span> alt</span></code></pre></div>
<h3 id="alternate-use">Alternate use:</h3>
<p>Use <code>albert.alt</code> as you would <code>albert</code>
above.</p>
<p>Use <code>albert.alt</code> as you would <code>albert</code> above.</p>
<h3 id="alternate-try">Alternate try:</h3>
<div class="sourceCode" id="cb7"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb7-1"><a href="#cb7-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./try.alt.sh</span></span></code></pre></div>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>We were impressed with the speed at which it was able to factor
arbitrarily large numbers consisting of factors that fit into a
long.</p>
arbitrarily large numbers consisting of factors that fit into
a long.</p>
<h2 id="authors-remarks">Author’s remarks:</h2>
<p>The Obfuscated version of the Horst algorithm.</p>
<p>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.</p>
<p>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.</p>
<p>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.</p>
<p>Or you may type <code>./albert &lt;some-number&gt;</code> A nice one
is also (30 ones):</p>
factors in ascending order. Numbers of one digit (e.g. 8)
are rejected without notice.</p>
<p>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.</p>
<p>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.</p>
<p>Or you may type <code>./albert &lt;some-number&gt;</code>
A nice one is also (30 ones):</p>
<div class="sourceCode" id="cb8"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb8-1"><a href="#cb8-1" aria-hidden="true" tabindex="-1"></a><span class="ex">./albert</span> 111111111111111111111111111111</span></code></pre></div>
<p>Apart from the foregoing there are no special execution
instructions.</p>
<p>Apart from the foregoing there are no special execution instructions.</p>
<p>To customize the program into a factorizer of a fixed number, use</p>
<div class="sourceCode" id="cb9"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb9-1"><a href="#cb9-1" aria-hidden="true" tabindex="-1"></a><span class="fu">cc</span> albert.c <span class="at">-o</span> 4294967297</span></code></pre></div>
<p>or some such.</p>
<p>There are no data files used, and it is not possible to feed input
via <code>stdin</code>.</p>
<p>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.</p>
<p>The strict naming conventions for subroutines did not make things
much clearer after all, but it was not supposed to.</p>
<p>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.</p>
<p>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&amp;R program. Defeating this through casts
does not make a program cleaner in my opinion.</p>
<p>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.</p>
<p>The strict naming conventions for subroutines did not make things much clearer
after all, but it was not supposed to.</p>
<p>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.</p>
<p>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&amp;R program. Defeating this through casts does not make a program
cleaner in my opinion.</p>
<h3 id="hints">Hints</h3>
<p>Here are some hints, but they may not be too helpful:</p>
<ol type="1">
<li>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.</li>
<li>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.</li>
<li>Does fractal programming exist after all?</li>
<li>You remember the Toom-Cook algorithm in Knuth? It uses iteration
instead of recursion and is quite jumpy. This program shares these
disadvantages in a modified form.</li>
<li>You remember the Toom-Cook algorithm in Knuth? It uses iteration instead of
recursion and is quite jumpy. This program shares these disadvantages in a
modified form.</li>
<li>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”.</li>
</ol>
<h2 id="copyright-and-cc-by-sa-4.0-license">Copyright and CC BY-SA 4.0
License:</h2>
<p>This file is Copyright (c) 2023 by Landon Curt Noll. All Rights
Reserved. You are free to share and adapt this file under the terms of
this license:</p>
<h2 id="copyright-and-cc-by-sa-4.0-license">Copyright and CC BY-SA 4.0 License:</h2>
<p>This file is Copyright (c) 2023 by Landon Curt Noll. All Rights Reserved.
You are free to share and adapt this file under the terms of this license:</p>
<pre><code>Creative Commons Attribution-ShareAlike 4.0 International (CC BY-SA 4.0)</code></pre>
<p>For more information, see:
https://creativecommons.org/licenses/by-sa/4.0/</p>
<p>For more information, see: https://creativecommons.org/licenses/by-sa/4.0/</p>
<!-- END: this line ends content for HTML phase 21 by: bin/pandoc-wrapper.sh via bin/md2html.sh -->
<!-- START: this line starts content for HTML phase 22 by: bin/output-index-inventory.sh via bin/md2html.sh -->
<!-- START: this line starts content generated by: bin/output-index-inventory.sh -->
<h1 id="inventory-for-1992albert"><a name="inventory"></a>Inventory for
1992/albert</h1>
<h1 id="inventory-for-1992albert"><a name="inventory"></a>Inventory for 1992/albert</h1>
<p><a href="#top">Jump to top</a></p>
<h2 id="primary-files">Primary files</h2>
<ul>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/albert.c">albert.c</a>
- entry source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/Makefile">Makefile</a>
- entry Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/albert.alt.c">albert.alt.c</a>
- alternative source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/albert.orig.c">albert.orig.c</a>
- original source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/try.alt.sh">try.alt.sh</a>
- how to run alternative code</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/try.sh">try.sh</a>
- how to run</li>
<li><a href="1992_albert.tar.bz2">1992_albert.tar.bz2</a> - download
entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/albert.c">albert.c</a> - entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/Makefile">Makefile</a> - entry Makefile</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/albert.alt.c">albert.alt.c</a> - alternative source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/albert.orig.c">albert.orig.c</a> - original source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/try.alt.sh">try.alt.sh</a> - how to run alternative code</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/try.sh">try.sh</a> - how to run</li>
<li><a href="1992_albert.tar.bz2">1992_albert.tar.bz2</a> - download entry source</li>
</ul>
<h2 id="secondary-files">Secondary files</h2>
<ul>
<li><a href="index.html">index.html</a> - entry home page</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/.entry.json">.entry.json</a>
- description of entry in JSON</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/.gitignore">.gitignore</a>
- list of files that should not be committed under git</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/.entry.json">.entry.json</a> - description of entry in JSON</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/.gitignore">.gitignore</a> - list of files that should not be committed under git</li>
<li><a href=".path">.path</a> - directory path from top directory</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/README.md">README.md</a>
- markdown source for index.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1992/albert/README.md">README.md</a> - markdown source for index.html</li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->