fix problematic HTML caused by certain trailing backslashes
In cases that are **outside of a markdown code block**, a markdown line with ending in a tailing "\" can generate problematic HTML. We certain trailing backslashes outside of a markdown code block with "<br>" HTML elements, or in some cases eliminated the need for a trailing backslash. In a few cases some unnecessary trailing backslashes inside of a markdown code block were removed. The following markdown files were changed in this commit: ``` 1990/dds/README.md 1990/jaw/README.md 1991/ant/README.md 1991/rince/README.md 1991/westley/README.md 1992/vern/README.md 1992/westley/README.md 1998/schweikh1/README.md 2004/anonymous/README.md 2005/sykes/README.md 2006/toledo2/README.md 2011/toledo/README.md 2012/endoh2/README.md 2012/tromp/README.md 2013/robison/README.md 2015/hou/README.md 2015/howe/README.md 2015/schweikhardt/README.md 2018/burton1/README.md 2018/burton2/README.md 2018/ferguson/README.md 2018/vokes/README.md 2020/ferguson1/README.md ``` Performed `make www` to test these changes.
This commit is contained in:
Landon Curt Noll committed
1 parent
1785da1728
commit
4c3649a3c1
47 files changed
+481
-502
No files matched your search
+1
-2
@@ -85,8 +85,7 @@ Boolean expressions evaluate to 0 for false and 1 for true.
|
||||
|
||||
- Free format positioning of tokens on the line.
|
||||
- No space is allowed before the line number.
|
||||
- Exactly one space is needed between the OLD or SAVE command and\
|
||||
the filename.
|
||||
- Exactly one space is needed between the OLD or SAVE command and the filename.
|
||||
- ALL INPUT MUST BE UPPERCASE.
|
||||
|
||||
|
||||
|
||||
+1
-2
@@ -213,8 +213,7 @@ UPPER CASE.</p>
|
||||
<ul>
|
||||
<li>Free format positioning of tokens on the line.</li>
|
||||
<li>No space is allowed before the line number.</li>
|
||||
<li>Exactly one space is needed between the OLD or SAVE command and<br />
|
||||
the filename.</li>
|
||||
<li>Exactly one space is needed between the OLD or SAVE command and the filename.</li>
|
||||
<li>ALL INPUT MUST BE UPPERCASE.</li>
|
||||
</ul>
|
||||
<h3 id="limits">Limits:</h3>
|
||||
|
||||
+9
-10
@@ -64,8 +64,8 @@ directory it is run from.
|
||||
|
||||
#### Minimal, Universal File Bundling (or, Functional Obfuscation in a Self-Decoding Unix Shell Archive)
|
||||
|
||||
James A. Woods\
|
||||
Universities Space Research Association\
|
||||
James A. Woods<br>
|
||||
Universities Space Research Association<br>
|
||||
NASA Ames Research Center
|
||||
|
||||
|
||||
@@ -108,16 +108,15 @@ within a modified Shannon model of communication, the 'shark' effort aims to
|
||||
construct a "shortest program" for source decoding in the Turing-universal Unix
|
||||
environment.
|
||||
|
||||
----------------------------------------------
|
||||
```
|
||||
Oh, the shark has pretty teeth, dear--
|
||||
And he shows them pearly white
|
||||
Just a jackknife has Macheath, dear--
|
||||
And he keeps it out of sight.
|
||||
|
||||
> Oh, the shark has pretty teeth, dear--\
|
||||
> And he shows them pearly white\
|
||||
> Just a jackknife has Macheath, dear--\
|
||||
> And he keeps it out of sight.\
|
||||
> \
|
||||
> -- Bertolt Brecht, Threepenny Opera
|
||||
-- Bertolt Brecht, Threepenny Opera
|
||||
```
|
||||
|
||||
----------------------------------------------
|
||||
|
||||
### Portability
|
||||
|
||||
|
||||
+8
-12
@@ -190,8 +190,8 @@ directory it is run from.</p>
|
||||
<h2 id="authors-remarks">Authors’ remarks:</h2>
|
||||
<h3 id="abstract">ABSTRACT</h3>
|
||||
<h4 id="minimal-universal-file-bundling-or-functional-obfuscation-in-a-self-decoding-unix-shell-archive">Minimal, Universal File Bundling (or, Functional Obfuscation in a Self-Decoding Unix Shell Archive)</h4>
|
||||
<p>James A. Woods<br />
|
||||
Universities Space Research Association<br />
|
||||
<p>James A. Woods<br>
|
||||
Universities Space Research Association<br>
|
||||
NASA Ames Research Center</p>
|
||||
<hr />
|
||||
<blockquote>
|
||||
@@ -225,16 +225,12 @@ encoding schemes.</p>
|
||||
within a modified Shannon model of communication, the ‘shark’ effort aims to
|
||||
construct a “shortest program” for source decoding in the Turing-universal Unix
|
||||
environment.</p>
|
||||
<hr />
|
||||
<blockquote>
|
||||
<p>Oh, the shark has pretty teeth, dear–<br />
|
||||
And he shows them pearly white<br />
|
||||
Just a jackknife has Macheath, dear–<br />
|
||||
And he keeps it out of sight.<br />
|
||||
<br />
|
||||
– Bertolt Brecht, Threepenny Opera</p>
|
||||
</blockquote>
|
||||
<hr />
|
||||
<pre><code> Oh, the shark has pretty teeth, dear--
|
||||
And he shows them pearly white
|
||||
Just a jackknife has Macheath, dear--
|
||||
And he keeps it out of sight.
|
||||
|
||||
-- Bertolt Brecht, Threepenny Opera</code></pre>
|
||||
<h3 id="portability">Portability</h3>
|
||||
<p>We have ported this program to a wide variety of systems. Among
|
||||
these are:</p>
|
||||
|
||||
+5
-5
@@ -138,18 +138,18 @@ screen with long lines. Paging up and down should work correctly, however.
|
||||
|
||||
### References:
|
||||
|
||||
[Fin80] Craig A. Finseth, "Theory and Practice of Text Editors or\
|
||||
A Cookbook For An EMACS", TM-165, MIT Lab. for Computer\
|
||||
[Fin80] Craig A. Finseth, "Theory and Practice of Text Editors or<br>
|
||||
A Cookbook For An EMACS", TM-165, MIT Lab. for Computer<br>
|
||||
Science
|
||||
|
||||
[KeP81] Kernighan & Plauger, "Software Tools in Pascal",\
|
||||
[KeP81] Kernighan & Plauger, "Software Tools in Pascal",<br>
|
||||
Addison-Wesley, 81, chapter 6
|
||||
|
||||
[Mil86] Eugene W. Myers & Webb Miller, "Row-replacement Algorithms
|
||||
for Screen Editors", TR 86-19, Dept. of Computer Science,\
|
||||
for Screen Editors", TR 86-19, Dept. of Computer Science,<br>
|
||||
U. of Arizona
|
||||
|
||||
[MyM86] Eugene W. Myers & Webb Miller, "A simple row-replacement\
|
||||
[MyM86] Eugene W. Myers & Webb Miller, "A simple row-replacement<br>
|
||||
method", TR 86-28, Dept. of Computer Science, U. of Arizona
|
||||
|
||||
[Mil87] Webb Miller, "A Software Tools Sampler", Prentice Hall, 87
|
||||
|
||||
+5
-5
@@ -238,15 +238,15 @@ in the same group every so often.</p>
|
||||
<p>This entry will display a file with long lines, but has trouble scrolling the
|
||||
screen with long lines. Paging up and down should work correctly, however.</p>
|
||||
<h3 id="references">References:</h3>
|
||||
<p>[Fin80] Craig A. Finseth, “Theory and Practice of Text Editors or<br />
|
||||
A Cookbook For An EMACS”, TM-165, MIT Lab. for Computer<br />
|
||||
<p>[Fin80] Craig A. Finseth, “Theory and Practice of Text Editors or<br>
|
||||
A Cookbook For An EMACS”, TM-165, MIT Lab. for Computer<br>
|
||||
Science</p>
|
||||
<p>[KeP81] Kernighan & Plauger, “Software Tools in Pascal”,<br />
|
||||
<p>[KeP81] Kernighan & Plauger, “Software Tools in Pascal”,<br>
|
||||
Addison-Wesley, 81, chapter 6</p>
|
||||
<p>[Mil86] Eugene W. Myers & Webb Miller, “Row-replacement Algorithms
|
||||
for Screen Editors”, TR 86-19, Dept. of Computer Science,<br />
|
||||
for Screen Editors”, TR 86-19, Dept. of Computer Science,<br>
|
||||
U. of Arizona</p>
|
||||
<p>[MyM86] Eugene W. Myers & Webb Miller, “A simple row-replacement<br />
|
||||
<p>[MyM86] Eugene W. Myers & Webb Miller, “A simple row-replacement<br>
|
||||
method”, TR 86-28, Dept. of Computer Science, U. of Arizona</p>
|
||||
<p>[Mil87] Webb Miller, “A Software Tools Sampler”, Prentice Hall, 87
|
||||
ISBN 0-13-822305-X, chapter 5</p>
|
||||
|
||||
@@ -87,15 +87,15 @@ Key to map:
|
||||
###### | | | /\ /--\ ==| /\ | | Directonal keys
|
||||
###### Solid Wall | ----|| \/ /\ ||---- (unlock doors of
|
||||
###### | \/ ==| \--/ \/ the same direction)
|
||||
|\
|
||||
|
|
||||
| << >> Doors. Unlocked by
|
||||
Blank space | << vvvvvv ^^^^^^ >> the above keys.
|
||||
| << >>
|
||||
|\
|
||||
|
|
||||
___ | o__O\ O__O ^__^ /O__o\
|
||||
/ \ 'Crushable' | \___/ /----\ /----\ \___/ The four sprites for
|
||||
\___/ boulder | _/_\ _/ \_ _/ \_ /_\_ your character :-)
|
||||
|\
|
||||
|
|
||||
___ uncrushable | /\ Diamonds. They can either be found lying
|
||||
/@@@\ boulder | < > around (if only!) or manufacture by pushing
|
||||
\@@@/ | \/ two 'crushable' rocks together.
|
||||
|
||||
@@ -195,15 +195,15 @@ enjoyment high.</p>
|
||||
###### | | | /\ /--\ ==| /\ | | Directonal keys
|
||||
###### Solid Wall | ----|| \/ /\ ||---- (unlock doors of
|
||||
###### | \/ ==| \--/ \/ the same direction)
|
||||
|\
|
||||
|
|
||||
| << >> Doors. Unlocked by
|
||||
Blank space | << vvvvvv ^^^^^^ >> the above keys.
|
||||
| << >>
|
||||
|\
|
||||
|
|
||||
___ | o__O\ O__O ^__^ /O__o\
|
||||
/ \ 'Crushable' | \___/ /----\ /----\ \___/ The four sprites for
|
||||
\___/ boulder | _/_\ _/ \_ _/ \_ /_\_ your character :-)
|
||||
|\
|
||||
|
|
||||
___ uncrushable | /\ Diamonds. They can either be found lying
|
||||
/@@@\ boulder | < > around (if only!) or manufacture by pushing
|
||||
\@@@/ | \/ two 'crushable' rocks together.
|
||||
|
||||
+12
-10
@@ -143,16 +143,18 @@ What happens if you make a move already made?
|
||||
Now go try and draw or better yet win (without cheating which is very easy :-) )!
|
||||
Why is win better than draw? Because everyone knows how to draw:
|
||||
|
||||
> Professor Falken: Did you ever play tic-tac-toe?\
|
||||
> Jennifer Mack: Yeah. Of course.\
|
||||
> Falken: But you don't any more.\
|
||||
> Jennifer: No.\
|
||||
> Falken: Why?\
|
||||
> Jennifer: Because it's a boring game. It's always a tie.\
|
||||
> Falken: Exactly. There's no way to win. The game itself is pointless. But back
|
||||
at the [International Obfuscated C Code Contest judges'
|
||||
room](../../judges.html) they believe that
|
||||
you can win tic-tac-toe, that there can be acceptable draws.
|
||||
```
|
||||
Professor Falken: Did you ever play tic-tac-toe?
|
||||
Jennifer Mack: Yeah. Of course.
|
||||
Falken: But you don't any more.
|
||||
Jennifer: No.
|
||||
Falken: Why?
|
||||
Jennifer: Because it's a boring game. It's always a tie.
|
||||
Falken: Exactly. There's no way to win. The game itself is pointless.
|
||||
But back at the International Obfuscated C Code Contest judges'
|
||||
room they believe that you can win tic-tac-toe, that there can
|
||||
be acceptable draws.
|
||||
```
|
||||
|
||||
This is supposed to happen. As is written in the
|
||||
[The Jargon File](http://catb.org/jargon/html/F/feature.html):
|
||||
|
||||
+10
-12
@@ -231,18 +231,16 @@ can lose if you cheat. That’s supposed to happen. Can you win any other time?<
|
||||
<p>What happens if you make a move already made?</p>
|
||||
<p>Now go try and draw or better yet win (without cheating which is very easy :-) )!
|
||||
Why is win better than draw? Because everyone knows how to draw:</p>
|
||||
<blockquote>
|
||||
<p>Professor Falken: Did you ever play tic-tac-toe?<br />
|
||||
Jennifer Mack: Yeah. Of course.<br />
|
||||
Falken: But you don’t any more.<br />
|
||||
Jennifer: No.<br />
|
||||
Falken: Why?<br />
|
||||
Jennifer: Because it’s a boring game. It’s always a tie.<br />
|
||||
Falken: Exactly. There’s no way to win. The game itself is pointless. But back
|
||||
at the <a href="../../judges.html">International Obfuscated C Code Contest judges’
|
||||
room</a> they believe that
|
||||
you can win tic-tac-toe, that there can be acceptable draws.</p>
|
||||
</blockquote>
|
||||
<pre><code> Professor Falken: Did you ever play tic-tac-toe?
|
||||
Jennifer Mack: Yeah. Of course.
|
||||
Falken: But you don't any more.
|
||||
Jennifer: No.
|
||||
Falken: Why?
|
||||
Jennifer: Because it's a boring game. It's always a tie.
|
||||
Falken: Exactly. There's no way to win. The game itself is pointless.
|
||||
But back at the International Obfuscated C Code Contest judges'
|
||||
room they believe that you can win tic-tac-toe, that there can
|
||||
be acceptable draws.</code></pre>
|
||||
<p>This is supposed to happen. As is written in the
|
||||
<a href="http://catb.org/jargon/html/F/feature.html">The Jargon File</a>:</p>
|
||||
<pre><code> That's not a bug, that's a feature.</code></pre>
|
||||
|
||||
+1
-1
@@ -125,7 +125,7 @@ initial source is gloriously difficult to peruse. In particular, the Makefile
|
||||
does:
|
||||
|
||||
``` <!---sh-->
|
||||
sed <vern.c 's/{ /(/g;s/} /)/g;s/; /#define /' | \
|
||||
sed <vern.c 's/{ /(/g;s/} /)/g;s/; /#define /' |
|
||||
sed 's/} /=/g;s/{ /i/g' >vern.tmp.c
|
||||
```
|
||||
|
||||
|
||||
@@ -235,7 +235,7 @@ at build time into much-needed text. Without this hack the program
|
||||
wouldn’t pass the character limit. A nice side effect is that the
|
||||
initial source is gloriously difficult to peruse. In particular, the Makefile
|
||||
does:</p>
|
||||
<pre><code> sed <vern.c 's/{ /(/g;s/} /)/g;s/; /#define /' | \
|
||||
<pre><code> sed <vern.c 's/{ /(/g;s/} /)/g;s/; /#define /' |
|
||||
sed 's/} /=/g;s/{ /i/g' >vern.tmp.c</code></pre>
|
||||
<p>and compiles <code>vern.tmp.c</code>.</p>
|
||||
<p>Second, the rather ho-hum step has been taking of naming each variable
|
||||
|
||||
+12
-10
@@ -150,16 +150,18 @@ is reasonably accurate.
|
||||
|
||||
### Here are some cities you might like to try:
|
||||
|
||||
- New York 41 -74\
|
||||
- London 52 0\
|
||||
- Moscow 56 38\
|
||||
- New Delhi 29 77\
|
||||
- Sydney -34 151
|
||||
- Los Angeles 34 -118
|
||||
- Paris 45 2
|
||||
- Rio de Janeiro -23 -43
|
||||
- Beijing 40 116
|
||||
- Tokyo 36 140
|
||||
```
|
||||
New York 41 -74
|
||||
London 52 0
|
||||
Moscow 56 38
|
||||
New Delhi 29 77
|
||||
Sydney -34 151
|
||||
Los Angeles 34 -118
|
||||
Paris 45 2
|
||||
Rio de Janeiro -23 -43
|
||||
Beijing 40 116
|
||||
Tokyo 36 140
|
||||
```
|
||||
|
||||
|
||||
For a domestic (US) version with higher resolution, try:
|
||||
|
||||
+10
-16
@@ -236,22 +236,16 @@ blank line. It’s just for show, really.</p>
|
||||
be just off the map; this is an unavoidable artifact. The map
|
||||
is reasonably accurate.</p>
|
||||
<h3 id="here-are-some-cities-you-might-like-to-try">Here are some cities you might like to try:</h3>
|
||||
<ul>
|
||||
<li>New York 41 -74<br />
|
||||
</li>
|
||||
<li>London 52 0<br />
|
||||
</li>
|
||||
<li>Moscow 56 38<br />
|
||||
</li>
|
||||
<li>New Delhi 29 77<br />
|
||||
</li>
|
||||
<li>Sydney -34 151</li>
|
||||
<li>Los Angeles 34 -118</li>
|
||||
<li>Paris 45 2</li>
|
||||
<li>Rio de Janeiro -23 -43</li>
|
||||
<li>Beijing 40 116</li>
|
||||
<li>Tokyo 36 140</li>
|
||||
</ul>
|
||||
<pre><code> New York 41 -74
|
||||
London 52 0
|
||||
Moscow 56 38
|
||||
New Delhi 29 77
|
||||
Sydney -34 151
|
||||
Los Angeles 34 -118
|
||||
Paris 45 2
|
||||
Rio de Janeiro -23 -43
|
||||
Beijing 40 116
|
||||
Tokyo 36 140</code></pre>
|
||||
<p>For a domestic (US) version with higher resolution, try:</p>
|
||||
<pre><code> main(l,a,n,d)char**a;{for(d=atoi(a[1])/2*80-atoi(a[2])-2043;
|
||||
n="bnaBCOCXdBBHGYdAP[A M E R I C A].AqandkmavX|ELC}BOCd"
|
||||
|
||||
@@ -171,7 +171,7 @@ C compilers.
|
||||
|
||||
is rejected by tcc version 4.1.2, the TenDRA compiler:
|
||||
```
|
||||
"t.c", line 3: Error:\
|
||||
"t.c", line 3: Error:<br>
|
||||
[ISO 6.8.3.3]: Invalid result for '##' operator in macro 'H'.
|
||||
```
|
||||
|
||||
|
||||
@@ -261,7 +261,7 @@ at least one compiler falls over.</p>
|
||||
<pre><code> #define H(x) <st##x##.h>
|
||||
#include H(dio) /* expands to <stdio.h> */</code></pre>
|
||||
<p>is rejected by tcc version 4.1.2, the TenDRA compiler:
|
||||
<code>"t.c", line 3: Error:\ [ISO 6.8.3.3]: Invalid result for '##' operator in macro 'H'.</code></p>
|
||||
<code>"t.c", line 3: Error:<br> [ISO 6.8.3.3]: Invalid result for '##' operator in macro 'H'.</code></p>
|
||||
<p>To be honest, I don’t know if the rules for pp-tokens and token
|
||||
pasting don’t forbid what I do (and thus tcc is correct in rejecting it).
|
||||
In this case, all other compilers I tried are buggy, or the Standard
|
||||
|
||||
@@ -68,9 +68,11 @@ it. The real text is:
|
||||
which when translated from [Black
|
||||
Speech](https://www.glyphweb.com/arda/b/blackspeech.html) means:
|
||||
|
||||
> [One Ring](https://www.glyphweb.com/arda/o/onering.html) to rule them all, [One
|
||||
Ring](https://www.glyphweb.com/arda/o/onering.html) to find them,\
|
||||
> [One Ring](https://www.glyphweb.com/arda/o/onering.html) to bring them all and in the darkness bind them.
|
||||
```
|
||||
[One Ring](https://www.glyphweb.com/arda/o/onering.html) to rule them all,
|
||||
[One Ring](https://www.glyphweb.com/arda/o/onering.html) to find them,
|
||||
[One Ring](https://www.glyphweb.com/arda/o/onering.html) to bring them all and in the darkness bind them.
|
||||
```
|
||||
|
||||
|
||||
## Author's remarks:
|
||||
|
||||
@@ -195,11 +195,9 @@ burzum-ishi krimpatul.</p>
|
||||
</blockquote>
|
||||
<p>which when translated from <a href="https://www.glyphweb.com/arda/b/blackspeech.html">Black
|
||||
Speech</a> means:</p>
|
||||
<blockquote>
|
||||
<p><a href="https://www.glyphweb.com/arda/o/onering.html">One Ring</a> to rule them all, <a href="https://www.glyphweb.com/arda/o/onering.html">One
|
||||
Ring</a> to find them,<br />
|
||||
<a href="https://www.glyphweb.com/arda/o/onering.html">One Ring</a> to bring them all and in the darkness bind them.</p>
|
||||
</blockquote>
|
||||
<pre><code> [One Ring](https://www.glyphweb.com/arda/o/onering.html) to rule them all,
|
||||
[One Ring](https://www.glyphweb.com/arda/o/onering.html) to find them,
|
||||
[One Ring](https://www.glyphweb.com/arda/o/onering.html) to bring them all and in the darkness bind them.</code></pre>
|
||||
<h2 id="authors-remarks">Author’s remarks:</h2>
|
||||
<p>This program takes a single command line argument, transcribes the
|
||||
argument text into Tolkien’s Elvish letters, and writes the
|
||||
|
||||
@@ -154,9 +154,14 @@ Supplied also is a short demo program written in
|
||||
```
|
||||
|
||||
Many other old programs will run in this emulator too. Files with a `.PRG`
|
||||
extension should work. (Look, for instance, here:
|
||||
<http://www.zimmers.net/anonftp/pub/cbm/pet/ALLFILES.html>,\
|
||||
or try this one: <http://www.zimmers.net/anonftp/pub/cbm/pet/games/english/dungeon.prg>)\
|
||||
extension should work. Look, for instance, here:
|
||||
|
||||
[http://www.zimmers.net/anonftp/pub/cbm/pet/ALLFILES.html](http://www.zimmers.net/anonftp/pub/cbm/pet/ALLFILES.html)
|
||||
|
||||
or try this one:
|
||||
|
||||
[http://www.zimmers.net/anonftp/pub/cbm/pet/games/english/dungeon.prg](http://www.zimmers.net/anonftp/pub/cbm/pet/games/english/dungeon.prg)
|
||||
|
||||
The filenames must be upper case in order to be loaded by the emulator.
|
||||
|
||||
You can save programs too - try
|
||||
|
||||
@@ -231,10 +231,11 @@ slower cursor blink, try</p>
|
||||
<pre><code> LOAD "DEMO"
|
||||
RUN</code></pre>
|
||||
<p>Many other old programs will run in this emulator too. Files with a <code>.PRG</code>
|
||||
extension should work. (Look, for instance, here:
|
||||
<a href="http://www.zimmers.net/anonftp/pub/cbm/pet/ALLFILES.html" class="uri">http://www.zimmers.net/anonftp/pub/cbm/pet/ALLFILES.html</a>,<br />
|
||||
or try this one: <a href="http://www.zimmers.net/anonftp/pub/cbm/pet/games/english/dungeon.prg" class="uri">http://www.zimmers.net/anonftp/pub/cbm/pet/games/english/dungeon.prg</a>)<br />
|
||||
The filenames must be upper case in order to be loaded by the emulator.</p>
|
||||
extension should work. Look, for instance, here:</p>
|
||||
<p><a href="http://www.zimmers.net/anonftp/pub/cbm/pet/ALLFILES.html">http://www.zimmers.net/anonftp/pub/cbm/pet/ALLFILES.html</a></p>
|
||||
<p>or try this one:</p>
|
||||
<p><a href="http://www.zimmers.net/anonftp/pub/cbm/pet/games/english/dungeon.prg">http://www.zimmers.net/anonftp/pub/cbm/pet/games/english/dungeon.prg</a></p>
|
||||
<p>The filenames must be upper case in order to be loaded by the emulator.</p>
|
||||
<p>You can save programs too - try</p>
|
||||
<pre><code> 10 PRINT "HELLO!"
|
||||
SAVE "HELLO"
|
||||
|
||||
@@ -118,9 +118,9 @@ each line:
|
||||
RUN
|
||||
|
||||
10 FOR A=1 TO 10
|
||||
20 PRINT A\
|
||||
30 NEXT A\
|
||||
LIST\
|
||||
20 PRINT A
|
||||
30 NEXT A
|
||||
LIST
|
||||
RUN
|
||||
|
||||
10 INPUT A
|
||||
|
||||
@@ -218,9 +218,9 @@ each line:</p>
|
||||
RUN
|
||||
|
||||
10 FOR A=1 TO 10
|
||||
20 PRINT A\
|
||||
30 NEXT A\
|
||||
LIST\
|
||||
20 PRINT A
|
||||
30 NEXT A
|
||||
LIST
|
||||
RUN
|
||||
|
||||
10 INPUT A
|
||||
|
||||
@@ -110,9 +110,9 @@ extra points.
|
||||
|
||||
|
||||
Caveat: You can shoot only 3 bullets at a time.
|
||||
\
|
||||
|
||||
Trick: You can fire faster if they explode on anything.
|
||||
\
|
||||
|
||||
Believe it or not, it has strategy!
|
||||
|
||||
When only one tank remains on the field, the level will advance.
|
||||
|
||||
@@ -214,9 +214,9 @@ blue when the view goes inactive.</p>
|
||||
<p>The objective is to chase and destroy the other player’s tank.
|
||||
There is also an aqua tank for testing your aim and getting
|
||||
extra points.</p>
|
||||
<p>Caveat: You can shoot only 3 bullets at a time.<br />
|
||||
Trick: You can fire faster if they explode on anything.<br />
|
||||
Believe it or not, it has strategy!</p>
|
||||
<p>Caveat: You can shoot only 3 bullets at a time.</p>
|
||||
<p>Trick: You can fire faster if they explode on anything.</p>
|
||||
<p>Believe it or not, it has strategy!</p>
|
||||
<p>When only one tank remains on the field, the level will advance.
|
||||
Don’t forget to destroy the aqua tank.</p>
|
||||
<p>The <strike>battle</strike>playground is surrounded by mountains and each level is
|
||||
|
||||
@@ -16,7 +16,7 @@
|
||||
and:
|
||||
|
||||
``` <!---sh-->
|
||||
./endoh2 e > e.c\
|
||||
./endoh2 e > e.c
|
||||
gcc -o e e.c
|
||||
./e > 271.c
|
||||
```
|
||||
|
||||
@@ -157,7 +157,7 @@ Location: <a href="../../location.html#JP">JP</a> - <em>Japan</em></li>
|
||||
gcc -o pi pi.c
|
||||
./pi > 314.c</code></pre>
|
||||
<p>and:</p>
|
||||
<pre><code> ./endoh2 e > e.c\
|
||||
<pre><code> ./endoh2 e > e.c
|
||||
gcc -o e e.c
|
||||
./e > 271.c</code></pre>
|
||||
<p>…</p>
|
||||
|
||||
@@ -77,8 +77,11 @@ That's all there is to
|
||||
[BLC](https://tromp.github.io/cl/Binary_lambda_calculus.html)!
|
||||
|
||||
For example the encoding of lambda term `S = \x \y \z (x z) (y z)`,
|
||||
with [De Bruijn notation](https://en.wikipedia.org/wiki/De_Bruijn_notation) `\ \
|
||||
\ (3 1) (2 1)`, is `00 00 00 01 01 1110 10 01 110 10`.
|
||||
with [De Bruijn notation](https://en.wikipedia.org/wiki/De_Bruijn_notation):
|
||||
|
||||
```
|
||||
\ \ \ (3 1) (2 1)`, is `00 00 00 01 01 1110 10 01 110 10
|
||||
```
|
||||
|
||||
In the closely related
|
||||
[BLC8](https://tromp.github.io/cl/Binary_lambda_calculus.html#BLC8:_byte_sized_I.2FO)
|
||||
|
||||
@@ -193,7 +193,8 @@ notation</a>) as <code>1^{n}0</code>.
|
||||
That’s all there is to
|
||||
<a href="https://tromp.github.io/cl/Binary_lambda_calculus.html">BLC</a>!</p>
|
||||
<p>For example the encoding of lambda term <code>S = \x \y \z (x z) (y z)</code>,
|
||||
with <a href="https://en.wikipedia.org/wiki/De_Bruijn_notation">De Bruijn notation</a> <code>\ \ \ (3 1) (2 1)</code>, is <code>00 00 00 01 01 1110 10 01 110 10</code>.</p>
|
||||
with <a href="https://en.wikipedia.org/wiki/De_Bruijn_notation">De Bruijn notation</a>:</p>
|
||||
<pre><code> \ \ \ (3 1) (2 1)`, is `00 00 00 01 01 1110 10 01 110 10</code></pre>
|
||||
<p>In the closely related
|
||||
<a href="https://tromp.github.io/cl/Binary_lambda_calculus.html#BLC8:_byte_sized_I.2FO">BLC8</a>
|
||||
language, I/O is byte oriented, translating between a stream of bytes and a list
|
||||
|
||||
+42
-42
@@ -24,16 +24,16 @@
|
||||
|
||||
## Judges' remarks:
|
||||
|
||||
Of integers this prog does a lot,\
|
||||
Of integers this prog does a lot,<br>
|
||||
plus minus, div times (and what not).
|
||||
|
||||
And modulus if remainders the needing,\
|
||||
And modulus if remainders the needing,<br>
|
||||
on standard input percent be feeding.
|
||||
|
||||
More than one line can thru give input,\
|
||||
More than one line can thru give input,<br>
|
||||
when interactive one values more than throughput.
|
||||
|
||||
With cut and paste and some time,\
|
||||
With cut and paste and some time,<br>
|
||||
one can compute M(23209).
|
||||
|
||||
|
||||
@@ -41,70 +41,70 @@ one can compute M(23209).
|
||||
|
||||
### Oh, The Strings You Can C!
|
||||
|
||||
I love the C language; its terseness is tops.\
|
||||
I love the C language; its terseness is tops.<br>
|
||||
But the thing I abhor is numerical ops!
|
||||
|
||||
No shifting, division, remainder, or times.\
|
||||
No increment, decrement, or subscripting blech,\
|
||||
No addition, subtraction, or bitwise bool glop.\
|
||||
No shifting, division, remainder, or times.<br>
|
||||
No increment, decrement, or subscripting blech,<br>
|
||||
No addition, subtraction, or bitwise bool glop.<br>
|
||||
As for pointer arithmetic -- totally yech!
|
||||
|
||||
But I do have a pref'rence, for pointer deref'rence.\
|
||||
I find NOTS are a bang, and relations a ball.\
|
||||
I like calling routines, and recursions in essence.\
|
||||
But I do have a pref'rence, for pointer deref'rence.<br>
|
||||
I find NOTS are a bang, and relations a ball.<br>
|
||||
I like calling routines, and recursions in essence.<br>
|
||||
But the thing I like MOST is a string dot h CALL!
|
||||
|
||||
With mem copy I copy, and mem set I clear.\
|
||||
Take string len of this, and string copy that.\
|
||||
From my keyboard I pause, to hear subroutines dear:\
|
||||
With mem copy I copy, and mem set I clear.<br>
|
||||
Take string len of this, and string copy that.<br>
|
||||
From my keyboard I pause, to hear subroutines dear:<br>
|
||||
The bark of string chrr, and the purr of string CAT!
|
||||
|
||||
One tiny detail that could lead to defeat.\
|
||||
From where an arg points: string calls only go forth,\
|
||||
So how to go back, to be Turing complete?\
|
||||
One tiny detail that could lead to defeat.<br>
|
||||
From where an arg points: string calls only go forth,<br>
|
||||
So how to go back, to be Turing complete?<br>
|
||||
From standard dot H, to the rescue, q SORT!
|
||||
|
||||
My fixation might hint at a textual bent.\
|
||||
Does my program compose a tattoo for your shin?\
|
||||
Play crosswords or translate from Urdu to Tzouby?\
|
||||
My fixation might hint at a textual bent.<br>
|
||||
Does my program compose a tattoo for your shin?<br>
|
||||
Play crosswords or translate from Urdu to Tzouby?<br>
|
||||
To give it a whirl, just punch 2 + 2 in.
|
||||
|
||||
You can add, do division, and multiply too.\
|
||||
Take unary minus and also subtract.\
|
||||
Summing hairs of a walrus? No longer a fuss.\
|
||||
You can add, do division, and multiply too.<br>
|
||||
Take unary minus and also subtract.<br>
|
||||
Summing hairs of a walrus? No longer a fuss.<br>
|
||||
Parenthetical grouping -- no pushing a stack!
|
||||
|
||||
Try dividing a [googol](https://en.wikipedia.org/wiki/Googol) by one forty three,\
|
||||
Subtract an [octillion](https://en.wikipedia.org/wiki/Names_of_large_numbers) - it's simply divine.\
|
||||
To compute a remainder, inscribe a percent.\
|
||||
Try dividing a [googol](https://en.wikipedia.org/wiki/Googol) by one forty three,<br>
|
||||
Subtract an [octillion](https://en.wikipedia.org/wiki/Names_of_large_numbers) - it's simply divine.<br>
|
||||
To compute a remainder, inscribe a percent.<br>
|
||||
For the sign of the answer, see C ninety nine!
|
||||
|
||||
A hundred and twenty five digits or so,\
|
||||
Are the lengthiest figures the program can gnash.\
|
||||
Go over that limit, by even a digit:\
|
||||
A hundred and twenty five digits or so,<br>
|
||||
Are the lengthiest figures the program can gnash.<br>
|
||||
Go over that limit, by even a digit:<br>
|
||||
Risk incorrect answers, or witness a crash!
|
||||
|
||||
Say, say, does it have octal or binary zen?\
|
||||
What about duodecimal, ternary, hex?\
|
||||
Try the base as an option (of course in base ten)\
|
||||
Say, say, does it have octal or binary zen?<br>
|
||||
What about duodecimal, ternary, hex?<br>
|
||||
Try the base as an option (of course in base ten)<br>
|
||||
Any base two to twenty -- for that is the specs.
|
||||
|
||||
Use lowercase in trans-decimal radix,\
|
||||
Divide *babbage* (in base seventeen) by *cafe* --\
|
||||
a nice *fad*, but avoid a division by nix:\
|
||||
Use lowercase in trans-decimal radix,<br>
|
||||
Divide *babbage* (in base seventeen) by *cafe* --<br>
|
||||
a nice *fad*, but avoid a division by nix:<br>
|
||||
No errant result, but you could wait all day!
|
||||
|
||||
To grok the internals, ask [Queen Cleopatra](https://en.wikipedia.org/wiki/Cleopatra),\
|
||||
or [King Tutankhamun](https://en.wikipedia.org/wiki/Tutankhamun); for him it's a romp.\
|
||||
Addition by cats, and if given two figures,\
|
||||
To grok the internals, ask [Queen Cleopatra](https://en.wikipedia.org/wiki/Cleopatra),<br>
|
||||
or [King Tutankhamun](https://en.wikipedia.org/wiki/Tutankhamun); for him it's a romp.<br>
|
||||
Addition by cats, and if given two figures,<br>
|
||||
to tell which is bigger, sort down and string CMP!
|
||||
|
||||
Unlawful subtraction, a grade school infraction,\
|
||||
starts at the left and works to the right.\
|
||||
Yet more innovation: like [Henry Ford's cars](https://en.wikipedia.org/wiki/Ford_Motor_Company),\
|
||||
Unlawful subtraction, a grade school infraction,<br>
|
||||
starts at the left and works to the right.<br>
|
||||
Yet more innovation: like [Henry Ford's cars](https://en.wikipedia.org/wiki/Ford_Motor_Company),<br>
|
||||
With a pound and define, mass production of vars!
|
||||
|
||||
The moral is clear, for programmers out there:\
|
||||
The moral is clear, for programmers out there:<br>
|
||||
With the C lib for strings, you can hack with a flair.
|
||||
|
||||
|
||||
|
||||
+42
-42
@@ -160,67 +160,67 @@ Location: <a href="../../location.html#US">US</a> - <em>United States of America
|
||||
<h2 id="try">Try:</h2>
|
||||
<pre><code> ./try.sh</code></pre>
|
||||
<h2 id="judges-remarks">Judges’ remarks:</h2>
|
||||
<p>Of integers this prog does a lot,<br />
|
||||
<p>Of integers this prog does a lot,<br>
|
||||
plus minus, div times (and what not).</p>
|
||||
<p>And modulus if remainders the needing,<br />
|
||||
<p>And modulus if remainders the needing,<br>
|
||||
on standard input percent be feeding.</p>
|
||||
<p>More than one line can thru give input,<br />
|
||||
<p>More than one line can thru give input,<br>
|
||||
when interactive one values more than throughput.</p>
|
||||
<p>With cut and paste and some time,<br />
|
||||
<p>With cut and paste and some time,<br>
|
||||
one can compute M(23209).</p>
|
||||
<h2 id="authors-remarks">Author’s remarks:</h2>
|
||||
<h3 id="oh-the-strings-you-can-c">Oh, The Strings You Can C!</h3>
|
||||
<p>I love the C language; its terseness is tops.<br />
|
||||
<p>I love the C language; its terseness is tops.<br>
|
||||
But the thing I abhor is numerical ops!</p>
|
||||
<p>No shifting, division, remainder, or times.<br />
|
||||
No increment, decrement, or subscripting blech,<br />
|
||||
No addition, subtraction, or bitwise bool glop.<br />
|
||||
<p>No shifting, division, remainder, or times.<br>
|
||||
No increment, decrement, or subscripting blech,<br>
|
||||
No addition, subtraction, or bitwise bool glop.<br>
|
||||
As for pointer arithmetic – totally yech!</p>
|
||||
<p>But I do have a pref’rence, for pointer deref’rence.<br />
|
||||
I find NOTS are a bang, and relations a ball.<br />
|
||||
I like calling routines, and recursions in essence.<br />
|
||||
<p>But I do have a pref’rence, for pointer deref’rence.<br>
|
||||
I find NOTS are a bang, and relations a ball.<br>
|
||||
I like calling routines, and recursions in essence.<br>
|
||||
But the thing I like MOST is a string dot h CALL!</p>
|
||||
<p>With mem copy I copy, and mem set I clear.<br />
|
||||
Take string len of this, and string copy that.<br />
|
||||
From my keyboard I pause, to hear subroutines dear:<br />
|
||||
<p>With mem copy I copy, and mem set I clear.<br>
|
||||
Take string len of this, and string copy that.<br>
|
||||
From my keyboard I pause, to hear subroutines dear:<br>
|
||||
The bark of string chrr, and the purr of string CAT!</p>
|
||||
<p>One tiny detail that could lead to defeat.<br />
|
||||
From where an arg points: string calls only go forth,<br />
|
||||
So how to go back, to be Turing complete?<br />
|
||||
<p>One tiny detail that could lead to defeat.<br>
|
||||
From where an arg points: string calls only go forth,<br>
|
||||
So how to go back, to be Turing complete?<br>
|
||||
From standard dot H, to the rescue, q SORT!</p>
|
||||
<p>My fixation might hint at a textual bent.<br />
|
||||
Does my program compose a tattoo for your shin?<br />
|
||||
Play crosswords or translate from Urdu to Tzouby?<br />
|
||||
<p>My fixation might hint at a textual bent.<br>
|
||||
Does my program compose a tattoo for your shin?<br>
|
||||
Play crosswords or translate from Urdu to Tzouby?<br>
|
||||
To give it a whirl, just punch 2 + 2 in.</p>
|
||||
<p>You can add, do division, and multiply too.<br />
|
||||
Take unary minus and also subtract.<br />
|
||||
Summing hairs of a walrus? No longer a fuss.<br />
|
||||
<p>You can add, do division, and multiply too.<br>
|
||||
Take unary minus and also subtract.<br>
|
||||
Summing hairs of a walrus? No longer a fuss.<br>
|
||||
Parenthetical grouping – no pushing a stack!</p>
|
||||
<p>Try dividing a <a href="https://en.wikipedia.org/wiki/Googol">googol</a> by one forty three,<br />
|
||||
Subtract an <a href="https://en.wikipedia.org/wiki/Names_of_large_numbers">octillion</a> - it’s simply divine.<br />
|
||||
To compute a remainder, inscribe a percent.<br />
|
||||
<p>Try dividing a <a href="https://en.wikipedia.org/wiki/Googol">googol</a> by one forty three,<br>
|
||||
Subtract an <a href="https://en.wikipedia.org/wiki/Names_of_large_numbers">octillion</a> - it’s simply divine.<br>
|
||||
To compute a remainder, inscribe a percent.<br>
|
||||
For the sign of the answer, see C ninety nine!</p>
|
||||
<p>A hundred and twenty five digits or so,<br />
|
||||
Are the lengthiest figures the program can gnash.<br />
|
||||
Go over that limit, by even a digit:<br />
|
||||
<p>A hundred and twenty five digits or so,<br>
|
||||
Are the lengthiest figures the program can gnash.<br>
|
||||
Go over that limit, by even a digit:<br>
|
||||
Risk incorrect answers, or witness a crash!</p>
|
||||
<p>Say, say, does it have octal or binary zen?<br />
|
||||
What about duodecimal, ternary, hex?<br />
|
||||
Try the base as an option (of course in base ten)<br />
|
||||
<p>Say, say, does it have octal or binary zen?<br>
|
||||
What about duodecimal, ternary, hex?<br>
|
||||
Try the base as an option (of course in base ten)<br>
|
||||
Any base two to twenty – for that is the specs.</p>
|
||||
<p>Use lowercase in trans-decimal radix,<br />
|
||||
Divide <em>babbage</em> (in base seventeen) by <em>cafe</em> –<br />
|
||||
a nice <em>fad</em>, but avoid a division by nix:<br />
|
||||
<p>Use lowercase in trans-decimal radix,<br>
|
||||
Divide <em>babbage</em> (in base seventeen) by <em>cafe</em> –<br>
|
||||
a nice <em>fad</em>, but avoid a division by nix:<br>
|
||||
No errant result, but you could wait all day!</p>
|
||||
<p>To grok the internals, ask <a href="https://en.wikipedia.org/wiki/Cleopatra">Queen Cleopatra</a>,<br />
|
||||
or <a href="https://en.wikipedia.org/wiki/Tutankhamun">King Tutankhamun</a>; for him it’s a romp.<br />
|
||||
Addition by cats, and if given two figures,<br />
|
||||
<p>To grok the internals, ask <a href="https://en.wikipedia.org/wiki/Cleopatra">Queen Cleopatra</a>,<br>
|
||||
or <a href="https://en.wikipedia.org/wiki/Tutankhamun">King Tutankhamun</a>; for him it’s a romp.<br>
|
||||
Addition by cats, and if given two figures,<br>
|
||||
to tell which is bigger, sort down and string CMP!</p>
|
||||
<p>Unlawful subtraction, a grade school infraction,<br />
|
||||
starts at the left and works to the right.<br />
|
||||
Yet more innovation: like <a href="https://en.wikipedia.org/wiki/Ford_Motor_Company">Henry Ford’s cars</a>,<br />
|
||||
<p>Unlawful subtraction, a grade school infraction,<br>
|
||||
starts at the left and works to the right.<br>
|
||||
Yet more innovation: like <a href="https://en.wikipedia.org/wiki/Ford_Motor_Company">Henry Ford’s cars</a>,<br>
|
||||
With a pound and define, mass production of vars!</p>
|
||||
<p>The moral is clear, for programmers out there:<br />
|
||||
<p>The moral is clear, for programmers out there:<br>
|
||||
With the C lib for strings, you can hack with a flair.</p>
|
||||
<!--
|
||||
|
||||
|
||||
+1
-1
@@ -116,7 +116,7 @@ Tested platforms:
|
||||
* Linux 3.18.7, Rasperberry Pi 2, clang 3.0-6.2, (works)
|
||||
* Linux 3.18.7, Rasperberry Pi 2, gcc 4.6.3, (works)
|
||||
* Mac OS X 10, x64, Apple LLVM version 6.1.0 (clang-602.0.53), (works)
|
||||
* Windows 8.1, x86, MSVC 2012 (works)\
|
||||
* Windows 8.1, x86, MSVC 2012 (works)
|
||||
* Windows 8.1, x64, MSVC 2012 (works)
|
||||
* Windows 8.1, x86, MinGW gcc 4.6.2 (fails, prints error message)
|
||||
* Windows 8.1, x86, MinGW gcc 4.6.2 with -msse2 -mfpmath=sse (works)
|
||||
|
||||
+1
-2
@@ -216,8 +216,7 @@ result. Error messages become garbled, though.</p></li>
|
||||
<li>Linux 3.18.7, Rasperberry Pi 2, clang 3.0-6.2, (works)</li>
|
||||
<li>Linux 3.18.7, Rasperberry Pi 2, gcc 4.6.3, (works)</li>
|
||||
<li>Mac OS X 10, x64, Apple LLVM version 6.1.0 (clang-602.0.53), (works)</li>
|
||||
<li>Windows 8.1, x86, MSVC 2012 (works)<br />
|
||||
</li>
|
||||
<li>Windows 8.1, x86, MSVC 2012 (works)</li>
|
||||
<li>Windows 8.1, x64, MSVC 2012 (works)</li>
|
||||
<li>Windows 8.1, x86, MinGW gcc 4.6.2 (fails, prints error message)</li>
|
||||
<li>Windows 8.1, x86, MinGW gcc 4.6.2 with -msse2 -mfpmath=sse (works)</li>
|
||||
|
||||
+13
-13
@@ -117,33 +117,33 @@ a region of edits are highly unlikely.
|
||||
|
||||
### References
|
||||
|
||||
Wu, Manber, Myers, and Miller; August 1989;\
|
||||
"An O(NP) Sequence Comparison Algorithm";\
|
||||
Wu, Manber, Myers, and Miller; August 1989;<br>
|
||||
"An O(NP) Sequence Comparison Algorithm";<br>
|
||||
<http://myerslab.mpi-cbg.de/wp-content/uploads/2014/06/np_diff.pdf>
|
||||
|
||||
Fowler, Noll, Vo; 1994\
|
||||
Fowler, Noll, Vo; 1994<br>
|
||||
<http://www.isthe.com/chongo/tech/comp/fnv/index.html>
|
||||
|
||||
Fowler, Noll, Vo on Wikipedia\
|
||||
Fowler, Noll, Vo on Wikipedia<br>
|
||||
<https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function>
|
||||
|
||||
"diff", The Open Group Base Specifications Issue 7\
|
||||
IEEE Std 1003.1, 2013 Edition\
|
||||
"diff", The Open Group Base Specifications Issue 7<br>
|
||||
IEEE Std 1003.1, 2013 Edition<br>
|
||||
<http://pubs.opengroup.org/onlinepubs/9699919799/utilities/diff.html>
|
||||
|
||||
Eugene W. Myers; "An O(ND) Difference Algorithm and Its Variations";\
|
||||
Algorithmica, 1986, pages. 251-266\
|
||||
Eugene W. Myers; "An O(ND) Difference Algorithm and Its Variations";<br>
|
||||
Algorithmica, 1986, pages. 251-266<br>
|
||||
<http://www.xmailserver.org/diff2.pdf>
|
||||
|
||||
Webb Miller and Eugene W. Myers; "A File Comparison Program";\
|
||||
Software-Practice And Experience, Vol. 15(11). 1025-1040 (November 1985)\
|
||||
Webb Miller and Eugene W. Myers; "A File Comparison Program";<br>
|
||||
Software-Practice And Experience, Vol. 15(11). 1025-1040 (November 1985)<br>
|
||||
<http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.189.70&rep=rep1&type=pdf>
|
||||
|
||||
D.S. Hirschberg, "A linear space algorithm for computing maximal common subsequence problem";\
|
||||
Comm. of ACM, Vol. 18, June 1975, pages 341-343\
|
||||
D.S. Hirschberg, "A linear space algorithm for computing maximal common subsequence problem";<br>
|
||||
Comm. of ACM, Vol. 18, June 1975, pages 341-343<br>
|
||||
<http://www.mathcs.emory.edu/~cheung/Courses/323/Syllabus/DynProg/Docs/Hirschberg-LCS-1975.pdf>
|
||||
|
||||
Which hashing algorithm is best for uniqueness and speed?\
|
||||
Which hashing algorithm is best for uniqueness and speed?<br>
|
||||
<http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed>
|
||||
|
||||
[Wu+89]: http://myerslab.mpi-cbg.de/wp-content/uploads/2014/06/np_diff.pdf
|
||||
|
||||
+13
-13
@@ -218,26 +218,26 @@ Basic test program verifies known test edit distances and <code>patch(1)</code>
|
||||
Random edits (holes) made to a file in-place.</p></li>
|
||||
</ul>
|
||||
<h3 id="references">References</h3>
|
||||
<p>Wu, Manber, Myers, and Miller; August 1989;<br />
|
||||
“An O(NP) Sequence Comparison Algorithm”;<br />
|
||||
<p>Wu, Manber, Myers, and Miller; August 1989;<br>
|
||||
“An O(NP) Sequence Comparison Algorithm”;<br>
|
||||
<a href="http://myerslab.mpi-cbg.de/wp-content/uploads/2014/06/np_diff.pdf" class="uri">http://myerslab.mpi-cbg.de/wp-content/uploads/2014/06/np_diff.pdf</a></p>
|
||||
<p>Fowler, Noll, Vo; 1994<br />
|
||||
<p>Fowler, Noll, Vo; 1994<br>
|
||||
<a href="http://www.isthe.com/chongo/tech/comp/fnv/index.html" class="uri">http://www.isthe.com/chongo/tech/comp/fnv/index.html</a></p>
|
||||
<p>Fowler, Noll, Vo on Wikipedia<br />
|
||||
<p>Fowler, Noll, Vo on Wikipedia<br>
|
||||
<a href="https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function" class="uri">https://en.wikipedia.org/wiki/Fowler%E2%80%93Noll%E2%80%93Vo_hash_function</a></p>
|
||||
<p>“diff”, The Open Group Base Specifications Issue 7<br />
|
||||
IEEE Std 1003.1, 2013 Edition<br />
|
||||
<p>“diff”, The Open Group Base Specifications Issue 7<br>
|
||||
IEEE Std 1003.1, 2013 Edition<br>
|
||||
<a href="http://pubs.opengroup.org/onlinepubs/9699919799/utilities/diff.html" class="uri">http://pubs.opengroup.org/onlinepubs/9699919799/utilities/diff.html</a></p>
|
||||
<p>Eugene W. Myers; “An O(ND) Difference Algorithm and Its Variations”;<br />
|
||||
Algorithmica, 1986, pages. 251-266<br />
|
||||
<p>Eugene W. Myers; “An O(ND) Difference Algorithm and Its Variations”;<br>
|
||||
Algorithmica, 1986, pages. 251-266<br>
|
||||
<a href="http://www.xmailserver.org/diff2.pdf" class="uri">http://www.xmailserver.org/diff2.pdf</a></p>
|
||||
<p>Webb Miller and Eugene W. Myers; “A File Comparison Program”;<br />
|
||||
Software-Practice And Experience, Vol. 15(11). 1025-1040 (November 1985)<br />
|
||||
<p>Webb Miller and Eugene W. Myers; “A File Comparison Program”;<br>
|
||||
Software-Practice And Experience, Vol. 15(11). 1025-1040 (November 1985)<br>
|
||||
<a href="http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.189.70&rep=rep1&type=pdf" class="uri">http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.189.70&rep=rep1&type=pdf</a></p>
|
||||
<p>D.S. Hirschberg, “A linear space algorithm for computing maximal common subsequence problem”;<br />
|
||||
Comm. of ACM, Vol. 18, June 1975, pages 341-343<br />
|
||||
<p>D.S. Hirschberg, “A linear space algorithm for computing maximal common subsequence problem”;<br>
|
||||
Comm. of ACM, Vol. 18, June 1975, pages 341-343<br>
|
||||
<a href="http://www.mathcs.emory.edu/~cheung/Courses/323/Syllabus/DynProg/Docs/Hirschberg-LCS-1975.pdf" class="uri">http://www.mathcs.emory.edu/~cheung/Courses/323/Syllabus/DynProg/Docs/Hirschberg-LCS-1975.pdf</a></p>
|
||||
<p>Which hashing algorithm is best for uniqueness and speed?<br />
|
||||
<p>Which hashing algorithm is best for uniqueness and speed?<br>
|
||||
<a href="http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed" class="uri">http://programmers.stackexchange.com/questions/49550/which-hashing-algorithm-is-best-for-uniqueness-and-speed</a></p>
|
||||
<!--
|
||||
|
||||
|
||||
@@ -189,10 +189,8 @@ to the rescue:
|
||||
|
||||
``` <!---sh-->
|
||||
$ printf 'obase=16;10^100\n' | bc
|
||||
1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F1000000000\
|
||||
0000000000000000
|
||||
$ ./prog 1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000 \
|
||||
| less
|
||||
1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000
|
||||
$ ./prog 1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000 | less
|
||||
[...]
|
||||
```
|
||||
|
||||
|
||||
@@ -270,10 +270,8 @@ Fear not,
|
||||
<a href="http://pubs.opengroup.org/onlinepubs/9699919799/utilities/bc.html">bc(1)</a>
|
||||
to the rescue:</p>
|
||||
<pre><code> $ printf 'obase=16;10^100\n' | bc
|
||||
1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F1000000000\
|
||||
0000000000000000
|
||||
$ ./prog 1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000 \
|
||||
| less
|
||||
1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000
|
||||
$ ./prog 1249AD2594C37CEB0B2784C4CE0BF38ACE408E211A7CAAB24308A82E8F10000000000000000000000000 | less
|
||||
[...]</code></pre>
|
||||
<p>Observe how the first 100 iterations melt the zeros to the right. Can you explain
|
||||
why?</p>
|
||||
|
||||
@@ -219,13 +219,15 @@ It pre-dates `varargs.h`, and assembly was the only way to gain access to the
|
||||
variable argument types. The first edition _The C Programming Language_, 1978,
|
||||
page 71, remarks:
|
||||
|
||||
> By the way, there is no entirely satisfactory way to write a portable function
|
||||
> that accepts a variable number of arguments, because there is no portable way
|
||||
> for the called function to determine how many arguments where actually passed
|
||||
> to it in a given call.
|
||||
> ...\
|
||||
> `printf`, the most common C function with a variable number of arguments,
|
||||
> ... is also non-portable and must be modified for different environments.
|
||||
```
|
||||
By the way, there is no entirely satisfactory way to write a portable function
|
||||
that accepts a variable number of arguments, because there is no portable way
|
||||
for the called function to determine how many arguments where actually passed
|
||||
to it in a given call.
|
||||
...
|
||||
`printf`, the most common C function with a variable number of arguments,
|
||||
... is also non-portable and must be modified for different environments.
|
||||
```
|
||||
|
||||
It is fascinating to explore the roots of C through the history of the operating
|
||||
system it was birthed within. C is often criticized as a difficult, inscrutable
|
||||
|
||||
@@ -298,15 +298,13 @@ shortest code that compiles and runs correctly in Ancient UNIX.</p>
|
||||
It pre-dates <code>varargs.h</code>, and assembly was the only way to gain access to the
|
||||
variable argument types. The first edition <em>The C Programming Language</em>, 1978,
|
||||
page 71, remarks:</p>
|
||||
<blockquote>
|
||||
<p>By the way, there is no entirely satisfactory way to write a portable function
|
||||
that accepts a variable number of arguments, because there is no portable way
|
||||
for the called function to determine how many arguments where actually passed
|
||||
to it in a given call.
|
||||
…<br />
|
||||
<code>printf</code>, the most common C function with a variable number of arguments,
|
||||
… is also non-portable and must be modified for different environments.</p>
|
||||
</blockquote>
|
||||
<pre><code> By the way, there is no entirely satisfactory way to write a portable function
|
||||
that accepts a variable number of arguments, because there is no portable way
|
||||
for the called function to determine how many arguments where actually passed
|
||||
to it in a given call.
|
||||
...
|
||||
`printf`, the most common C function with a variable number of arguments,
|
||||
... is also non-portable and must be modified for different environments.</code></pre>
|
||||
<p>It is fascinating to explore the roots of C through the history of the operating
|
||||
system it was birthed within. C is often criticized as a difficult, inscrutable
|
||||
language, but as this contest demonstrates, this is in parody. <em>Shell-gol</em> is
|
||||
|
||||
+35
-35
@@ -36,45 +36,45 @@ What is this program weighing and how much does it weigh?
|
||||
|
||||
### tac - tokenize and count C and derivative languages:
|
||||
|
||||
`tac` computes C program size\
|
||||
(obfuscated / otherwise)\
|
||||
by splitting code as tokens small,\
|
||||
ignoring space, then counting all.\
|
||||
`tac` computes C program size<br>
|
||||
(obfuscated / otherwise)<br>
|
||||
by splitting code as tokens small,<br>
|
||||
ignoring space, then counting all.<br>
|
||||
|
||||
It tries quite hard to act the same\
|
||||
as counting tool of I-OCCC fame.\
|
||||
Some bugs were fixed, it's faster too,\
|
||||
and does more things, just add some glue!\
|
||||
It tries quite hard to act the same<br>
|
||||
as counting tool of I-OCCC fame.<br>
|
||||
Some bugs were fixed, it's faster too,<br>
|
||||
and does more things, just add some glue!<br>
|
||||
|
||||
It does far more than print the size:\
|
||||
the token part's a better prize!\
|
||||
With each upon on a single line,\
|
||||
how many things can you design?\
|
||||
It does far more than print the size:<br>
|
||||
the token part's a better prize!<br>
|
||||
With each upon on a single line,<br>
|
||||
how many things can you design?<br>
|
||||
|
||||
Included is a keyword sorter,\
|
||||
de-obfuscator, freq reporter.\
|
||||
With code produced as little parts,\
|
||||
just add your own creative arts.\
|
||||
Included is a keyword sorter,<br>
|
||||
de-obfuscator, freq reporter.<br>
|
||||
With code produced as little parts,<br>
|
||||
just add your own creative arts.<br>
|
||||
|
||||
But first you have to figure out\
|
||||
the braces part, without a doubt!\
|
||||
And then the code - it isn't easy:\
|
||||
for as else? That's rather cheesy!\
|
||||
But first you have to figure out<br>
|
||||
the braces part, without a doubt!<br>
|
||||
And then the code - it isn't easy:<br>
|
||||
for as else? That's rather cheesy!<br>
|
||||
|
||||
The rest of it is standard fare:\
|
||||
expressions strange, the globals bare,\
|
||||
confusing symbols one and oh,\
|
||||
and precedence you have to know.\
|
||||
The rest of it is standard fare:<br>
|
||||
expressions strange, the globals bare,<br>
|
||||
confusing symbols one and oh,<br>
|
||||
and precedence you have to know.<br>
|
||||
|
||||
The keyword list was made external,\
|
||||
because of standards change eternal.\
|
||||
Thus other languages can now,\
|
||||
be counted just like C, somehow!\
|
||||
The keyword list was made external,<br>
|
||||
because of standards change eternal.<br>
|
||||
Thus other languages can now,<br>
|
||||
be counted just like C, somehow!<br>
|
||||
|
||||
I hope you find this code obscure\
|
||||
enough to win, and thus procure\
|
||||
a public place for all to see\
|
||||
how badly I can butcher C!\
|
||||
I hope you find this code obscure<br>
|
||||
enough to win, and thus procure<br>
|
||||
a public place for all to see<br>
|
||||
how badly I can butcher C!<br>
|
||||
|
||||
|
||||
### Said another way....
|
||||
@@ -270,9 +270,9 @@ language_. It really is this easy with `tac`:
|
||||
|
||||
* I assume you noticed the [braces][2]?
|
||||
|
||||
_Every brace is sacred,\
|
||||
Every brace is great.\
|
||||
If a brace is wasted,\
|
||||
_Every brace is sacred,<br>
|
||||
Every brace is great.<br>
|
||||
If a brace is wasted,<br>
|
||||
Clang gets quite irate_.
|
||||
|
||||
* Keywords follow the 2010s top five, without the `if`, for interesting flow control.
|
||||
|
||||
+35
-43
@@ -164,46 +164,38 @@ Location: <a href="../../location.html#US">US</a> - <em>United States of America
|
||||
What is this program weighing and how much does it weigh?</p>
|
||||
<h2 id="authors-remarks">Author’s remarks:</h2>
|
||||
<h3 id="tac---tokenize-and-count-c-and-derivative-languages">tac - tokenize and count C and derivative languages:</h3>
|
||||
<p><code>tac</code> computes C program size<br />
|
||||
(obfuscated / otherwise)<br />
|
||||
by splitting code as tokens small,<br />
|
||||
ignoring space, then counting all.<br />
|
||||
</p>
|
||||
<p>It tries quite hard to act the same<br />
|
||||
as counting tool of I-OCCC fame.<br />
|
||||
Some bugs were fixed, it’s faster too,<br />
|
||||
and does more things, just add some glue!<br />
|
||||
</p>
|
||||
<p>It does far more than print the size:<br />
|
||||
the token part’s a better prize!<br />
|
||||
With each upon on a single line,<br />
|
||||
how many things can you design?<br />
|
||||
</p>
|
||||
<p>Included is a keyword sorter,<br />
|
||||
de-obfuscator, freq reporter.<br />
|
||||
With code produced as little parts,<br />
|
||||
just add your own creative arts.<br />
|
||||
</p>
|
||||
<p>But first you have to figure out<br />
|
||||
the braces part, without a doubt!<br />
|
||||
And then the code - it isn’t easy:<br />
|
||||
for as else? That’s rather cheesy!<br />
|
||||
</p>
|
||||
<p>The rest of it is standard fare:<br />
|
||||
expressions strange, the globals bare,<br />
|
||||
confusing symbols one and oh,<br />
|
||||
and precedence you have to know.<br />
|
||||
</p>
|
||||
<p>The keyword list was made external,<br />
|
||||
because of standards change eternal.<br />
|
||||
Thus other languages can now,<br />
|
||||
be counted just like C, somehow!<br />
|
||||
</p>
|
||||
<p>I hope you find this code obscure<br />
|
||||
enough to win, and thus procure<br />
|
||||
a public place for all to see<br />
|
||||
how badly I can butcher C!<br />
|
||||
</p>
|
||||
<p><code>tac</code> computes C program size<br>
|
||||
(obfuscated / otherwise)<br>
|
||||
by splitting code as tokens small,<br>
|
||||
ignoring space, then counting all.<br></p>
|
||||
<p>It tries quite hard to act the same<br>
|
||||
as counting tool of I-OCCC fame.<br>
|
||||
Some bugs were fixed, it’s faster too,<br>
|
||||
and does more things, just add some glue!<br></p>
|
||||
<p>It does far more than print the size:<br>
|
||||
the token part’s a better prize!<br>
|
||||
With each upon on a single line,<br>
|
||||
how many things can you design?<br></p>
|
||||
<p>Included is a keyword sorter,<br>
|
||||
de-obfuscator, freq reporter.<br>
|
||||
With code produced as little parts,<br>
|
||||
just add your own creative arts.<br></p>
|
||||
<p>But first you have to figure out<br>
|
||||
the braces part, without a doubt!<br>
|
||||
And then the code - it isn’t easy:<br>
|
||||
for as else? That’s rather cheesy!<br></p>
|
||||
<p>The rest of it is standard fare:<br>
|
||||
expressions strange, the globals bare,<br>
|
||||
confusing symbols one and oh,<br>
|
||||
and precedence you have to know.<br></p>
|
||||
<p>The keyword list was made external,<br>
|
||||
because of standards change eternal.<br>
|
||||
Thus other languages can now,<br>
|
||||
be counted just like C, somehow!<br></p>
|
||||
<p>I hope you find this code obscure<br>
|
||||
enough to win, and thus procure<br>
|
||||
a public place for all to see<br>
|
||||
how badly I can butcher C!<br></p>
|
||||
<h3 id="said-another-way.">Said another way….</h3>
|
||||
<p><code>tac</code> is the inverse of <code>cat</code>(1): it un-concatenates its input into C tokens,
|
||||
writing the token stream to <code>stdout</code>. There are options to suppress the token
|
||||
@@ -353,9 +345,9 @@ language</em>. It really is this easy with <code>tac</code>:</p>
|
||||
<h3 id="on-the-question-of-obfuscation">On the question of obfuscation:</h3>
|
||||
<ul>
|
||||
<li><p>I assume you noticed the <a href="https://www.youtube.com/watch?v=fUspLVStPbk&start=53" title="Meaning of Life">braces</a>?</p>
|
||||
<p><em>Every brace is sacred,<br />
|
||||
Every brace is great.<br />
|
||||
If a brace is wasted,<br />
|
||||
<p><em>Every brace is sacred,<br>
|
||||
Every brace is great.<br>
|
||||
If a brace is wasted,<br>
|
||||
Clang gets quite irate</em>.</p></li>
|
||||
<li><p>Keywords follow the 2010s top five, without the <code>if</code>, for interesting flow control.</p></li>
|
||||
<li><p>Sometimes a <code>for</code> can be an <code>else</code> - <a href="https://www.youtube.com/watch?v=OHVjs4aobqs" title="Inconceivable">inconceivable</a>!</p></li>
|
||||
|
||||
@@ -223,7 +223,7 @@ monkey; I thought the monkey had it too easy: unlike his limited keyboard I have
|
||||
`isprint()` returns non-zero except that only capital letters are included;
|
||||
the file [prog.alt.c](prog.alt.c) has a slightly smaller keyboard. There are some
|
||||
additional features I have added (including two Easter eggs); amongst others:
|
||||
ability to change the target string and maximum length. See\
|
||||
ability to change the target string and maximum length. See
|
||||
**[How it works](#how)**, **[Hints](#hints)** and **[How to build](#build)** for
|
||||
more details.
|
||||
|
||||
@@ -465,8 +465,8 @@ If you do one of:
|
||||
```
|
||||
|
||||
It will search for `MONKEY` in both cases; in other words it's the last one.
|
||||
If the string is too long given the value of `S` (see\
|
||||
**[How to build](#build)**) it will be truncated.
|
||||
If the string is too long given the value of `S` (see **[How to build](#build)**)
|
||||
it will be truncated.
|
||||
|
||||
If you actually do want to search for a string starting with a `-` you must
|
||||
disable further parsing of options by using the `-` option itself; for
|
||||
@@ -492,7 +492,7 @@ examples of the last set of three above are equivalent i.e. the following two
|
||||
are equivalent:
|
||||
|
||||
```
|
||||
-q-\
|
||||
-q-
|
||||
-q --
|
||||
```
|
||||
|
||||
@@ -735,7 +735,7 @@ people. Take the following invocations:
|
||||
(1) $ echo test > test
|
||||
(2) $ ./weasel test
|
||||
(3) $ ./weasel < test
|
||||
(4) $ cat test | ./weasel\
|
||||
(4) $ cat test | ./weasel
|
||||
(5) $ < test-strings.txt ./weasel
|
||||
(6) $ cat | ./weasel
|
||||
```
|
||||
@@ -819,7 +819,7 @@ Skip to [Obfuscation](#obfuscation).
|
||||
|
||||
There is a type of input error, as I said, that might appear to be a bug. What
|
||||
actually is going on though is due to a technicality on how spaces are printed
|
||||
and the fact the program does not accept spaces other than a literal space\
|
||||
and the fact the program does not accept spaces other than a literal space
|
||||
` `; when a character in the string to be found isn't in the keyboard the
|
||||
program prints an error message and then exits (returning 1). But since the
|
||||
keyboard doesn't have `'\n'` if you were to type a `'` and send a
|
||||
|
||||
@@ -305,7 +305,7 @@ monkey; I thought the monkey had it too easy: unlike his limited keyboard I have
|
||||
<code>isprint()</code> returns non-zero except that only capital letters are included;
|
||||
the file <a href="prog.alt.c">prog.alt.c</a> has a slightly smaller keyboard. There are some
|
||||
additional features I have added (including two Easter eggs); amongst others:
|
||||
ability to change the target string and maximum length. See<br />
|
||||
ability to change the target string and maximum length. See
|
||||
<strong><a href="#how">How it works</a></strong>, <strong><a href="#hints">Hints</a></strong> and <strong><a href="#build">How to build</a></strong> for
|
||||
more details.</p>
|
||||
<p>In its simplest invocation this program will work its way (using a genetic
|
||||
@@ -481,8 +481,8 @@ specially by your shell e.g. parentheses. For instance if you just want to find
|
||||
<pre><code> ./weasel "METHINKS IT IS A" "MONKEY"
|
||||
./weasel METHINKS IT IS A MONKEY</code></pre>
|
||||
<p>It will search for <code>MONKEY</code> in both cases; in other words it’s the last one.
|
||||
If the string is too long given the value of <code>S</code> (see<br />
|
||||
<strong><a href="#build">How to build</a></strong>) it will be truncated.</p>
|
||||
If the string is too long given the value of <code>S</code> (see <strong><a href="#build">How to build</a></strong>)
|
||||
it will be truncated.</p>
|
||||
<p>If you actually do want to search for a string starting with a <code>-</code> you must
|
||||
disable further parsing of options by using the <code>-</code> option itself; for
|
||||
example if you were to do any of:</p>
|
||||
@@ -497,7 +497,7 @@ longer parse additional options: only target strings if anything left on the
|
||||
command line. Because of the joining of arguments this means that the first two
|
||||
examples of the last set of three above are equivalent i.e. the following two
|
||||
are equivalent:</p>
|
||||
<pre><code> -q-\
|
||||
<pre><code> -q-
|
||||
-q --</code></pre>
|
||||
<p>As for the caveat I referenced what does the following do?</p>
|
||||
<pre><code> ./weasel -qr 5</code></pre>
|
||||
@@ -660,7 +660,7 @@ people. Take the following invocations:</p>
|
||||
<pre><code> (1) $ echo test > test
|
||||
(2) $ ./weasel test
|
||||
(3) $ ./weasel < test
|
||||
(4) $ cat test | ./weasel\
|
||||
(4) $ cat test | ./weasel
|
||||
(5) $ < test-strings.txt ./weasel
|
||||
(6) $ cat | ./weasel</code></pre>
|
||||
<p>Only the first invocation of <code>./weasel</code> will search for <code>TEST</code> because
|
||||
@@ -718,7 +718,7 @@ example shows (but the strings will still only be read from the
|
||||
<p>Skip to <a href="#obfuscation">Obfuscation</a>.</p>
|
||||
<p>There is a type of input error, as I said, that might appear to be a bug. What
|
||||
actually is going on though is due to a technicality on how spaces are printed
|
||||
and the fact the program does not accept spaces other than a literal space<br />
|
||||
and the fact the program does not accept spaces other than a literal space
|
||||
<code></code>; when a character in the string to be found isn’t in the keyboard the
|
||||
program prints an error message and then exits (returning 1). But since the
|
||||
keyboard doesn’t have <code>'\n'</code> if you were to type a <code>'</code> and send a
|
||||
|
||||
@@ -104,8 +104,7 @@ Limitations](#issues-and-limitations).
|
||||
To build:
|
||||
|
||||
```
|
||||
${CC} -o prog prog.c -std=c11 -O3 \
|
||||
-Wall -Wextra -pedantic -Wno-missing-prototypes
|
||||
${CC} -o prog prog.c -std=c11 -O3 -Wall -Wextra -pedantic -Wno-missing-prototypes
|
||||
```
|
||||
|
||||
`-Wno-missing-prototypes` is necessary because there aren't any
|
||||
|
||||
@@ -209,8 +209,7 @@ implementation of counting sort, which sorts each group.</p>
|
||||
Limitations</a>.</p>
|
||||
<h3 id="building">Building:</h3>
|
||||
<p>To build:</p>
|
||||
<pre><code> ${CC} -o prog prog.c -std=c11 -O3 \
|
||||
-Wall -Wextra -pedantic -Wno-missing-prototypes</code></pre>
|
||||
<pre><code> ${CC} -o prog prog.c -std=c11 -O3 -Wall -Wextra -pedantic -Wno-missing-prototypes</code></pre>
|
||||
<p><code>-Wno-missing-prototypes</code> is necessary because there aren’t any
|
||||
prototypes. (They would put the program well over the size limit.)</p>
|
||||
<p>Note: The program can also be built with <code>-std=c99</code> or <code>-std=c89</code>.</p>
|
||||
|
||||
+10
-10
@@ -28,48 +28,48 @@ and non-zero).
|
||||
|
||||
### Variables:
|
||||
|
||||
* **WAIT**\
|
||||
* **WAIT**<br>
|
||||
positive or negative integer that changes how long to wait for
|
||||
a key press prior to moving again. < 0 blocks which allows
|
||||
for complete control over movement at your own pace. Default
|
||||
231; you can move faster by holding down or rapidly pressing an
|
||||
arrow key.
|
||||
|
||||
* **WALLS**\
|
||||
* **WALLS**<br>
|
||||
whether the walls are passable or impassable. Default passable,
|
||||
1; 0 makes walls impassable where you die if you hit a wall.
|
||||
|
||||
* **EVADE**\
|
||||
* **EVADE**<br>
|
||||
how many movements the Snake moves before the bug (well
|
||||
insect; see notes below about why bugs) will move to
|
||||
another location in the field. Default 300; 0 disables.
|
||||
|
||||
* **SIZE**\
|
||||
* **SIZE**<br>
|
||||
initial size of the Snake. Note that it grows by one per
|
||||
move so at the default 5 it will not initially be 5
|
||||
characters long! < 0 is likely an immediate win.
|
||||
|
||||
* **MAXSIZE**\
|
||||
* **MAXSIZE**<br>
|
||||
the maximum size the Snake can become before the game is
|
||||
won. < 0 is the maximum size based on terminal dimensions;
|
||||
any other size will be capped based on the terminal
|
||||
dimensions to prevent problems. Note that when **SIZE+GROW >=
|
||||
MAXSIZE** you win _before_ you grow to the full size!
|
||||
|
||||
* **GROW**\
|
||||
* **GROW**<br>
|
||||
size to grow every time you eat a bug. Default 5; negative
|
||||
values are allowed. 'Negativity' creates for fun gameplay modes with
|
||||
enough creativity. See [gameplay.html](gameplay.html)
|
||||
GitHub) as well as [play.sh](play.sh) for some examples.
|
||||
|
||||
* **SHED**\
|
||||
* **SHED**<br>
|
||||
every **SHED** movements you will grow (> 0), shrink (< 0) or
|
||||
stay the same length (0) by the **SHEDS** (below) value. Again
|
||||
with creativity you can create some fun gameplay modes. NOTE:
|
||||
the concept of shedding in this game is a misnomer; see notes
|
||||
below.
|
||||
|
||||
* **SHEDS**\
|
||||
* **SHEDS**<br>
|
||||
every **SHED** movements will impact what this value means: grow
|
||||
(> 0), shrink (< 0) or not at all (0). Exception: if the snake
|
||||
eats a bug the counter isn't incremented. Again with creativity
|
||||
@@ -80,7 +80,7 @@ and non-zero).
|
||||
NOTE: the concept of shedding in this game is a misnomer; see
|
||||
notes below.
|
||||
|
||||
* **CANNIBAL**\
|
||||
* **CANNIBAL**<br>
|
||||
whether you can go through the Snake or not. Default is 0
|
||||
(cannot - die if you try).
|
||||
|
||||
@@ -160,7 +160,7 @@ Here are some other features of the game:
|
||||
|
||||
* A drawing/practising mode (**WAIT** < 0 makes `timeout()` block).
|
||||
|
||||
* Computer plays the game (**WAIT=0**).\
|
||||
* Computer plays the game (**WAIT=0**).<br>
|
||||
- **EPILEPSY/STIMULATION OVERLOAD WARNING** included in the relevant
|
||||
section (this goes for a low **EVADE** value too).
|
||||
|
||||
|
||||
+10
-11
@@ -163,41 +163,41 @@ Location: <a href="../../location.html#US">US</a> - <em>United States of America
|
||||
and non-zero).</p>
|
||||
<h3 id="variables">Variables:</h3>
|
||||
<ul>
|
||||
<li><p><strong>WAIT</strong><br />
|
||||
<li><p><strong>WAIT</strong><br>
|
||||
positive or negative integer that changes how long to wait for
|
||||
a key press prior to moving again. < 0 blocks which allows
|
||||
for complete control over movement at your own pace. Default
|
||||
231; you can move faster by holding down or rapidly pressing an
|
||||
arrow key.</p></li>
|
||||
<li><p><strong>WALLS</strong><br />
|
||||
<li><p><strong>WALLS</strong><br>
|
||||
whether the walls are passable or impassable. Default passable,
|
||||
1; 0 makes walls impassable where you die if you hit a wall.</p></li>
|
||||
<li><p><strong>EVADE</strong><br />
|
||||
<li><p><strong>EVADE</strong><br>
|
||||
how many movements the Snake moves before the bug (well
|
||||
insect; see notes below about why bugs) will move to
|
||||
another location in the field. Default 300; 0 disables.</p></li>
|
||||
<li><p><strong>SIZE</strong><br />
|
||||
<li><p><strong>SIZE</strong><br>
|
||||
initial size of the Snake. Note that it grows by one per
|
||||
move so at the default 5 it will not initially be 5
|
||||
characters long! < 0 is likely an immediate win.</p></li>
|
||||
<li><p><strong>MAXSIZE</strong><br />
|
||||
<li><p><strong>MAXSIZE</strong><br>
|
||||
the maximum size the Snake can become before the game is
|
||||
won. < 0 is the maximum size based on terminal dimensions;
|
||||
any other size will be capped based on the terminal
|
||||
dimensions to prevent problems. Note that when <strong>SIZE+GROW >=
|
||||
MAXSIZE</strong> you win <em>before</em> you grow to the full size!</p></li>
|
||||
<li><p><strong>GROW</strong><br />
|
||||
<li><p><strong>GROW</strong><br>
|
||||
size to grow every time you eat a bug. Default 5; negative
|
||||
values are allowed. ‘Negativity’ creates for fun gameplay modes with
|
||||
enough creativity. See <a href="gameplay.html">gameplay.html</a>
|
||||
GitHub) as well as <a href="play.sh">play.sh</a> for some examples.</p></li>
|
||||
<li><p><strong>SHED</strong><br />
|
||||
<li><p><strong>SHED</strong><br>
|
||||
every <strong>SHED</strong> movements you will grow (> 0), shrink (< 0) or
|
||||
stay the same length (0) by the <strong>SHEDS</strong> (below) value. Again
|
||||
with creativity you can create some fun gameplay modes. NOTE:
|
||||
the concept of shedding in this game is a misnomer; see notes
|
||||
below.</p></li>
|
||||
<li><p><strong>SHEDS</strong><br />
|
||||
<li><p><strong>SHEDS</strong><br>
|
||||
every <strong>SHED</strong> movements will impact what this value means: grow
|
||||
(> 0), shrink (< 0) or not at all (0). Exception: if the snake
|
||||
eats a bug the counter isn’t incremented. Again with creativity
|
||||
@@ -207,7 +207,7 @@ and then it’s a battle of whether you win by <strong>SIZE < 0</strong> or
|
||||
<strong>SIZE >= MAXSIZE</strong>. See <a href="play.sh">play.sh</a> for examples.
|
||||
NOTE: the concept of shedding in this game is a misnomer; see
|
||||
notes below.</p></li>
|
||||
<li><p><strong>CANNIBAL</strong><br />
|
||||
<li><p><strong>CANNIBAL</strong><br>
|
||||
whether you can go through the Snake or not. Default is 0
|
||||
(cannot - die if you try).</p></li>
|
||||
</ul>
|
||||
@@ -273,8 +273,7 @@ file modify the behaviour of Snake.</p>
|
||||
<p>Here are some other features of the game:</p>
|
||||
<ul>
|
||||
<li><p>A drawing/practising mode (<strong>WAIT</strong> < 0 makes <code>timeout()</code> block).</p></li>
|
||||
<li><p>Computer plays the game (<strong>WAIT=0</strong>).<br />
|
||||
</p>
|
||||
<li><p>Computer plays the game (<strong>WAIT=0</strong>).<br></p>
|
||||
<ul>
|
||||
<li><strong>EPILEPSY/STIMULATION OVERLOAD WARNING</strong> included in the relevant
|
||||
section (this goes for a low <strong>EVADE</strong> value too).</li>
|
||||
|
||||
+121
-125
@@ -34,7 +34,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1984/anonymous/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:32+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:12:02+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1984/anonymous/Makefile</loc>
|
||||
@@ -46,7 +46,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1984/anonymous/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:11:52+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1984/decot/1984_decot.tar.bz2</loc>
|
||||
@@ -94,7 +94,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1984/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:07+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:33+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1984/laman/1984_laman.tar.bz2</loc>
|
||||
@@ -290,7 +290,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1985/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:08+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:33+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1985/lycklama/1985_lycklama.tar.bz2</loc>
|
||||
@@ -646,7 +646,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1986/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:08+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:34+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1986/Makefile</loc>
|
||||
@@ -894,7 +894,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1987/heckbert/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:42+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:17:30+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1987/heckbert/Makefile</loc>
|
||||
@@ -906,7 +906,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1987/heckbert/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:16:39+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1987/heckbert/try.sh</loc>
|
||||
@@ -962,7 +962,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1987/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:08+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:34+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1987/korn/1987_korn.tar.bz2</loc>
|
||||
@@ -1222,7 +1222,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1988/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:09+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:35+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1988/isaak/1988_isaak.tar.bz2</loc>
|
||||
@@ -1402,7 +1402,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1988/robison/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:48+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:21:28+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1988/robison/Makefile</loc>
|
||||
@@ -1414,7 +1414,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1988/robison/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:21:14+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1988/robison/robison.c</loc>
|
||||
@@ -1578,7 +1578,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1989/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:09+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:35+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1989/jar.1/1989_jar.1.tar.bz2</loc>
|
||||
@@ -2090,7 +2090,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1990/dds/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:56+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:17:57+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1990/dds/LANDER.BAS</loc>
|
||||
@@ -2106,7 +2106,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1990/dds/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:01:22+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1990/dg/1990_dg.tar.bz2</loc>
|
||||
@@ -2158,7 +2158,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1990/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:10+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:36+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1990/jaw/1990_jaw.tar.bz2</loc>
|
||||
@@ -2178,7 +2178,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1990/jaw/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:57+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:17:58+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1990/jaw/jaw.c</loc>
|
||||
@@ -2198,7 +2198,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1990/jaw/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:14:21+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1990/jaw/shark.sh</loc>
|
||||
@@ -2498,7 +2498,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/ant/index.html</loc>
|
||||
<lastmod>2024-04-16T23:14:00+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:18:02+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/ant/Makefile</loc>
|
||||
@@ -2510,7 +2510,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/ant/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:02:43+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/brnstnd/1991_brnstnd.tar.bz2</loc>
|
||||
@@ -2814,7 +2814,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:10+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:36+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/Makefile</loc>
|
||||
@@ -2838,7 +2838,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/rince/index.html</loc>
|
||||
<lastmod>2024-04-16T23:14:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:18:05+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/rince/Makefile</loc>
|
||||
@@ -2850,7 +2850,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/rince/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:14:33+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/rince/rince.alt2.c</loc>
|
||||
@@ -2886,7 +2886,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/westley/index.html</loc>
|
||||
<lastmod>2024-04-16T23:14:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:18:06+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/westley/Makefile</loc>
|
||||
@@ -2898,7 +2898,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/westley/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:05:22+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1991/westley/ttt.alt.sh</loc>
|
||||
@@ -3330,7 +3330,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1992/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:10+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:37+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1992/kivinen/1992_kivinen.tar.bz2</loc>
|
||||
@@ -3518,7 +3518,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1992/vern/index.html</loc>
|
||||
<lastmod>2024-04-16T23:14:11+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:18:12+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1992/vern/Makefile</loc>
|
||||
@@ -3530,7 +3530,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1992/vern/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:14:50+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1992/vern/vern.c</loc>
|
||||
@@ -3554,7 +3554,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1992/westley/index.html</loc>
|
||||
<lastmod>2024-04-16T23:14:11+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:18:12+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1992/westley/Makefile</loc>
|
||||
@@ -3566,7 +3566,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1992/westley/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:06:30+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1992/westley/try.sh</loc>
|
||||
@@ -3834,7 +3834,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1993/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:11+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:37+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1993/jonth/1993_jonth.tar.bz2</loc>
|
||||
@@ -4134,7 +4134,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1993/vanb/index.html</loc>
|
||||
<lastmod>2024-04-16T23:14:17+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:57:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1993/vanb/Makefile</loc>
|
||||
@@ -4146,7 +4146,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1993/vanb/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:00:58+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1993/vanb/try.sh</loc>
|
||||
@@ -4366,7 +4366,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1994/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:11+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:37+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1994/ldb/1994_ldb.tar.bz2</loc>
|
||||
@@ -5006,7 +5006,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1995/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:12+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:38+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1995/leo/1995_leo.tar.bz2</loc>
|
||||
@@ -5022,7 +5022,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1995/leo/index.html</loc>
|
||||
<lastmod>2024-04-16T23:14:26+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:57:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1995/leo/leo.c</loc>
|
||||
@@ -5042,7 +5042,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1995/leo/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:58:37+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1995/leo/spoiler1.html</loc>
|
||||
@@ -5502,7 +5502,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1996/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:12+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:38+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1996/jonth/1996_jonth.tar.bz2</loc>
|
||||
@@ -6250,7 +6250,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1998/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:13+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:39+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1998/Makefile</loc>
|
||||
@@ -6326,7 +6326,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1998/schweikh1/index.html</loc>
|
||||
<lastmod>2024-04-16T23:14:40+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:18:40+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1998/schweikh1/info</loc>
|
||||
@@ -6350,7 +6350,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1998/schweikh1/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:07:03+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/1998/schweikh1/schweikh1.alt.c</loc>
|
||||
@@ -6770,7 +6770,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2000/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:13+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:39+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2000/jarijyrki/2000_jarijyrki.tar.bz2</loc>
|
||||
@@ -6970,7 +6970,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2000/robison/index.html</loc>
|
||||
<lastmod>2024-04-16T23:14:47+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:57:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2000/robison/Makefile</loc>
|
||||
@@ -6982,7 +6982,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2000/robison/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:58:40+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2000/robison/robison.c</loc>
|
||||
@@ -7494,7 +7494,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/herrmann2/index.html</loc>
|
||||
<lastmod>2024-04-16T23:14:52+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:57:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/herrmann2/Makefile</loc>
|
||||
@@ -7506,7 +7506,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/herrmann2/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:00:58+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/herrmann2/try.sh</loc>
|
||||
@@ -7514,7 +7514,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:13+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:40+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/jason/2001_jason.tar.bz2</loc>
|
||||
@@ -7738,7 +7738,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/westley/index.html</loc>
|
||||
<lastmod>2024-04-16T23:14:56+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:57:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/westley/Makefile</loc>
|
||||
@@ -7750,7 +7750,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/westley/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:58:48+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2001/westley/try.sh</loc>
|
||||
@@ -7834,7 +7834,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2004/anonymous/index.html</loc>
|
||||
<lastmod>2024-04-16T23:14:57+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:18:57+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2004/anonymous/Makefile</loc>
|
||||
@@ -7846,7 +7846,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2004/anonymous/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:07:53+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2004/anonymous/try.sh</loc>
|
||||
@@ -8290,7 +8290,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2004/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:14+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:40+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2004/jdalbec/2004_jdalbec.tar.bz2</loc>
|
||||
@@ -8990,7 +8990,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2005/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:14+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:41+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2005/jetro/2005_jetro.tar.bz2</loc>
|
||||
@@ -9266,7 +9266,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2005/sykes/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:09+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:19:09+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2005/sykes/kernel-2.901465-03.bin</loc>
|
||||
@@ -9290,7 +9290,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2005/sykes/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:09:01+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2005/sykes/sykes.c</loc>
|
||||
@@ -9734,7 +9734,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2006/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:15+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:41+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2006/Makefile</loc>
|
||||
@@ -10274,7 +10274,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2006/toledo2/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:18+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:19:18+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2006/toledo2/KAYPROII.ZIP</loc>
|
||||
@@ -10290,7 +10290,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2006/toledo2/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:09:12+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2006/toledo2/toledo2.alt.c</loc>
|
||||
@@ -11010,7 +11010,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2011/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:15+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:41+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2011/konno/2011_konno.tar.bz2</loc>
|
||||
@@ -11126,7 +11126,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:25+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:19:25+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/keysym.h</loc>
|
||||
@@ -11146,7 +11146,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:09:29+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2011/toledo/toledo.alt2.c</loc>
|
||||
@@ -11582,7 +11582,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/endoh2/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:28+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:19:28+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/endoh2/Makefile</loc>
|
||||
@@ -11594,7 +11594,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/endoh2/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:09:39+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/endoh2/try.sh</loc>
|
||||
@@ -11650,7 +11650,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/grothe/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:29+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:57:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/grothe/Makefile</loc>
|
||||
@@ -11662,7 +11662,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/grothe/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:59:23+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/grothe/try.sh</loc>
|
||||
@@ -11790,7 +11790,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:16+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:42+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/kang/2012_kang.tar.bz2</loc>
|
||||
@@ -12006,7 +12006,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/tromp/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:32+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:19:32+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/tromp/inflate.Blc</loc>
|
||||
@@ -12038,7 +12038,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/tromp/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:10:23+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2012/tromp/symbolic.Blc</loc>
|
||||
@@ -12286,7 +12286,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2013/birken/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:34+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:57:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2013/birken/ioccc.txt</loc>
|
||||
@@ -12398,7 +12398,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2013/birken/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:59:26+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2013/birken/rhino.txt</loc>
|
||||
@@ -13574,7 +13574,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2013/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:16+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:42+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2013/iocccsize.c</loc>
|
||||
@@ -13766,7 +13766,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2013/robison/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:41+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:19:40+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2013/robison/Makefile</loc>
|
||||
@@ -13778,7 +13778,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2013/robison/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:10:43+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2013/robison/robison.c</loc>
|
||||
@@ -14054,7 +14054,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2014/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:17+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:43+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2014/iocccsize.c</loc>
|
||||
@@ -14618,7 +14618,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/endoh1/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:49+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:57:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/endoh1/ioccc.txt</loc>
|
||||
@@ -14646,7 +14646,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/endoh1/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:00:58+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/endoh2/2015_endoh2.tar.bz2</loc>
|
||||
@@ -14806,7 +14806,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/hou/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:51+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:19:50+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/hou/large</loc>
|
||||
@@ -14830,7 +14830,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/hou/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:10:54+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/hou/rfc1321.txt</loc>
|
||||
@@ -14862,7 +14862,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/howe/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:51+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:19:51+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/howe/Makefile</loc>
|
||||
@@ -14894,7 +14894,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/howe/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:11:02+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/howe/spoiler/err.h</loc>
|
||||
@@ -14918,7 +14918,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:17+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:43+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/iocccsize.c</loc>
|
||||
@@ -15142,7 +15142,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/schweikhardt/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:53+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:19:53+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/schweikhardt/Makefile</loc>
|
||||
@@ -15162,7 +15162,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/schweikhardt/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:11:22+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2015/schweikhardt/try.sh</loc>
|
||||
@@ -15386,7 +15386,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/burton1/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:56+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:19:55+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/burton1/Makefile</loc>
|
||||
@@ -15410,7 +15410,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/burton1/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:11:48+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/burton1/scripthd.sh</loc>
|
||||
@@ -15478,7 +15478,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/burton2/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:57+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:19:56+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/burton2/iocccbug01.c</loc>
|
||||
@@ -15554,7 +15554,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/burton2/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:12:04+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/burton2/results</loc>
|
||||
@@ -15782,7 +15782,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/endoh2/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:58+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:57:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/endoh2/Makefile</loc>
|
||||
@@ -15810,7 +15810,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/endoh2/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:00:58+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/endoh2/run.sh</loc>
|
||||
@@ -15850,7 +15850,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/ferguson/index.html</loc>
|
||||
<lastmod>2024-04-16T23:15:59+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:19:58+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/ferguson/Makefile</loc>
|
||||
@@ -15882,7 +15882,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/ferguson/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:13:06+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/ferguson/rpm.html</loc>
|
||||
@@ -16022,7 +16022,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:18+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:44+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/iocccsize.c</loc>
|
||||
@@ -16170,7 +16170,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/vokes/index.html</loc>
|
||||
<lastmod>2024-04-16T23:16:01+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:20:00+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/vokes/ioccc.txt</loc>
|
||||
@@ -16194,7 +16194,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/vokes/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:13:12+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2018/vokes/try.sh</loc>
|
||||
@@ -16822,7 +16822,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2019/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:18+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:44+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2019/iocccsize.c</loc>
|
||||
@@ -16978,7 +16978,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2019/mills/index.html</loc>
|
||||
<lastmod>2024-04-16T23:16:08+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:57:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2019/mills/IOCCC-hints.cp09_1.809</loc>
|
||||
@@ -17014,7 +17014,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2019/mills/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:00:58+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2019/mills/Shakespeare.cp04_1.633</loc>
|
||||
@@ -17518,7 +17518,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson1/index.html</loc>
|
||||
<lastmod>2024-04-16T23:16:12+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:20:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson1/ioccc-cake.jpg</loc>
|
||||
@@ -17562,7 +17562,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson1/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:13:37+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson1/snake.1</loc>
|
||||
@@ -17622,7 +17622,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson2/index.html</loc>
|
||||
<lastmod>2024-04-16T23:16:13+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:57:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson2/input.txt</loc>
|
||||
@@ -17670,7 +17670,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson2/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:00:58+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/ferguson2/recode.1</loc>
|
||||
@@ -17762,7 +17762,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/index.html</loc>
|
||||
<lastmod>2024-04-16T23:13:18+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:25:44+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/iocccsize.c</loc>
|
||||
@@ -18066,7 +18066,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/tsoj/index.html</loc>
|
||||
<lastmod>2024-04-16T23:16:16+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:57:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/tsoj/Makefile</loc>
|
||||
@@ -18090,7 +18090,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/tsoj/README.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T07:00:58+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/2020/yang/2020_yang.tar.bz2</loc>
|
||||
@@ -18946,7 +18946,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/authors.html</loc>
|
||||
<lastmod>2024-04-16T23:13:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T03:39:54+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/author/Sjoerd_Mullender.json</loc>
|
||||
@@ -19078,11 +19078,11 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/gen-authors.sh</loc>
|
||||
<lastmod>2024-04-16T19:14:55+00:00</lastmod>
|
||||
<lastmod>2024-04-17T03:39:46+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/gen-location.sh</loc>
|
||||
<lastmod>2024-04-16T19:14:55+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:42:51+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/gen-other-html.sh</loc>
|
||||
@@ -19098,15 +19098,15 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/gen-top-html.sh</loc>
|
||||
<lastmod>2024-04-16T19:14:55+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:29:11+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/gen-year-index.sh</loc>
|
||||
<lastmod>2024-04-16T19:14:55+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:24:56+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/gen-years.sh</loc>
|
||||
<lastmod>2024-04-16T19:14:55+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:20:43+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/index.html</loc>
|
||||
@@ -19120,10 +19120,6 @@
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/md2html.sh</loc>
|
||||
<lastmod>2024-04-16T23:09:56+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/.md2html.sh.swp</loc>
|
||||
<lastmod>2024-04-16T23:11:15+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/output-index-author.sh</loc>
|
||||
<lastmod>2024-04-16T19:14:55+00:00</lastmod>
|
||||
@@ -19162,7 +19158,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/status2html.sh</loc>
|
||||
<lastmod>2024-04-16T19:14:55+00:00</lastmod>
|
||||
<lastmod>2024-04-17T04:17:20+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bin/subst.default.sh</loc>
|
||||
@@ -19202,11 +19198,11 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bugs.html</loc>
|
||||
<lastmod>2024-04-16T23:05:43+00:00</lastmod>
|
||||
<lastmod>2024-04-17T05:36:44+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/bugs.md</loc>
|
||||
<lastmod>2024-04-15T23:44:05+00:00</lastmod>
|
||||
<lastmod>2024-04-17T05:38:38+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/CODE_OF_CONDUCT.html</loc>
|
||||
@@ -19218,19 +19214,19 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/contact.html</loc>
|
||||
<lastmod>2024-04-16T23:05:43+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:00:08+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/contact.md</loc>
|
||||
<lastmod>2024-04-15T23:42:37+00:00</lastmod>
|
||||
<lastmod>2024-04-17T06:00:03+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/faq.html</loc>
|
||||
<lastmod>2024-04-16T23:05:43+00:00</lastmod>
|
||||
<lastmod>2024-04-17T04:47:07+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/faq.md</loc>
|
||||
<lastmod>2024-04-15T23:47:35+00:00</lastmod>
|
||||
<lastmod>2024-04-17T04:46:50+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/.gitignore</loc>
|
||||
@@ -19394,11 +19390,11 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/index.html</loc>
|
||||
<lastmod>2024-04-16T23:04:22+00:00</lastmod>
|
||||
<lastmod>2024-04-17T05:47:27+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/index.md</loc>
|
||||
<lastmod>2024-04-12T18:22:04+00:00</lastmod>
|
||||
<lastmod>2024-04-17T05:47:22+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/ioccc.css</loc>
|
||||
@@ -19418,7 +19414,7 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/location.html</loc>
|
||||
<lastmod>2024-04-16T23:13:06+00:00</lastmod>
|
||||
<lastmod>2024-04-17T01:43:00+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/Makefile</loc>
|
||||
@@ -19450,11 +19446,11 @@
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/thanks-for-help.html</loc>
|
||||
<lastmod>2024-04-16T23:05:46+00:00</lastmod>
|
||||
<lastmod>2024-04-17T05:42:20+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/thanks-for-help.md</loc>
|
||||
<lastmod>2024-04-15T23:48:14+00:00</lastmod>
|
||||
<lastmod>2024-04-17T05:42:04+00:00</lastmod>
|
||||
</url>
|
||||
<url>
|
||||
<loc>https://ioccc-src.github.io/temp-test-ioccc/.top</loc>
|
||||
|
||||
Reference in new issue
Block a user