Fixes in 2006 html files and some of 2011
This commit is contained in:
1 parent
35038a63bd
commit
75829b4561
18 files changed
+349
-182
No files matched your search
@@ -2418,16 +2418,16 @@ opened. The number of args is however checked.</p>
|
||||
<h3 id="source-code-2006sykes1sykes1.c">Source code: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2006/sykes1/sykes1.c">2006/sykes1/sykes1.c</a></h3>
|
||||
<h3 id="information-2006sykes1index.html">Information: <a href="2006/sykes1/index.html">2006/sykes1/index.html</a></h3>
|
||||
<p>The author stated:</p>
|
||||
<pre><code> If you pick a number higher than 19186, the program will return a
|
||||
solution but it will be a rotation of one of the first 19186. This is
|
||||
because the cross shaped piece fits 48 ways in the 4x4 cube, but only
|
||||
2 of those ways are unique - you can rotate one of those to make any
|
||||
of the other 46. The algorithm used always places the cross piece
|
||||
first, so the first two placings of that piece result in the 19186
|
||||
unique solutions.
|
||||
|
||||
If you pick a number higher than 460464 (24x19186) the program will
|
||||
return without outputting a solution. If you can wait that long.</code></pre>
|
||||
<blockquote>
|
||||
<p>If you pick a number higher than 19186, the program will return a solution but
|
||||
it will be a rotation of one of the first 19186. This is because the cross
|
||||
shaped piece fits 48 ways in the 4x4 cube, but only 2 of those ways are unique -
|
||||
you can rotate one of those to make any of the other 46. The algorithm used
|
||||
always places the cross piece first, so the first two placings of that piece
|
||||
result in the 19186 unique solutions.</p>
|
||||
<p>If you pick a number higher than 460464 (24x19186) the program will return
|
||||
without outputting a solution. If you can wait that long.</p>
|
||||
</blockquote>
|
||||
<div id="2006_toledo2">
|
||||
<h2 id="toledo2">2006/toledo2</h2>
|
||||
</div>
|
||||
@@ -2437,10 +2437,11 @@ opened. The number of args is however checked.</p>
|
||||
<p><a href="authors.html#Cody_Boone_Ferguson">Cody Boone Ferguson</a> fixed this program to
|
||||
not crash in macOS (it appeared to work fine in fedora linux on an <code>x86_64</code>
|
||||
architecture but he does not know if it crashed in macOS Ventura due to the fact
|
||||
it is an <code>arm64</code> CPU - the Apple silicon chip). This fix, BTW, is a mix of a fix
|
||||
by <a href="authors.html#Yusuke_Endoh">Yusuke Endoh</a> and Cody’s. Nevertheless there are
|
||||
two features that are not bugs. Later the author made some slight changes to
|
||||
make it not crash in x86_64 macOS.</p>
|
||||
it is an <code>arm64</code> CPU - the Apple silicon chip, but given that the author later
|
||||
made some slight changes to make it not crash in <code>x86_64</code> macOS that might be
|
||||
the case). This fix, BTW, is a mix of a fix by <a href="authors.html#Yusuke_Endoh">Yusuke
|
||||
Endoh</a> and Cody’s.</p>
|
||||
<p>Nevertheless there are two features that are not bugs.</p>
|
||||
<p>By design this program is supposed to crash on termination. This actually no
|
||||
longer seems to happen but we don’t need this to be added even if it might
|
||||
be called a bug :-)</p>
|
||||
@@ -2481,16 +2482,18 @@ case-sensitive.</p>
|
||||
<h3 id="status-inabiaf---please-do-not-fix-58">STATUS: INABIAF - please <strong>DO NOT</strong> fix</h3>
|
||||
<h3 id="source-code-2011borsanyiborsanyi.c">Source code: <a href="https://github.com/ioccc-src/temp-test-ioccc/blob/master/2011/borsanyi/borsanyi.c">2011/borsanyi/borsanyi.c</a></h3>
|
||||
<h3 id="information-2011borsanyiindex.html">Information: <a href="2011/borsanyi/index.html">2011/borsanyi/index.html</a></h3>
|
||||
<p>For a great amount of data points the program will crash, depending on your
|
||||
available stack space.</p>
|
||||
<p>Giving too few (distinct) points can also cause a crash or division by zero.</p>
|
||||
<p>The program expects plain numbers separated by whitespace.</p>
|
||||
<p>This program assumes ASCII.</p>
|
||||
<p>If you give the program any arg it might flood the screen.</p>
|
||||
<p>It requires both syscalls <code>fork(2)</code> and <code>wait(2)</code>.</p>
|
||||
<p>Giving any arg to the program is likely to flood your screen.</p>
|
||||
<p>Rounding errors might cause an omission in the highest bin. There might be empty
|
||||
bins at the edges.</p>
|
||||
<ul>
|
||||
<li><p>For a great amount of data points the program will crash, depending on your
|
||||
available stack space.</p></li>
|
||||
<li><p>Giving too few (distinct) points can also cause a crash or division by zero.</p></li>
|
||||
<li><p>The program expects plain numbers separated by whitespace.</p></li>
|
||||
<li><p>This program assumes ASCII.</p></li>
|
||||
<li><p>If you give the program any arg it might flood the screen.</p></li>
|
||||
<li><p>It requires both syscalls <code>fork(2)</code> and <code>wait(2)</code>.</p></li>
|
||||
<li><p>Giving any arg to the program is likely to flood your screen.</p></li>
|
||||
<li><p>Rounding errors might cause an omission in the highest bin. There might be
|
||||
empty bins at the edges.</p></li>
|
||||
</ul>
|
||||
<div id="2011_dlowe">
|
||||
<h2 id="dlowe-2">2011/dlowe</h2>
|
||||
</div>
|
||||
|
||||
Reference in new issue
Block a user