force use of pandoc version >= 3.1.12.2
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
1 parent
9eb7a54e9f
commit
b0b212acb1
402 files changed
+37061
-55132
No files matched your search
+104
-165
@@ -129,9 +129,9 @@
|
||||
|
||||
<h2 id="author"><a name="author"></a>Author:</h2>
|
||||
<ul>
|
||||
<li>Name: <a href="../../authors.html#Seonghoon_Kang">Seonghoon
|
||||
Kang</a><br> Location: <a href="../../location.html#KR">KR</a> -
|
||||
<em>Republic of Korea</em> (<em>South Korea</em>) <br><br></li>
|
||||
<li>Name: <a href="../../authors.html#Seonghoon_Kang">Seonghoon Kang</a><br>
|
||||
Location: <a href="../../location.html#KR">KR</a> - <em>Republic of Korea</em> (<em>South Korea</em>)
|
||||
<br><br></li>
|
||||
</ul>
|
||||
|
||||
<!-- END: next line ends content generated by: bin/output-index-author.sh -->
|
||||
@@ -141,9 +141,8 @@ Kang</a><br> Location: <a href="../../location.html#KR">KR</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></span></code></pre></div>
|
||||
<p>There is alternate code which fixes some German at the expense of
|
||||
other German. See <a href="#alternate-code">Alternate code</a> below for
|
||||
the (fun) rationale here.</p>
|
||||
<p>There is alternate code which fixes some German at the expense of other German.
|
||||
See <a href="#alternate-code">Alternate code</a> below for the (fun) rationale here.</p>
|
||||
<h2 id="to-use">To use:</h2>
|
||||
<div class="sourceCode" id="cb2"><pre class="sourceCode sh"><code class="sourceCode bash"><span id="cb2-1"><a href="#cb2-1" aria-hidden="true" tabindex="-1"></a><span class="bu">echo</span> <span class="st">"full spelling of an English cardinal numeral less than a quadrillion"</span> <span class="kw">|</span> <span class="ex">./kang</span></span></code></pre></div>
|
||||
<h2 id="try">Try:</h2>
|
||||
@@ -152,18 +151,17 @@ the (fun) rationale here.</p>
|
||||
<span id="cb3-3"><a href="#cb3-3" aria-hidden="true" tabindex="-1"></a><span class="ex">./en.sh</span> <span class="co"># English 0 through 13</span></span>
|
||||
<span id="cb3-4"><a href="#cb3-4" aria-hidden="true" tabindex="-1"></a></span>
|
||||
<span id="cb3-5"><a href="#cb3-5" aria-hidden="true" tabindex="-1"></a><span class="ex">./de.sh</span> <span class="co"># German 0 through 13 with both umlauts and without (additional 'e')</span></span></code></pre></div>
|
||||
<p>How does it have no <code>u</code> or <code>o</code> in a string in
|
||||
the source code and yet it gets <code>uno</code> right?</p>
|
||||
<p>How does it have no <code>u</code> or <code>o</code> in a string in the source code and yet it gets
|
||||
<code>uno</code> right?</p>
|
||||
<h2 id="alternate-code">Alternate code:</h2>
|
||||
<p>This alternate code fixes the program that would throw off those who
|
||||
know German where the sound of ‘V’ is ‘F’ and so the program had the
|
||||
letter be ‘F’. A problem, however, with changing it is that it breaks
|
||||
other words including in German. Thus there is the alternate version
|
||||
instead which fixes a problem for Germans that causes problems for
|
||||
Germans so if you’re German you’ll just have to deal with it :-) It also
|
||||
breaks other words too and this happens only for one letter change. With
|
||||
this one should hopefully be able to really appreciate the subtlety of
|
||||
this entry even more.</p>
|
||||
<p>This alternate code fixes the program that would throw off those who know German
|
||||
where the sound of ‘V’ is ‘F’ and so the program had the letter be ‘F’. A
|
||||
problem, however, with changing it is that it breaks other words including in
|
||||
German. Thus there is the alternate version instead which fixes a problem for
|
||||
Germans that causes problems for Germans so if you’re German you’ll just have to
|
||||
deal with it :-) It also breaks other words too and this happens only for one
|
||||
letter change. With this one should hopefully be able to really appreciate the
|
||||
subtlety of this entry even more.</p>
|
||||
<h3 id="alternate-build">Alternate build:</h3>
|
||||
<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="fu">make</span> alt</span></code></pre></div>
|
||||
<h3 id="alternate-use">Alternate use:</h3>
|
||||
@@ -178,14 +176,13 @@ this entry even more.</p>
|
||||
<span id="cb6-3"><a href="#cb6-3" aria-hidden="true" tabindex="-1"></a><span class="ex">./en.alt.sh</span> <span class="co"># English 0 through 13</span></span>
|
||||
<span id="cb6-4"><a href="#cb6-4" aria-hidden="true" tabindex="-1"></a></span>
|
||||
<span id="cb6-5"><a href="#cb6-5" aria-hidden="true" tabindex="-1"></a><span class="ex">./de.alt.sh</span> <span class="co"># German 0 through 13 with both umlauts and without (additional 'e')</span></span></code></pre></div>
|
||||
<p>What does it get right? What does it get wrong? How does it compare
|
||||
to the original entry without the change of <code>f</code> to
|
||||
<code>v</code>?</p>
|
||||
<p>What does it get right? What does it get wrong? How does it compare to the
|
||||
original entry without the change of <code>f</code> to <code>v</code>?</p>
|
||||
<p>Finally why does it get wrong what it gets wrong?</p>
|
||||
<h2 id="judges-remarks">Judges’ remarks:</h2>
|
||||
<p>The judges were able to appreciate the Indo-European language family
|
||||
relation by making this entry successfully recognize <em>some</em>
|
||||
French, German, Italian, Russian, and Spanish numerals.</p>
|
||||
relation by making this entry successfully recognize <em>some</em> French,
|
||||
German, Italian, Russian, and Spanish numerals.</p>
|
||||
<p>Also worth mentioning is this entry’s ability to understand the
|
||||
colloquial year numbers of the last millennium.</p>
|
||||
<p>We’ve added a linefeed to the print format for convenience.</p>
|
||||
@@ -196,92 +193,72 @@ colloquial year numbers of the last millennium.</p>
|
||||
<p>does not report 100, instead printing 0?</p>
|
||||
<h2 id="authors-remarks">Author’s remarks:</h2>
|
||||
<h3 id="synopsis">Synopsis</h3>
|
||||
<p>This short program reads a spelt number (e.g. <code>forty-two</code>)
|
||||
and writes a corresponding decimal number (e.g. <code>42</code>). Too
|
||||
long for one-liners, alas, but it still qualifies as a <em>short</em>
|
||||
program as it has less than 0x100 bytes.</p>
|
||||
<p>This short program reads a spelt number (e.g. <code>forty-two</code>) and writes a
|
||||
corresponding decimal number (e.g. <code>42</code>). Too long for one-liners, alas,
|
||||
but it still qualifies as a <em>short</em> program as it has less than 0x100 bytes.</p>
|
||||
<p>It accepts a variety of spelt numbers:</p>
|
||||
<ul>
|
||||
<li>It correctly handles <code>zero</code>.</li>
|
||||
<li>Hyphen does not make a difference: <code>forty-two</code> and
|
||||
<code>forty two</code> are same. So does period or comma.</li>
|
||||
<li>Cases do not make a difference either: <code>TWO</code>,
|
||||
<code>Two</code>, <code>two</code> are the same.</li>
|
||||
<li><code>one</code> and <code>a</code> are interchangeable:
|
||||
<code>one hundred</code> and <code>a hundred</code> are the same.</li>
|
||||
<li><code>and</code> is optional: <code>one hundred twenty-three</code>
|
||||
and <code>one hundred and twenty-three</code> are the same.</li>
|
||||
<li>It supports every non-negative integer less than 10<sup>15</sup>-1.
|
||||
It uses the small scale (i.e. American): <code>billion</code> is
|
||||
10<sup>9</sup> and <code>trillion</code> is 10<sup>12</sup>.</li>
|
||||
<li>Hyphen does not make a difference: <code>forty-two</code> and <code>forty two</code> are same.
|
||||
So does period or comma.</li>
|
||||
<li>Cases do not make a difference either: <code>TWO</code>, <code>Two</code>, <code>two</code> are the same.</li>
|
||||
<li><code>one</code> and <code>a</code> are interchangeable: <code>one hundred</code> and <code>a hundred</code> are the same.</li>
|
||||
<li><code>and</code> is optional: <code>one hundred twenty-three</code> and <code>one hundred and twenty-three</code>
|
||||
are the same.</li>
|
||||
<li>It supports every non-negative integer less than 10<sup>15</sup>-1. It uses
|
||||
the small scale (i.e. American): <code>billion</code> is 10<sup>9</sup> and <code>trillion</code> is
|
||||
10<sup>12</sup>.</li>
|
||||
<li>Sometimes, it can magically correct typos.</li>
|
||||
</ul>
|
||||
<p>It does <em>not</em> accept some spelt numbers, which I found mostly
|
||||
irrelevant:</p>
|
||||
<p>It does <em>not</em> accept some spelt numbers, which I found mostly irrelevant:</p>
|
||||
<ul>
|
||||
<li>A bare <code>hundred</code>, <code>thousand</code> etc. do not
|
||||
work.</li>
|
||||
<li><code>one million million</code> does not work. Get used to
|
||||
<code>one trillion</code>!</li>
|
||||
<li>A bare <code>hundred</code>, <code>thousand</code> etc. do not work.</li>
|
||||
<li><code>one million million</code> does not work. Get used to <code>one trillion</code>!</li>
|
||||
</ul>
|
||||
<h3 id="requirements">Requirements</h3>
|
||||
<p>This program is quite portable, only requiring the following:</p>
|
||||
<ul>
|
||||
<li>The signature <code>int main(int, int)</code> should be accepted by
|
||||
the linker. (Original version only).</li>
|
||||
<li><code>char</code> should be at least 1 byte long (as dictated by the
|
||||
standard), <code>int</code> should be at least 32 bits long,
|
||||
<code>long long</code> should be at least 64 bits long.</li>
|
||||
<li>Both the compiler and execution environment should use an
|
||||
ASCII-compatible character set and two’s complement representation.</li>
|
||||
<li>Overflow and underflow on <code>char</code> should wrap around, if
|
||||
your <code>char</code> is unsigned.</li>
|
||||
<li><a href="http://cm.bell-labs.com/who/ken/trust.html">A trustworthy
|
||||
compiler</a>.</li>
|
||||
<li>The signature <code>int main(int, int)</code> should be accepted by the linker. (Original
|
||||
version only).</li>
|
||||
<li><code>char</code> should be at least 1 byte long (as dictated by the standard), <code>int</code>
|
||||
should be at least 32 bits long, <code>long long</code> should be at least 64 bits long.</li>
|
||||
<li>Both the compiler and execution environment should use an ASCII-compatible
|
||||
character set and two’s complement representation.</li>
|
||||
<li>Overflow and underflow on <code>char</code> should wrap around, if your <code>char</code> is unsigned.</li>
|
||||
<li><a href="http://cm.bell-labs.com/who/ken/trust.html">A trustworthy compiler</a>.</li>
|
||||
</ul>
|
||||
<p>The design of the program explicitly allows for <code>EOF</code> even
|
||||
if it does not equal <code>-1</code> (it has to be negative per the
|
||||
standard but not necessarily <code>-1</code>) and both
|
||||
<code>signed char</code> and <code>unsigned char</code>, for example.
|
||||
Furthermore it is endian-independent.</p>
|
||||
<p>The design of the program explicitly allows for <code>EOF</code> even if it does not equal
|
||||
<code>-1</code> (it has to be negative per the standard but not necessarily <code>-1</code>) and both
|
||||
<code>signed char</code> and <code>unsigned char</code>, for example. Furthermore it is
|
||||
endian-independent.</p>
|
||||
<h3 id="obfuscations-spoilers">Obfuscations (SPOILERS!)</h3>
|
||||
<p>Many obfuscations used are typical for standard IOCCC entries:</p>
|
||||
<ul>
|
||||
<li>Two arguments from <code>main()</code> function are reused as normal
|
||||
variables.</li>
|
||||
<li>Every conditional has been replaced with the <code>?:</code> ternary
|
||||
operator and <code>||</code> short-circuiting operator.</li>
|
||||
<li>It has exactly three nested <code>for</code> loops and nothing
|
||||
else.</li>
|
||||
<li>Common two’s complement tricks: <code>~-a</code> instead of
|
||||
<code>a-1</code>, <code>~a?...:...</code> instead of
|
||||
<code>a!=-1?...:...</code>, etc.</li>
|
||||
<li>Comma operators (<code>,</code>) for multiple statements. The number
|
||||
of them is minimized, however, as it is too easy to (ab)use them.</li>
|
||||
<li>It lacks most parentheses around bitwise and arithmetic operators.
|
||||
It was originally written for shortness so parentheses were
|
||||
<strong>EVIL</strong>.</li>
|
||||
<li><code>n["string"]</code> instead of <code>"string"[n]</code>. Both
|
||||
are fine for this program but I went to the former just for fun.</li>
|
||||
<li>Utter lack of any kind of layouts. (Oh, except for the first
|
||||
column.)</li>
|
||||
<li>Two arguments from <code>main()</code> function are reused as normal variables.</li>
|
||||
<li>Every conditional has been replaced with the <code>?:</code> ternary operator and <code>||</code>
|
||||
short-circuiting operator.</li>
|
||||
<li>It has exactly three nested <code>for</code> loops and nothing else.</li>
|
||||
<li>Common two’s complement tricks: <code>~-a</code> instead of <code>a-1</code>,
|
||||
<code>~a?...:...</code> instead of <code>a!=-1?...:...</code>, etc.</li>
|
||||
<li>Comma operators (<code>,</code>) for multiple statements. The number of them is
|
||||
minimized, however, as it is too easy to (ab)use them.</li>
|
||||
<li>It lacks most parentheses around bitwise and arithmetic operators. It was
|
||||
originally written for shortness so parentheses were <strong>EVIL</strong>.</li>
|
||||
<li><code>n["string"]</code> instead of <code>"string"[n]</code>. Both are fine for this program but
|
||||
I went to the former just for fun.</li>
|
||||
<li>Utter lack of any kind of layouts. (Oh, except for the first column.)</li>
|
||||
</ul>
|
||||
<p>Other obfuscations are more subtle:</p>
|
||||
<ul>
|
||||
<li>The string <code>"1+DIY/.K430x9G(kC["</code> is 18 bytes long, but
|
||||
actually 19 bytes including the final NUL character are used.</li>
|
||||
<li>It internally represents numbers as hexadecimal. When the input is
|
||||
<code>two hundred and three</code>, it actually writes
|
||||
<code>0x203</code> as hexadecimal.</li>
|
||||
<li>The string <code>"1+DIY/.K430x9G(kC["</code> is 18 bytes long, but actually 19 bytes
|
||||
including the final NUL character are used.</li>
|
||||
<li>It internally represents numbers as hexadecimal. When the input is <code>two hundred and three</code>, it actually writes <code>0x203</code> as hexadecimal.</li>
|
||||
<li>Some variables (notably, <code>n</code>) have dual uses.</li>
|
||||
<li>The magic number <a
|
||||
href="http://en.wikipedia.org/wiki/Answer_to_The_Ultimate_Question_of_Life,_the_Universe,_and_Everything">42</a>
|
||||
makes an appearance.</li>
|
||||
<li>The magic number <a href="http://en.wikipedia.org/wiki/Answer_to_The_Ultimate_Question_of_Life,_the_Universe,_and_Everything">42</a> makes an appearance.</li>
|
||||
<li>It has a long long numb-<code>main</code>-er within it!</li>
|
||||
</ul>
|
||||
<p>But the most important obfuscation is the clever construction of
|
||||
lookup table. The program uses 11 different characters required for
|
||||
recognizing 22 lexemes:</p>
|
||||
<p>But the most important obfuscation is the clever construction of lookup table.
|
||||
The program uses 11 different characters required for recognizing 22 lexemes:</p>
|
||||
<pre><code>zero one tw- th(i)r- fo(u)r- fi- six-
|
||||
seven- eigh- nin- ten eleven twelve
|
||||
hundred(s) thousand(s) million(s) billion(s) trillion(s)
|
||||
@@ -291,101 +268,63 @@ a and -teen -ty</code></pre>
|
||||
sn- g- nn- tn ln twl
|
||||
nr(s) tsan(s) lln(s) blln(s) trlln(s)
|
||||
a an -tn -ty</code></pre>
|
||||
<p>The stemmer recognizes the longest matching prefix, so every lexeme
|
||||
can be recognized by at most three characters (e.g. <code>trl</code>
|
||||
instead of <code>trlln</code>). This is also handy for ignoring plurals.
|
||||
But that would make it so that the table does not fit in the printable
|
||||
byte—11<sup>2</sup> is already almost 2<sup>7</sup>!</p>
|
||||
<p>The trick is to use octal; three characters (<code>a</code>,
|
||||
<code>b</code> and <code>g</code>) are interpreted as sequences of two
|
||||
characters (<code>ny</code>, <code>nn</code> and <code>nw</code>
|
||||
respectively). Asides from a smaller lookup table, it has many good
|
||||
consequences:</p>
|
||||
<p>The stemmer recognizes the longest matching prefix, so every lexeme can be
|
||||
recognized by at most three characters (e.g. <code>trl</code> instead of <code>trlln</code>). This is
|
||||
also handy for ignoring plurals. But that would make it so that the table does not fit
|
||||
in the printable byte—11<sup>2</sup> is already almost 2<sup>7</sup>!</p>
|
||||
<p>The trick is to use octal; three characters (<code>a</code>, <code>b</code> and <code>g</code>) are interpreted
|
||||
as sequences of two characters (<code>ny</code>, <code>nn</code> and <code>nw</code> respectively). Asides from
|
||||
a smaller lookup table, it has many good consequences:</p>
|
||||
<ul>
|
||||
<li>Both <code>a</code> and <code>and</code> share the common prefix,
|
||||
<code>ny</code>, and can be discarded altogether. Note that
|
||||
<code>ny</code> itself does not appear from other entries.</li>
|
||||
<li><code>thousand</code> is interpreted as <code>tsan</code>, which is
|
||||
equivalent to <code>tfyn</code> in the octal scheme. As it is the only
|
||||
entry with <code>tf</code> prefix, it can be shorten by one
|
||||
character.</li>
|
||||
<li>Both <code>a</code> and <code>and</code> share the common prefix, <code>ny</code>, and can be discarded
|
||||
altogether. Note that <code>ny</code> itself does not appear from other entries.</li>
|
||||
<li><code>thousand</code> is interpreted as <code>tsan</code>, which is equivalent to <code>tfyn</code> in the
|
||||
octal scheme. As it is the only entry with <code>tf</code> prefix, it can be shorten by
|
||||
one character.</li>
|
||||
</ul>
|
||||
<p>Having said this important trick, other details should be relatively
|
||||
easier to follow. The order of lookup table, for example, is very
|
||||
important, and the biggest constant 6177 is not arbitrarily chosen.</p>
|
||||
<p>More spoilers can be found at <a
|
||||
href="https://gist.github.com/lifthrasiir/3909337"
|
||||
class="uri">https://gist.github.com/lifthrasiir/3909337</a></p>
|
||||
<p>Having said this important trick, other details should be relatively easier to
|
||||
follow. The order of lookup table, for example, is very important,
|
||||
and the biggest constant 6177 is not arbitrarily chosen.</p>
|
||||
<p>More spoilers can be found at <a href="https://gist.github.com/lifthrasiir/3909337" class="uri">https://gist.github.com/lifthrasiir/3909337</a></p>
|
||||
<h3 id="acknowledgement">Acknowledgement</h3>
|
||||
<p>The cleaner (size-optimized) version of this program was originally
|
||||
published in my website in July 2011. Sun Park and others have reviewed
|
||||
it and made me aware of possible improvements. I’d also like to thank
|
||||
Seo Sanghyeon for proof-reading remarks.</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>The cleaner (size-optimized) version of this program was originally published
|
||||
in my website in July 2011. Sun Park and others have reviewed it and made me
|
||||
aware of possible improvements. I’d also like to thank Seo Sanghyeon for
|
||||
proof-reading remarks.</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-2012kang"><a name="inventory"></a>Inventory for
|
||||
2012/kang</h1>
|
||||
<h1 id="inventory-for-2012kang"><a name="inventory"></a>Inventory for 2012/kang</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/2012/kang/kang.c">kang.c</a>
|
||||
- entry source</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/Makefile">Makefile</a>
|
||||
- entry Makefile</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/kang.alt.c">kang.alt.c</a>
|
||||
- alternative source</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/kang.orig.c">kang.orig.c</a>
|
||||
- original source</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/de.alt.sh">de.alt.sh</a>
|
||||
- German words for 0 through 13 for alt</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/de.sh">de.sh</a>
|
||||
- German words for 0 through 13</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/en.alt.sh">en.alt.sh</a>
|
||||
- English words for 1 through 13 for alt</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/en.sh">en.sh</a>
|
||||
- English words for 1 through 13</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/try.alt.sh">try.alt.sh</a>
|
||||
- how to run alternate code</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/try.sh">try.sh</a>
|
||||
- how to run</li>
|
||||
<li><a href="2012_kang.tar.bz2">2012_kang.tar.bz2</a> - download entry
|
||||
source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/kang.c">kang.c</a> - entry source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/Makefile">Makefile</a> - entry Makefile</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/kang.alt.c">kang.alt.c</a> - alternative source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/kang.orig.c">kang.orig.c</a> - original source</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/de.alt.sh">de.alt.sh</a> - German words for 0 through 13 for alt</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/de.sh">de.sh</a> - German words for 0 through 13</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/en.alt.sh">en.alt.sh</a> - English words for 1 through 13 for alt</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/en.sh">en.sh</a> - English words for 1 through 13</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/try.alt.sh">try.alt.sh</a> - how to run alternate code</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/try.sh">try.sh</a> - how to run</li>
|
||||
<li><a href="2012_kang.tar.bz2">2012_kang.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/2012/kang/.entry.json">.entry.json</a>
|
||||
- description of entry in JSON</li>
|
||||
<li><a
|
||||
href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/.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/2012/kang/.entry.json">.entry.json</a> - description of entry in JSON</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/.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/2012/kang/README.md">README.md</a>
|
||||
- markdown source for index.html</li>
|
||||
<li><a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2012/kang/README.md">README.md</a> - markdown source for index.html</li>
|
||||
</ul>
|
||||
|
||||
<!-- END: next line ends content generated by: bin/output-index-inventory.sh -->
|
||||
|
||||
Reference in new issue
Block a user