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

Remove hint.html and index.html

Browse Source 
As per discussions on GitHub the index.html and hint.html files should
be deleted in favour of README.md files (from any
.text/.txt/.markdown/.md files which will be turned into README.md in an
upcoming commit).
This commit is contained in:
Cody Boone Ferguson committed 2023-02-08 05:07:05 -08:00
1 parent ee8a36310f
commit 77fb0f11a2
143 files changed
-28606
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2018/giles/hint.html
-80
View File
@@ -1,80 +0,0 @@
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd">
<html>
<head>
<meta name="GENERATOR" content="mkd2html 2.1.5a DL=DISCOUNT">
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=utf-8">
<link rel="stylesheet"
type="text/css"
href="../hint.css">
<title>Most unstable</title>
</head>
<body>
<h1>Most unstable</h1>
<p>Edward Giles</p>
<h2>Judges' comments:</h2>
<h3>To use:</h3>
<pre><code>sudo apt install libsdl2-dev # Linux
Something else # MacOS
make
./prog
</code></pre>
<h3>Try:</h3>
<pre><code>./prog ioccc.txt
./prog prog.c
</code></pre>
<h3>Selected Judges Remarks:</h3>
<p>Can you explain the behavior of the program when ioccc.txt is given to it as input?</p>
<p>How would the description of the state machine look like when translated from
Polynomish to English?</p>
<h2>Author&rsquo;s comments:</h2>
<h1>Remarks</h1>
<p>This entry graphically displays a simulation of sand falling.
It uses SDL to draw the interface.</p>
<p>The code makes the following assumptions about the underlying system:</p>
<ul>
<li>SDL 2 is installed from https://libsdl.org</li>
<li>&ldquo;double&rdquo; is an IEEE 754 floating-point type and sizeof(double)==8</li>
<li>The compiler supports the C99 standard</li>
</ul>
<p>In order to simulate the motion of the sand, a cellular automaton is used. The
state transition table is not stored directly. Instead, the program stores the
coefficients of a polynomial that map each state to the correct one. These
coefficients are stored as raw hexadecimal in the V[] array, and they are
reinterpreted as doubles when used. This allows more numeric precision in fewer
characters (base 16 > base 10), and makes the purpose of the array less clear.</p>
<p>The code is laid out graphically as a bucket pouring sand, and it is far easier
to observe this high-level layout than the code&rsquo;s actual function.</p>
<p>The preprocessor is used to both obfuscate the code as a whole and abbreviate
the calls to SDL. Additionally, throughout the code, the variables were named
so that they are short and easily confused with each other.</p>
<hr />
<TABLE><TR>
<TD><a rel="license" href="http://creativecommons.org/licenses/by-sa/3.0/"><img alt="Creative Commons License" style="border-width:0" src="http://i.creativecommons.org/l/by-sa/3.0/88x31.png" /></a></TD>
<TD><P>&copy; Copyright 1984-2018,
<A HREF="/judges.html">Leo Broukhis, Simon Cooper, Landon Curt Noll</A>
- All rights reserved<BR>
This work is licensed under a <a rel="license" href="http://creativecommons.org/licenses/by-sa/3.0/">Creative Commons Attribution-ShareAlike 3.0 Unported License</a>.</P></TD>
<TD>&nbsp;<!--<a href="http://validator.w3.org/check?uri=referer"><img src="http://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional" height="31" width="88"></a>--></TD>
</TR></TABLE>
</body>
</html>