Merge branch 'master' into updates-post-birthday

This commit is contained in:
Landon Curt Noll authored and GitHub committed 2023-02-22 20:44:14 -08:00
commit 546498a516
475 files changed
+15940 -7790

No files matched your search

-105
View File
@@ -1,105 +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.2.0">
<meta http-equiv="Content-Type"
content="text/html; charset=utf-8"> <link rel="stylesheet"
type="text/css"
href="hint.css">
<title>README</title>
</head>
<body>
<h1>2016 marked the &ldquo;The Twenty Sixth International Obfuscated C Code Contest&rdquo;</h1>
<p>Copyright &copy; 2019, Landon Curt Noll, Simon Cooper, and Leonid A.
Broukhis. All Rights Reserved. Permission for personal, educational
or non-profit use is granted provided this copyright and notice are
included in its entirety and remains unaltered. All other uses
must receive prior permission from the contest judges.</p>
<h2>Standard IOCCC stuff</h2>
The primary site can be found at <b>www.ioccc.org</b>.
<p>Use make to compile entries. It is possible that on non-Un*x / non-Linux
systems the makefile needs to be changed. See the Makefile for details.</p>
<p>Look at the source and try to figure out what the programs do, and run
them with various inputs. If you want to, look at the hints files for
spoilers - this year we included most of the information included
by the submitter.</p>
<p>Read over the makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a #define).</p>
<p>Some C compilers are not quite as good as they should be. If yours is
lacking, you may need to compile using clang or gcc instead of your local
compiler.</p>
<h2>Remarks on some of the winners</h2>
<p>This year&rsquo;s winners are impressive!</p>
<p>The &ldquo;Most in need of debugging&rdquo; (endoh) is very inventive in a way it produces its own text!</p>
<p>The &ldquo;Most likely to be awarded&rdquo; (ciura) has an amazing vocabulary!</p>
<p>There are again nods to winners of the years:</p>
<pre><code>[1991/davidguy](http://ioccc.org/years.html#1991_davidguy)
[2011/blakely](http://ioccc.org/years.html#2011_blakely)
</code></pre>
<p>These nods to not run afoul of the guideline:</p>
<pre><code>We tend to dislike programs that:
...
are rather similar to previous winners
</code></pre>
<p>because the entry (dogon) appropriately pays homage to past winners
without blatantly reusing their code.</p>
<p>&hellip;We&rsquo;ll stop spouting spoilers now. Have fun exploring all the entries!</p>
<h2>Remarks on some of submissions that did not win</h2>
<p>Some entries tried to get around the size limit by submitting a data
file that was really C code and then blindly including code in prog.c.</p>
<p>Quite a few entries suffered from undefined behavior like accessing
uninitialized locals and/or reading-writing below the stack.
We advise running your entry through valgrind to make sure those mistakes
are avoided.</p>
<p>Using extra arguments to main, or arguments of wrong types as a quick and dirty
way of declaring variables is now passé. Clang, for example, rejects them outright.</p>
<p>We hope the authors of some of those entries will fix and re-submit
them for the next IOCCC.</p>
<p>Some entries seemed to have a good idea, but the implementation of
the idea was limited in scope.</p>
<h2>Final Comments</h2>
<p>Please feel free to send us comments and suggestions about the
competition, this README or anything else that you would like to see in
future contests.</p>
<p>If you use, distribute or publish these entries in some way, please drop
us a line. We enjoy seeing who, where and how the contest is used.</p>
<p>If you have problems with any of the entries, AND YOU HAVE A FIX, please
send us the fix (patch file or the entire changed file).</p>
<TABLE><TR>
<TD><a rel="license" href="https://creativecommons.org/licenses/by-sa/3.0/"><img alt="Creative Commons License" style="border-width:0" src="/png/by-sa-3.0-88x31.png" /></a></TD>
<TD><P>&copy; Copyright 1984-2019,
<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="https://creativecommons.org/licenses/by-sa/3.0/">Creative Commons Attribution-ShareAlike 3.0 Unported License</a>.</P></TD>
<TD>&nbsp;<!--<a href="https://validator.w3.org/check?uri=referer"><img src="https://www.w3.org/Icons/valid-html401" alt="Valid HTML 4.01 Transitional" height="31" width="88"></a>--></TD>
</TR></TABLE>
</body>
</html>
+12 -19
View File
@@ -1,16 +1,15 @@
2016 marked the "The Twenty Sixth International Obfuscated C Code Contest"
==========================================================================
Copyright (C) 2019, Landon Curt Noll, Simon Cooper, and Leonid A.
Broukhis. All Rights Reserved. Permission for personal, educational
or non-profit use is granted provided this copyright and notice are
included in its entirety and remains unaltered. All other uses
must receive prior permission from the contest judges.
Standard IOCCC stuff
--------------------
Look at the README.md file for the given winner for information
on how to compile the winner and how to run the winning program.
Look at the winning source and try to figure how it does what it does!
You may then wish to look at the Author's comments for even more details.
The primary IOCCC web site can be found at,
> <http://www.ioccc.org/>
@@ -18,11 +17,6 @@ The primary IOCCC web site can be found at,
Use make to compile entries. It is possible that on non-Un\*x / non-Linux
systems the makefile needs to be changed. See the Makefile for details.
Look at the source and try to figure out what the programs do, and run
them with various inputs. If you want to, look at the hints files for
spoilers - this year we included most of the information included
by the submitter.
Read over the makefile for compile/build issues. Your system may require
certain changes (add or remove a library, add or remove a #define).
@@ -64,7 +58,7 @@ Some entries tried to get around the size limit by submitting a data
file that was really C code and then blindly including code in prog.c.
Quite a few entries suffered from undefined behavior like accessing
uninitialized locals and/or reading-writing below the stack.
uninitialized locals and/or reading-writing below the stack.
We advise running your entry through valgrind to make sure those mistakes
are avoided.
@@ -99,11 +93,10 @@ For news of the next contest watch:
> <http://www.ioccc.org/>
--------------------------------------------------------------------------------
<!--
(c) Copyright 1984-2019, [Leo Broukhis, Simon Cooper, Landon Curt Noll][judges] - All rights reserved
This work is licensed under a [Creative Commons Attribution-ShareAlike 3.0 Unported License][cc].
=-=
[judges]: http://www.ioccc.org/judges.html
[cc]: http://creativecommons.org/licenses/by-sa/3.0/
-->
Copyright (C) 2019, Landon Curt Noll, Simon Cooper, and Leonid A.
Broukhis. All Rights Reserved. Permission for personal, educational
or non-profit use is granted provided this copyright and notice are
included in its entirety and remains unaltered. All other uses
must receive prior permission from the contest judges.
+4
View File
@@ -0,0 +1,4 @@
identify.unl
iocccsize_2018
prog
prog2
+2
View File
@@ -0,0 +1,2 @@
prog
prog.clean
+1
View File
@@ -0,0 +1 @@
prog
+1
View File
@@ -0,0 +1 @@
prog
+1
View File
@@ -0,0 +1 @@
prog
+1
View File
@@ -0,0 +1 @@
prog
+2
View File
@@ -0,0 +1,2 @@
Darwin
prog
+1
View File
@@ -0,0 +1 @@
prog
+1
View File
@@ -0,0 +1 @@
prog
+1
View File
@@ -0,0 +1 @@
prog
+1
View File
@@ -0,0 +1 @@
prog
+22
View File
@@ -0,0 +1,22 @@
Eugene_Onegin.txt
IOCCC-Rules-Guidelines.txt
IOCCC-hints.txt
Shakespeare.txt
gru1
gru2
gru3
lin1
lstm1
lstm2
lstm3
lstmp1
lstmp2
lstmp3
per1
prog
rlstm1
rlstm2
rlstm3
rnn1
rnn2
rnn3
+1
View File
@@ -0,0 +1 @@
prog
+1
View File
@@ -0,0 +1 @@
prog