replace old ASCII > style with markdown code blocks

This commit is contained in:
Landon Curt Noll committed 2024-04-17 00:45:05 -07:00
1 parent 4c3649a3c1
commit e695c5cf03
45 files changed
+437 -480

No files matched your search

+2 -2
View File
@@ -95,7 +95,7 @@ Yes, the test suite really is 5 times larger than the actual program. You
`./sudoku-sf`. If you rename it, please change the definition of `$sf_exe` to the
new name.
> Judges' note: this was done.
**Judges' note**: this was done.
### Legal blurb
@@ -150,7 +150,7 @@ Now, with modern computers this **can** be solved using brute force, e.g.:
:n%27?"\n":n%81?"\n------+-------+------\n":"\n\n"));}return z;}
```
> Judges' note: this was added as [aidan.alt.c](aidan.alt.c).
**Judges' note**: this was added as [aidan.alt.c](aidan.alt.c).
That isn't the approach I've used; it's slow (particularly in worst-case or
nearly so scenarios), inelegant, and not a good starting point for sudoku
+2 -6
View File
@@ -201,9 +201,7 @@ generate new ones.</p>
<p><a href="test-su.perl">test.perl</a> expects the <code>sudoku-sf</code> executable to be
<code>./sudoku-sf</code>. If you rename it, please change the definition of <code>$sf_exe</code> to the
new name.</p>
<blockquote>
<p>Judges’ note: this was done.</p>
</blockquote>
<p><strong>Judges’ note</strong>: this was done.</p>
<h3 id="legal-blurb">Legal blurb</h3>
<p>This program comes with NO WARRANTY, not even that it’ll do what I say it
should. Any misfortunes that occur as a result of using this are not my fault.
@@ -241,9 +239,7 @@ Telegraph</a>, a UK newspaper.</p>
d;for(n=p;i[++p];);s[p]=n;i[p]=1;goto f;d:z=p&lt;81;printf(&quot;\n%s!\n\n&quot;,z?&quot;Fail&quot;:
&quot;Success&quot;);for(n=0;n&lt;81;){p=i[n];printf(&quot;%c %s&quot;,(p?p|48:&#39;.&#39;),(++n%3?&quot;&quot;:n%9?&quot;| &quot;
:n%27?&quot;\n&quot;:n%81?&quot;\n------+-------+------\n&quot;:&quot;\n\n&quot;));}return z;}</code></pre>
<blockquote>
<p>Judges’ note: this was added as <a href="aidan.alt.c">aidan.alt.c</a>.</p>
</blockquote>
<p><strong>Judges’ note</strong>: this was added as <a href="aidan.alt.c">aidan.alt.c</a>.</p>
<p>That isn’t the approach I’ve used; it’s slow (particularly in worst-case or
nearly so scenarios), inelegant, and not a good starting point for sudoku
generation. It’s also much too easy to understand ;-) Instead, I’ve written a
+2 -2
View File
@@ -108,7 +108,7 @@ factors.
Therefore this entry is limited to
> ![floor\bigg(\frac{10^6}{4\times(sizeof(double)+1)}-1\bigg)](eqn.png)
![floor\bigg(\frac{10^6}{4\times(sizeof(double)+1)}-1\bigg)](eqn.png)
points and won't even be suitable for more than a few thousand; although
generated files did pass the [W3C SVG
@@ -181,7 +181,7 @@ viewport and potentially every
### Example Output
> ![Voronoi diagram of two regular pentagon vertices](Voronoi.png)
![Voronoi diagram of two regular pentagon vertices](Voronoi.png)
<!--
-4
View File
@@ -209,12 +209,10 @@ hard to qualify under the IOCCC size limit. So guess what I did? A compromise
favoring innermost obfuscation, sacrificing sometimes speed and other tedious
factors.</p>
<p>Therefore this entry is limited to</p>
<blockquote>
<figure>
<img src="eqn.png" alt="floor(-1)" />
<figcaption aria-hidden="true">floor(-1)</figcaption>
</figure>
</blockquote>
<p>points and won’t even be suitable for more than a few thousand; although
generated files did pass the <a href="https://validator.w3.org/#validate_by_upload+with_options">W3C SVG
Validator</a>, and are
@@ -266,12 +264,10 @@ viewport and potentially every
<li><a href="http://www.snibbe.com/scott/bf">Voronoi and Art</a></li>
</ul>
<h3 id="example-output">Example Output</h3>
<blockquote>
<figure>
<img src="Voronoi.png" alt="Voronoi diagram of two regular pentagon vertices" />
<figcaption aria-hidden="true">Voronoi diagram of two regular pentagon vertices</figcaption>
</figure>
</blockquote>
<!--
Copyright © 1984-2024 by Landon Curt Noll. All Rights Reserved.