mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Merge pull request #2440 from xexyl/top-level-readme

Browse Source
This commit is contained in:
Landon Curt Noll authored and GitHub committed 2024-06-16 20:34:36 -07:00
2 parents 3eca16d55d 1209966118
commit 089d092b30
2 files changed
+8 -8
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

README.html
+4 -4
View File
@@ -491,9 +491,9 @@ recommended data to use. Authors also sometimes give spoilers.</p>
and reexamine it using some of the techniques outlined above. See if you can and reexamine it using some of the techniques outlined above. See if you can
convince yourself of why the program does what it does.</p> convince yourself of why the program does what it does.</p>
<h2 id="regarding-the-source-archive">Regarding the source archive:</h2> <h2 id="regarding-the-source-archive">Regarding the source archive:</h2>
<p>Each sub-directory contains all the entries for a single year. Often the file <p>Each subdirectory contains all the entries for a single year. Often the file
names match one of the last names of the author. Judges’ hints are given in names match one of the last names of the author. Judges’ hints and/or comments
files of the form <code>index.html</code>.</p> are given in each entry’s <code>index.html</code> file under the section <code>Judges' remarks</code>.</p>
<p>You may need to tweak the Makefile to get everything to compile correctly. Read <p>You may need to tweak the Makefile to get everything to compile correctly. Read
the index.html files for suggestions.</p> the index.html files for suggestions.</p>
<p>The rules for a given year are given in the file named <code>rules.txt</code>. Each <p>The rules for a given year are given in the file named <code>rules.txt</code>. Each
@@ -539,7 +539,7 @@ official entries that won the <strong>International Obfuscated C Code Contest (I
Internet’s oldest ongoing contest.</p> Internet’s oldest ongoing contest.</p>
<p><strong>IMPORTANT NOTE</strong>: See <a href="contact.html">contact.html</a> for up to date contact details <p><strong>IMPORTANT NOTE</strong>: See <a href="contact.html">contact.html</a> for up to date contact details
as well as details on how to provide fixes to any of the entries. as well as details on how to provide fixes to any of the entries.
See also <a href="faq.html">the IOCCC FAQ</a> for additional information on the IOCCC.</p> See also the <a href="faq.html">IOCCC FAQ</a> for additional information on the IOCCC.</p>
<!-- <!--
Copyright © 1984-2024 by Landon Curt Noll. All Rights Reserved. Copyright © 1984-2024 by Landon Curt Noll. All Rights Reserved.
README.md
+4 -4
View File
@@ -139,9 +139,9 @@ convince yourself of why the program does what it does.
## Regarding the source archive: ## Regarding the source archive:
Each sub-directory contains all the entries for a single year. Often the file Each subdirectory contains all the entries for a single year. Often the file
names match one of the last names of the author. Judges' hints are given in names match one of the last names of the author. Judges' hints and/or comments
files of the form `index.html`. are given in each entry's `index.html` file under the section `Judges' remarks`.
You may need to tweak the Makefile to get everything to compile correctly. Read You may need to tweak the Makefile to get everything to compile correctly. Read
the index.html files for suggestions. the index.html files for suggestions.
@@ -206,7 +206,7 @@ Internet's oldest ongoing contest.
**IMPORTANT NOTE**: See [contact.html](contact.html) for up to date contact details **IMPORTANT NOTE**: See [contact.html](contact.html) for up to date contact details
as well as details on how to provide fixes to any of the entries. as well as details on how to provide fixes to any of the entries.
See also [the IOCCC FAQ](faq.html) for additional information on the IOCCC. See also the [IOCCC FAQ](faq.html) for additional information on the IOCCC.
<!-- <!--