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

Add preview of 1984-2019

Browse Source 
The 2020 winners are hinted it, but the source code is not there,
nor are the hints. Someone could look into the HTML and
see what was commented out, but that is not a problem because
WHO won is known and the name of their AWARD is known already.
Moreover a number of the winners have talked about what their
entirs do, so the commented out spoiler text is not a bit problem.

One will find HTML commented out with:

    <!-- XXX remove when 2020 is ready
    2020 links here
    XXX remove when 2020 is ready -->

The "XXX remove when 2020 is ready" string is found at the
start and end comment blocks.  Again, soneone could read
what was commented out, but that is OK since most of that
information is known or can be known.  The following files
have such HTML comment blocks in them.

    ./winners.html
    ./years-spoiler.html
    ./years.html

In addition, ./all/summary.txt was modified to not
include the 2020 entries for the momemt.

The 2020 winner code AND write-ups are NOT part of this set.

p.s. The all/all.tar.bz2 does not contain the 2020 source code (yet?).
This commit is contained in:
Landon Curt Noll committed 2020-12-30 16:57:03 -08:00
1 parent 28efc67f5d
commit c0663537cb
1683 files changed
+220064
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2013/robison/Makefile
+202
View File
@@ -0,0 +1,202 @@
#!/usr/bin/env make
#
# 2013 makefile
#
# This work by Landon Curt Noll, Simon Cooper, and Leonid A. Broukhis
# is licensed under:
#
# Creative Commons Attribution-ShareAlike 3.0 Unported License.
#
# See: http://creativecommons.org/licenses/by-sa/3.0/
################
# tool locations
################
#
SHELL= /bin/bash
CP= cp
CPP= cpp
GUNZIP= gunzip
LD= ld
MAKE= make
RM= rm
SED= sed
TAR= tar
TRUE= true
# Set X11_LIBDIR to the directory where the X11 library resides
#
X11_LIBDIR= /usr/X11R6/lib
# Set X11_INCLUDEDIR to the directory where the X11 include files reside
#
X11_INCDIR= /usr/X11R6/include
# Compiler warnings
#
#CWARN=
CWARN= -Wall -W -Wno-unused-variable -Wno-parentheses -Wno-unused-value -U_FORTIFY_SOURCE -D_FORTIFY_SOURCE=0
#CWARN= -Wall -W -pedantic
# compiler standard
#
#CSTD=
#CSTD= -ansi
CSTD= -std=c99
# compiler bit architecture
#
# Some entries require 32-bitness:
# ARCH= -m32
#
# Some entries require 64-bitess:
# ARCH= -m64
#
# By default we assume nothing:
#
ARCH=
# optimization
#
# Most compiles will safely use -O2. Some can use only -O1 or -O.
# A few compilers have broken optimizers or this entry make break
# under those buggy optimizers and thus you may not want anything.
#
#OPT=
#OPT= -O
#OPT= -O1
OPT= -O2
#OPT= -O3
# Libraries needed to build
#
LIBS=
# default flags for ANSI C compilation
#
CFLAGS= ${CWARN} ${CSTD} ${ARCH} ${OPT} ${LIBS}
# ANSI compiler
#
# Set CC to the name of your ANSI compiler.
#
# Some entries seem to need gcc. If you have gcc, set
# both CC and MAY_NEED_GCC to gcc.
#
# If you do not have gcc, set CC to the name of your ANSI compiler, and
# set MAY_NEED_GCC to either ${CC} (and hope for the best) or to just :
# to disable such programs.
#
CC= cc
#CC=clang
MAY_NEED_GCC= gcc
##############################
# Special flags for this entry
##############################
#
ENTRY= robison
DATA=
ALT_OBJ=
ALT_ENTRY=
#################
# build the entry
#################
#
all: ${ENTRY} ${DATA}
@${TRUE}
${ENTRY}: ${ENTRY}.c
${CC} ${CFLAGS} $< -o $@
# alternative executable
#
alt: ${ALT_ENTRY}
@${TRUE}
# data files
#
data: ${DATA}
@${TRUE}
###############
# utility rules
###############
#
everything: all alt
clean:
${RM} -f ${ENTRY}.o ${ALT_OBJ}
clobber: clean
${RM} -f ${ENTRY} ${ALT_ENTRY}
nuke: clobber
@${TRUE}
dist_clean: nuke
@${TRUE}
install:
@echo "Surely we are joking Dr. Lehmer!"
@${TRUE}
# backwards compatibility
#
build: all
@${TRUE}
##################
# 133t hacker rulz
##################
#
love:
@echo 'not war?'
@${TRUE}
haste:
$(MAKE) waste
@${TRUE}
waste:
@echo 'haste'
@${TRUE}
easter_egg:
@echo you expected to mis-understand this $${RANDOM} magic
@echo chongo '<was here>' "/\\oo/\\"
@echo Readers shall not be disallowed from being unable to not partly misunderstand this partocular final echo.
# Understand the history of the Homebrew Computer Club
# as well as the West Coast Computer Faire and
# you might be confused different. :-)
#
supernova: nuke
@-if [ -r .code_anal ]; then \
${RM} -f .code_anal_v4; \
else \
echo "We are not expected to understand that"; \
fi
@${TRUE}
deep_magic:
@-if [ -r .code_anal ]; then \
ccode_analysis --deep_magic 2ed3582ec5c094a093fea2a6bcb9f19439892873c9cc45ed1ceaafe08b7d52e1b2c7cd524be3b0b2 --FNV1a_hash 512-bit "${ENTRY}"; \
else \
echo "Park different"; \
fi
@${TRUE}
magic: deep_magic
@-if [ -r .code_anal ]; then \
ccode_analysis --mode 391581 --level 216193 --FNV1a_hash 512-bit "${ENTRY}"; \
else \
echo "These aren't the primes you're looking for Paul Erdos!"; \
fi
@${TRUE}
2013/robison/hint.html
+138
View File
@@ -0,0 +1,138 @@
<!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 poetic use of strings</title>
</head>
<body>
<h1>Most poetic use of strings</h1>
<p>Arch D. Robison<br>
<a href="&#x6d;&#97;&#105;&#x6c;&#116;&#x6f;&#x3a;&#97;&#114;&#99;&#x68;&#46;&#x64;&#x2e;&#114;&#111;&#98;&#x69;&#115;&#x6f;&#x6e;&#x40;&#x67;&#x6d;&#97;&#x69;&#108;&#46;&#x63;&#111;&#x6d;">&#97;&#114;&#x63;&#104;&#46;&#100;&#x2e;&#114;&#x6f;&#x62;&#x69;&#x73;&#111;&#110;&#x40;&#103;&#x6d;&#97;&#105;&#108;&#46;&#x63;&#111;&#x6d;</a></p>
<h2>Judges' comments:</h2>
<h3>To build:</h3>
<pre><code>make robison
</code></pre>
<h3>To run:</h3>
<pre><code>./robison
</code></pre>
<h3>Try:</h3>
<pre><code>echo '1*2*3*4*5*6*7*8*9%1000' | ./robison
echo '100000000000000000000*(20*(1+(99477941840441*50)))/31664812345028528' | ./robison
</code></pre>
<h3>Selected Judges Remarks:</h3>
<p>Of integers this prog does a lot,
plus minus, div times (and what not).</p>
<p>And modulus if remainders the needing,
on standard input percent be feeding.</p>
<p>More than one line can thru give input,
when interactive one values more than thruput.</p>
<p>With cut and paste and some time,
one can compute M(23209).</p>
<h2>Author&rsquo;s comments:</h2>
<h2>Oh, The Strings You Can C!</h2>
<p>I love the C language; its tersness is tops.<br>
But the thing I abhor is numerical ops!</p>
<p>No shifting, division, remainder, or times.<br>
No increment, decrement, or subscripting blech,<br>
No addition, subtraction, or bitwise bool glop.<br>
As for pointer arithmetic &ndash; totally yech!</p>
<p>But I do have a pref'rence, for pointer deref'rence.<br>
I find NOTS are a bang, and relations a ball.<br>
I like calling routines, and recursions in essence. <br>
But the thing I like MOST is a string dot h CALL!</p>
<p>With mem copy I copy, and mem set I clear. <br>
Take string len of this, and string copy that.<br>
From my keyboard I pause, to hear subroutines dear: <br>
The bark of string chrr, and the purr of string CAT!</p>
<p>One tiny detail that could lead to defeat.<br>
From where an arg points: string calls only go forth,<br>
So how to go back, to be Turing complete?<br>
From standard dot H, to the rescue, q SORT!</p>
<p>My fixation might hint at a textual bent. <br>
Does my program compose a tatoo for your shin? <br>
Play crosswords or translate from Urdu to Tzouby?<br>
To give it a whirl, just punch 2 + 2 in.</p>
<p>You can add, do division, and multiply too.<br>
Take unary minus and also subtract.<br>
Summing hairs of a walrus? No longer a fuss.<br>
Parenthetical grouping &ndash; no pushing a stack!</p>
<p>Try dividing a googol by one forty three, <br>
Subtract an octillion - it&rsquo;s simply divine.<br>
To compute a remainder, inscribe a percent.<br>
For the sign of the answer, see C ninety nine!</p>
<p>A hundred and twenty five digits or so,<br>
Are the lengthiest figures the program can gnash.<br>
Go over that limit, by even a digit: <br>
Risk incorrect answers, or witness a crash!</p>
<p>Say, say, does it have octal or binary zen?<br>
What about duodecimal, ternary, hex? <br>
Try the base as an option (of course in base ten)<br>
Any base two to twenty &ndash; for that is the specs.</p>
<p>Use lowercase in trans-decimal radix, <br>
Divide <em>babbage</em> (in base seventeen) by <em>cafe</em> &ndash; <br>
a nice <em>fad</em>, but avoid a division by nix: <br>
No errant result, but you could wait all day!</p>
<p>To grok the internals, ask Queen Cleopatra,<br>
or King Tutankhamun; for him it&rsquo;s a romp. <br>
Addition by cats, and if given two figures,<br>
to tell which is bigger, sort down and string CMP!</p>
<p>Unlawful subtraction, a grade school infraction, <br>
starts at the left and works to the right. <br>
Yet more innovation: like Henry Ford&rsquo;s cars,<br>
With a pound and define, mass production of vars!</p>
<p>The moral is clear, for programmers out there: <br>
With the C lib for strings, you can hack with a flair.</p>
<hr />
<!--
(c) Copyright 1984-2015, [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/
-->
<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-2015,
<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>
2013/robison/hint.text
+113
View File
@@ -0,0 +1,113 @@
# Most poetic use of strings
Arch D. Robison
<arch.d.robison@gmail.com>
## Judges' comments:
### To build:
make robison
### To run:
./robison
### Try:
echo '1*2*3*4*5*6*7*8*9%1000' | ./robison
echo '100000000000000000000*(20*(1+(99477941840441*50)))/31664812345028528' | ./robison
### Selected Judges Remarks:
Of integers this prog does a lot,
plus minus, div times (and what not).
And modulus if remainders the needing,
on standard input percent be feeding.
More than one line can thru give input,
when interactive one values more than thruput.
With cut and paste and some time,
one can compute M(23209).
## Author's comments:
Oh, The Strings You Can C!
--------------------------
I love the C language; its tersness is tops.
But the thing I abhor is numerical ops!
No shifting, division, remainder, or times.
No increment, decrement, or subscripting blech,
No addition, subtraction, or bitwise bool glop.
As for pointer arithmetic -- totally yech!
But I do have a pref'rence, for pointer deref'rence.
I find NOTS are a bang, and relations a ball.
I like calling routines, and recursions in essence.
But the thing I like MOST is a string dot h CALL!
With mem copy I copy, and mem set I clear.
Take string len of this, and string copy that.
From my keyboard I pause, to hear subroutines dear:
The bark of string chrr, and the purr of string CAT!
One tiny detail that could lead to defeat.
From where an arg points: string calls only go forth,
So how to go back, to be Turing complete?
From standard dot H, to the rescue, q SORT!
My fixation might hint at a textual bent.
Does my program compose a tatoo for your shin?
Play crosswords or translate from Urdu to Tzouby?
To give it a whirl, just punch 2 + 2 in.
You can add, do division, and multiply too.
Take unary minus and also subtract.
Summing hairs of a walrus? No longer a fuss.
Parenthetical grouping -- no pushing a stack!
Try dividing a googol by one forty three,
Subtract an octillion - it's simply divine.
To compute a remainder, inscribe a percent.
For the sign of the answer, see C ninety nine!
A hundred and twenty five digits or so,
Are the lengthiest figures the program can gnash.
Go over that limit, by even a digit:
Risk incorrect answers, or witness a crash!
Say, say, does it have octal or binary zen?
What about duodecimal, ternary, hex?
Try the base as an option (of course in base ten)
Any base two to twenty -- for that is the specs.
Use lowercase in trans-decimal radix,
Divide *babbage* (in base seventeen) by *cafe* --
a nice *fad*, but avoid a division by nix:
No errant result, but you could wait all day!
To grok the internals, ask Queen Cleopatra,
or King Tutankhamun; for him it's a romp.
Addition by cats, and if given two figures,
to tell which is bigger, sort down and string CMP!
Unlawful subtraction, a grade school infraction,
starts at the left and works to the right.
Yet more innovation: like Henry Ford's cars,
With a pound and define, mass production of vars!
The moral is clear, for programmers out there:
With the C lib for strings, you can hack with a flair.
--------------------------------------------------------------------------------
<!--
(c) Copyright 1984-2015, [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/
-->
2013/robison/robison.c
+100
View File
@@ -0,0 +1,100 @@
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define r char S; T R; I N, G, s
#define A(P,O) for(P=O; *P; P=U(P))
typedef char T[128],*I,p[2400];
#define memset (I)\
memset
void*P= strcpy ; I Q(); typedef const void*f; int u(f P,f O){
return strncmp ((I)P,(I)O,1); } T g,c={ 127} ; char l,F[6000000]; I U(I P){
r; strncpy (R,P,2);
s= strchr (
strcpy (P,c),0)
; strncpy (P,R,2); return s; } T q,B,E; I t(I P){
r; qsort (P,
strlen (P),1,u);
if(s= strstr (P,c))*s=0; return P; } T a={ 2} ; void D(){ r;
S=1; strcpy (R,c); t(F);
for(; memset (E,S,l),
(S= strlen (
strcat (R,c)))<*R; t(s))for(s=B;
N= strstr (F,E); s=F)
* memset (N,*c,l)=S; } p H="(*&,.",k; I j(I P){
r=(I) malloc (
strlen (
strcat (P,"\177 ")));
* strstr (P,c)=0;
return strcpy (s,P); } int K(f P,f O){ return u(O,P); } void
b(){ qsort (F,
strlen (F),1,K); } void n(I P){ r; A(P,P){
if(N= strchr (F,*P)); else{ t(F);
b(); memset (B,l,*F); N=F;
while(* strrchr (B,l)=0,
*P<=(S= strlen (B))){
* memset (E,S,l)
=*c; strcat (F,E);
} memset (B,0,S); } *N=*c; } D(); } void C(I P,I O){ r; A(P,P)A(s,O){
* strrchr (
memset (
strchr (
memset (
strncpy (k,B,254),l,*P),0),l,*s),l)=0;
*q= strlen (k)
; strcat (F,q); } D(); } T i="\13<\f="; void o(I P){ A(P,P){
* strrchr (
memset (B,*c,*P),*c)
=0; memset (B,0,
*P= strlen (B)); } } int V(f P,f O){ return u(*(I*)P,*(I*)O); } void e(I O){
r; strcpy (H,O)
; strcpy (R,c); for(;
0< strncmp (F,H,1)
; strcat (R,c))A(s,
H) memset (B,0,
*s= strlen (
strcat (
memset (B,*c,*s),c))); *k=0; do{ while
(0<= strcmp (F,H)){ n(H); b();
*q= strlen (R)
; strcat (k,q); }
* strrchr (R,*c)=*B; o(H); } while(*R); } char d(I P){
if(P= strstr (P,g)){
if((*g= getchar ())<*i)' '<*g?o(g):d(" "); } else P=B; return*P; } I m(I
P){ qsort (P,
strlen (P),1,K); return*P==*c?U(P):P; } void J(I P){ r=m(P);
if(P<s) putchar ('-')
; memset (B,l,*s); do{ *E=*i;
if(N= strchr (s,
*q= strlen (B)))
t( memset (
memcpy (E,i,l),*c,
strspn (N,q)))
; putchar (*E);
* strrchr (B,*B=l)=0; } while
(*B); puts (B)
; free (P); } I M(){ r=Q(),P,O; while(S=d(".)$")){ N=Q();
G= strcpy (F,B); P=m(s); O=m(N); if(S==')'){ C(P,O); }
else{ strcpy (F,P); e(O); if(S=='.')G=k; else O=N;
} free (s); G=j(G);
s= strcat (G,P==s==(O==N)?B:c)
; free (N); } return s; } I h(){ r,P,O; for(N=M(); S=d("*,");
N= strcat (s,S?c:B)){ G=M(); P=m(N); O=m(G); S=O==G==(S==','); if(P==N==S)
if( strcmp (P,O)<0)
{ strcpy (F,O); n(P); }
else{ strcpy (F,P); n(O); S=N<P; }
else{ strcat (
strcpy (F,P),O); D(); }
s=j(F); free (N)
; free (G); } return N; } I Q(){ r; if(S=d(","))
if(N= strstr (s=Q(),c))*N=*B;
else strcat (s,c); else if(d("'")){ s=h(); S=d("("); }
else{ strcpy (F,B); while(*q=d(i))
{ strcpy (H,F)
; memset (
strncpy (F,B,l),S=1,
strcspn (i,q)); C(H,a); } s=j(F); } if(!S){
o( strcpy (F,"tzouby!fssps"))
; puts (F); } return s; } int main(int P,I*O)
{ qsort (O,P,sizeof*O,V);
l=1<P? strtol (*O,0,l):10; C(H,
i); strcpy (i,F); d(g); while(!d("\377"))for(J(h()); !d("\377\n"); d(g)); return 0; }