replace old ASCII > style with markdown code blocks

2020/ferguson2/README.md

@@ -210,18 +210,20 @@ With my entry we can complete the loop!
 The author [Nathan Sidwell](../../authors.html#Nathan_Sidwell) of the [1992 Worst
 Abuse of the Rules][] had this to say about his program:
 
-> This program is a hello world text encrypter/decrypter. It uses an
-[enigma](https://www.cryptomuseum.com/crypto/enigma/index.htm) (I think) style
-encryption algorithm, where the encryption key character is modified by a value,
-determined from the previous character.  Non-printable characters (those with
-ASCII values `< ' '` or `> 0x7e`) are passed unaltered, thus any kind of file
-may be successfully processed, but if the original is printable, the processed
-file will be too. The input is read from stdin, and the output presented to
-stdout. The key, a text string, is presented as a command argument. This is
-optional, and if omitted, the file is self-{de,en}crypted. To specify
-decryption, a `-` should be given before the key. (Actually encryption and
-decryption proper inverse operations, so you can use decrypt to scramble and
-encrypt to descramble, if you're perverse.)
+```
+    This program is a hello world text encrypter/decrypter. It uses an
+    [enigma](https://www.cryptomuseum.com/crypto/enigma/index.htm) (I think) style
+    encryption algorithm, where the encryption key character is modified by a value,
+    determined from the previous character.  Non-printable characters (those with
+    ASCII values `< ' '` or `> 0x7e`) are passed unaltered, thus any kind of file
+    may be successfully processed, but if the original is printable, the processed
+    file will be too. The input is read from stdin, and the output presented to
+    stdout. The key, a text string, is presented as a command argument. This is
+    optional, and if omitted, the file is self-{de,en}crypted. To specify
+    decryption, a `-` should be given before the key. (Actually encryption and
+    decryption proper inverse operations, so you can use decrypt to scramble and
+    encrypt to descramble, if you're perverse.)
+```
 
 
 But the Enigma algorithm is more complex than that and my entry can encipher

2020/ferguson2/index.html

@@ -293,20 +293,18 @@ With my entry we can complete the loop!</p>
 <h3 id="the-1992-nathan-sidwell-entry"><a name="nathan" href="#toc">The 1992 Nathan Sidwell entry</a></h3>
 <p>The author <a href="../../authors.html#Nathan_Sidwell">Nathan Sidwell</a> of the <a href="../../1992/nathan/index.html">1992 Worst
 Abuse of the Rules</a> had this to say about his program:</p>
-<blockquote>
-<p>This program is a hello world text encrypter/decrypter. It uses an
-<a href="https://www.cryptomuseum.com/crypto/enigma/index.htm">enigma</a> (I think) style
-encryption algorithm, where the encryption key character is modified by a value,
-determined from the previous character. Non-printable characters (those with
-ASCII values <code>&lt; ' '</code> or <code>&gt; 0x7e</code>) are passed unaltered, thus any kind of file
-may be successfully processed, but if the original is printable, the processed
-file will be too. The input is read from stdin, and the output presented to
-stdout. The key, a text string, is presented as a command argument. This is
-optional, and if omitted, the file is self-{de,en}crypted. To specify
-decryption, a <code>-</code> should be given before the key. (Actually encryption and
-decryption proper inverse operations, so you can use decrypt to scramble and
-encrypt to descramble, if you’re perverse.)</p>
-</blockquote>
+<pre><code>    This program is a hello world text encrypter/decrypter. It uses an
+    [enigma](https://www.cryptomuseum.com/crypto/enigma/index.htm) (I think) style
+    encryption algorithm, where the encryption key character is modified by a value,
+    determined from the previous character.  Non-printable characters (those with
+    ASCII values `&lt; &#39; &#39;` or `&gt; 0x7e`) are passed unaltered, thus any kind of file
+    may be successfully processed, but if the original is printable, the processed
+    file will be too. The input is read from stdin, and the output presented to
+    stdout. The key, a text string, is presented as a command argument. This is
+    optional, and if omitted, the file is self-{de,en}crypted. To specify
+    decryption, a `-` should be given before the key. (Actually encryption and
+    decryption proper inverse operations, so you can use decrypt to scramble and
+    encrypt to descramble, if you&#39;re perverse.)</code></pre>
 <p>But the Enigma algorithm is more complex than that and my entry can encipher
 (and by extension decipher) text in the manner of the Enigma machines of the
 <a href="https://en.wikipedia.org/wiki/German_Army_(1935%E2%80%931945)">Heer</a> (army) and <a href="https://en.wikipedia.org/wiki/Luftwaffe">Luftwaffe</a> (air

2020/kurdyukov4/README.md

@@ -21,9 +21,11 @@ context length decreases:
     ./try.sh
 ```
 
-> Performance depends on the number of same hashes found.
-> Too many identical strings if the context length is small.
-> -- Author
+```
+    Performance depends on the number of same hashes found.
+    Too many identical strings if the context length is small.
+    -- Author
+```
 
 
 ## Judges' remarks:
@@ -49,8 +51,10 @@ Example:
     # more ones in output
 ```
 
-> But this will happen very rarely on real data.
-> -- Author
+```
+    But this will happen very rarely on real data.
+    -- Author
+```
 
 ---
 

2020/kurdyukov4/index.html

@@ -158,11 +158,9 @@ Location: <a href="../../location.html#RU">RU</a> - <em>Russian Federation</em>
 <p>When running this, ask yourself why it gets progressively slower when the
 context length decreases:</p>
 <pre><code>    ./try.sh</code></pre>
-<blockquote>
-<p>Performance depends on the number of same hashes found.
-Too many identical strings if the context length is small.
-– Author</p>
-</blockquote>
+<pre><code>    Performance depends on the number of same hashes found.
+    Too many identical strings if the context length is small.
+    -- Author</code></pre>
 <h2 id="judges-remarks">Judges’ remarks:</h2>
 <p>We were able to <a href="rand.c">write our own program</a> performing the same trick using
 the (still non-standard, for some reason) library function <code>memmem()</code>, but that
@@ -178,10 +176,8 @@ Example:</p>
     # more twos in output
     ./rand test.txt 1000 2 123
     # more ones in output</code></pre>
-<blockquote>
-<p>But this will happen very rarely on real data.
-– Author</p>
-</blockquote>
+<pre><code>    But this will happen very rarely on real data.
+    -- Author</code></pre>
 <hr />
 <p>Try using the same random seed and varying the context size.</p>
 <p>BTW: what on Middle-earth is <code>lámatyávë</code>? It’s Quenya, one of the languages of