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

1990/baruch/index.html
+47 -77
View File
@@ -129,12 +129,12 @@
<h2 id="authors"><a name="author"></a>Authors:</h2>
<ul>
<li>Name: <a href="../../authors.html#Baruch_Nissenbaum">Baruch
Nissenbaum</a><br> Location: <a href="../../location.html#IL">IL</a> -
<em>State of Israel</em> (<em>Israel</em>) <br><br></li>
<li>Name: <a href="../../authors.html#Doron_Osovlanski">Doron
Osovlanski</a><br> Location: <a href="../../location.html#IL">IL</a> -
<em>State of Israel</em> (<em>Israel</em>) <br><br></li>
<li>Name: <a href="../../authors.html#Baruch_Nissenbaum">Baruch Nissenbaum</a><br>
Location: <a href="../../location.html#IL">IL</a> - <em>State of Israel</em> (<em>Israel</em>)
<br><br></li>
<li>Name: <a href="../../authors.html#Doron_Osovlanski">Doron Osovlanski</a><br>
Location: <a href="../../location.html#IL">IL</a> - <em>State of Israel</em> (<em>Israel</em>)
<br><br></li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-author.sh -->
@@ -144,49 +144,43 @@ Osovlanski</a><br> Location: <a href="../../location.html#IL">IL</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>There is an alternate version for those using Turbo-C or MSC. See <a
href="#alternate-code">alternate code</a> below for details.</p>
<p>There is an alternate version for those using Turbo-C or MSC. See <a href="#alternate-code">alternate
code</a> below for details.</p>
<h3 id="bugs-and-misfeatures">Bugs and (Mis)features:</h3>
<p>The current status of this entry is:</p>
<pre><code>STATUS: INABIAF - please **DO NOT** fix</code></pre>
<p>For more detailed information see <a
href="../../bugs.html#1990_baruch">1990 baruch bugs</a>.</p>
<p>For more detailed information see <a href="../../bugs.html#1990_baruch">1990 baruch 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="bu">echo</span> 4 <span class="kw">|</span> <span class="ex">./baruch</span></span>
<span id="cb3-2"><a href="#cb3-2" aria-hidden="true" tabindex="-1"></a><span class="bu">echo</span> 7 <span class="kw">|</span> <span class="ex">./baruch</span></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>This alternate code is for the <a
href="https://en.wikipedia.org/wiki/0">very few</a> <a
href="https://en.wikipedia.org/wiki/Microsoft_Windows">users</a> <a
href="https://www.ioccc.org">here</a> who will need it. Nonetheless if
you’re using Turbo-C or MSC, the code is available, based on the
authors’ remarks except that the <code>" #Q"</code> string was not
changed as that showed worse looking output instead of improved output
though admittedly we have no way to test the compilers in question.
YMMV.</p>
<p>This alternate code is for the <a href="https://en.wikipedia.org/wiki/0">very few</a>
<a href="https://en.wikipedia.org/wiki/Microsoft_Windows">users</a>
<a href="https://www.ioccc.org">here</a> who will need it. Nonetheless if you’re using
Turbo-C or MSC, the code is available, based on the authors’ remarks except that
the <code>" #Q"</code> string was not changed as that showed worse looking output instead
of improved output though admittedly we have no way to test the compilers in
question. YMMV.</p>
<h3 id="alternate-build">Alternate build:</h3>
<div class="sourceCode" id="cb5"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb5-1"><a href="#cb5-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>baruch.alt</code> as you would <code>baruch</code>.</p>
<h2 id="judges-remarks">Judges’ remarks:</h2>
<p>This program reads an integer between 4 and 99 from the
<code>stdin</code>.</p>
<p>NOTE: The original program did not have a newline at the end of the
file. We added a final newline to the file to make unpacking easy.</p>
<p>This program reads an integer between 4 and 99 from the <code>stdin</code>.</p>
<p>NOTE: The original program did not have a newline at the end of the file. We
added a final newline to the file to make unpacking easy.</p>
<h2 id="authors-remarks">Authors’ remarks:</h2>
<p>The goal of this work was to write a program that solves the classic
<a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle">n-queens
problem</a>, with a board size of up to 99x99, while keeping the program
as short as possible.</p>
<p>The goal of this work was to write a program that solves the classic <a href="https://en.wikipedia.org/wiki/Eight_queens_puzzle">n-queens
problem</a>, with a board size
of up to 99x99, while keeping the program as short as possible.</p>
<p>The program finds all possibilities to place N chess queens on an NxN
<a href="https://en.wikipedia.org/wiki/Chessboard">chessboard</a> so
that no queen is in range of any other queen (not in the same column row
or diagonal). For each solution the chess board and the place of the
queens is printed to stdout.</p>
<p>This program is about as simple and as readable as possible. To make
things even more simple we used a very limited subset of C:</p>
<a href="https://en.wikipedia.org/wiki/Chessboard">chessboard</a> so that no queen is in
range of any other queen (not in the same column row or diagonal). For each
solution the chess board and the place of the queens is printed to stdout.</p>
<p>This program is about as simple and as readable as possible. To make things
even more simple we used a very limited subset of C:</p>
<ul>
<li>No pre-processor statements</li>
<li>Only one, harmless, <code>for</code> statement</li>
@@ -197,66 +191,42 @@ things even more simple we used a very limited subset of C:</p>
<li>No <code>goto</code>s</li>
<li>No structures</li>
</ul>
<p>In short, it contains no C language that might confuse the innocent
reader. :-)</p>
<p>This program demonstrates the claim that in C, any program can be
written using a single ‘for’ statement, as long as it is long
enough.</p>
<p>In short, it contains no C language that might confuse the innocent reader. :-)</p>
<p>This program demonstrates the claim that in C, any program can be written using
a single ‘for’ statement, as long as it is long enough.</p>
<h3 id="for-pc-users">For PC users:</h3>
<p>In order to compile the program under Turbo-C or MSC,
<code>int</code> should be inserted at the beginning of the program. For
better looking results it is recommended to replace the
<code>" #Q"</code> string with <code>" \261\2"</code>.</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>
<p>In order to compile the program under Turbo-C or MSC, <code>int</code> should be inserted
at the beginning of the program. For better looking results it is recommended
to replace the <code>" #Q"</code> string with <code>" \261\2"</code>.</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-1990baruch"><a name="inventory"></a>Inventory for
1990/baruch</h1>
<h1 id="inventory-for-1990baruch"><a name="inventory"></a>Inventory for 1990/baruch</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/1990/baruch/baruch.c">baruch.c</a>
- entry source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/Makefile">Makefile</a>
- entry Makefile</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/baruch.alt.c">baruch.alt.c</a>
- alternative source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/baruch.orig.c">baruch.orig.c</a>
- original source</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/try.sh">try.sh</a>
- how to run</li>
<li><a href="1990_baruch.tar.bz2">1990_baruch.tar.bz2</a> - download
entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/baruch.c">baruch.c</a> - entry source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/Makefile">Makefile</a> - entry Makefile</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/baruch.alt.c">baruch.alt.c</a> - alternative source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/baruch.orig.c">baruch.orig.c</a> - original source</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/try.sh">try.sh</a> - how to run</li>
<li><a href="1990_baruch.tar.bz2">1990_baruch.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/1990/baruch/.entry.json">.entry.json</a>
- description of entry in JSON</li>
<li><a
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/.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/1990/baruch/.entry.json">.entry.json</a> - description of entry in JSON</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/.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/1990/baruch/README.md">README.md</a>
- markdown source for index.html</li>
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/1990/baruch/README.md">README.md</a> - markdown source for index.html</li>
</ul>
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->