Add preview of 1984-2019
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
1 parent
28efc67f5d
commit
c0663537cb
1683 files changed
+220064
No files matched your search
@@ -0,0 +1,117 @@
|
||||
#!/usr/bin/env make
|
||||
#
|
||||
# 2011 makefile
|
||||
#
|
||||
# Copyright (C) 2011, Landon Curt Noll, Simon Cooper, and Leonid A. Broukhis.
|
||||
#
|
||||
# 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
|
||||
|
||||
# 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= -O2
|
||||
|
||||
# bitness
|
||||
#
|
||||
# Some entries require 32-bitness,
|
||||
# other entries require 64-bitess.
|
||||
# By default we assume nothing.
|
||||
#
|
||||
ARCH=
|
||||
|
||||
# default flags for ANSI C compilation
|
||||
#
|
||||
CFLAGS= -Wall -W -ansi ${ARCH} ${OPT} -lm
|
||||
|
||||
# ANSI compiler
|
||||
#
|
||||
# Set CC to the name of your ANSI compiler.
|
||||
#
|
||||
CC= cc
|
||||
|
||||
|
||||
##############################
|
||||
# Special flags for this entry
|
||||
##############################
|
||||
#
|
||||
ENTRY= borsanyi
|
||||
DATA= data.1 data.2 data.3
|
||||
|
||||
|
||||
#################
|
||||
# build the entry
|
||||
#################
|
||||
#
|
||||
all: ${ENTRY} ${DATA}
|
||||
@${TRUE}
|
||||
|
||||
${ENTRY}: ${ENTRY}.c
|
||||
${CC} ${CFLAGS} ${ENTRY}.c -o ${ENTRY}
|
||||
|
||||
# alternative executable
|
||||
#
|
||||
alt:
|
||||
@${TRUE}
|
||||
|
||||
|
||||
###############
|
||||
# utility rules
|
||||
###############
|
||||
#
|
||||
everything: all alt
|
||||
|
||||
clean:
|
||||
${RM} -f ${ENTRY}.o
|
||||
|
||||
clobber: clean
|
||||
${RM} -f ${ENTRY}
|
||||
|
||||
nuke: clobber
|
||||
@echo gnab gib!
|
||||
|
||||
install:
|
||||
@echo "Surely you're joking Mr. Feynman!"
|
||||
|
||||
# backwards compatibility
|
||||
#
|
||||
build: all
|
||||
|
||||
|
||||
##################
|
||||
# 133t hacker rulz
|
||||
##################
|
||||
#
|
||||
love:
|
||||
@echo 'not war?'
|
||||
|
||||
haste:
|
||||
$(MAKE) waste
|
||||
|
||||
waste:
|
||||
@echo 'waste'
|
||||
|
||||
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 partly misunderstand this final echo.
|
||||
@${TRUE}
|
||||
@@ -0,0 +1,12 @@
|
||||
# include <math.h>
|
||||
# include <stdio.h>
|
||||
# define d double
|
||||
d a,s;int n;p(d t ,d M,d x)
|
||||
{ return x>0?x>1 &&!fork( )?p(t,s+=
|
||||
a ,x-1):0 :scanf( "%lf",&x )-1?a=(M-
|
||||
t )/22,s= pow(10, (int)( log10(a)) /*It is
|
||||
a simple tool to quickly analyze data. */
|
||||
- 2),s=t- (a =s*( int)(a/s ))/2,p(t, s,(int)(
|
||||
( a+M-t)/ a)):p(t >M|x<t?x :t,t>M|x >M?x:M ,--n)+(x
|
||||
> s&&x <= s+a); } main(j){ j==1?j=p (1,0,0) ,printf(
|
||||
"%+12g %4d",s+a/2,j,wait(NULL)),main(j*400/n):putchar(35-25*!j)&' '&&main(j+1);}
|
||||
File diff suppressed because it is too large.
Load diff
@@ -0,0 +1,100 @@
|
||||
-0.692307692307693
|
||||
-0.653846153846154
|
||||
-0.846153846153846
|
||||
-1.07692307692308
|
||||
-0.269230769230769
|
||||
-0.461538461538462
|
||||
-0.923076923076923
|
||||
-0.692307692307691
|
||||
-0.0769230769230778
|
||||
-1.23076923076923
|
||||
-1.23076923076923
|
||||
-0.23076923076923
|
||||
0.923076923076923
|
||||
0.653846153846153
|
||||
0.384615384615385
|
||||
-0.576923076923077
|
||||
-0.5
|
||||
0.153846153846154
|
||||
-2.23076923076923
|
||||
-0.846153846153846
|
||||
0.846153846153846
|
||||
-0.576923076923077
|
||||
0.423076923076922
|
||||
-0.346153846153847
|
||||
-1.42307692307692
|
||||
0.807692307692307
|
||||
-0.0384615384615377
|
||||
0.346153846153847
|
||||
-1.15384615384615
|
||||
-1.57692307692308
|
||||
-0.0384615384615383
|
||||
-0.576923076923078
|
||||
-0.384615384615385
|
||||
-0.76923076923077
|
||||
-0.538461538461539
|
||||
-0.269230769230769
|
||||
8.32667268468867e-16
|
||||
-0.692307692307693
|
||||
-1.69230769230769
|
||||
0.615384615384616
|
||||
-3.33066907387547e-16
|
||||
-1.61538461538462
|
||||
-0.269230769230769
|
||||
-1.03846153846154
|
||||
-0.884615384615383
|
||||
-1.38461538461538
|
||||
0.26923076923077
|
||||
-8.88178419700125e-16
|
||||
-0.0769230769230773
|
||||
-0.769230769230769
|
||||
0.769230769230768
|
||||
-1.23076923076923
|
||||
-0.0384615384615387
|
||||
-0.153846153846155
|
||||
0.115384615384616
|
||||
0.73076923076923
|
||||
-0.923076923076923
|
||||
-0.384615384615384
|
||||
-0.461538461538461
|
||||
-0.807692307692307
|
||||
-0.653846153846154
|
||||
0.384615384615385
|
||||
-0.692307692307691
|
||||
-1.80769230769231
|
||||
-0.653846153846154
|
||||
-0.384615384615386
|
||||
-1.46153846153846
|
||||
-0.846153846153845
|
||||
-0.653846153846154
|
||||
0.0384615384615383
|
||||
-1.46153846153846
|
||||
-0.846153846153845
|
||||
-2.23076923076923
|
||||
-1.50573997714787e-15
|
||||
0.500000000000001
|
||||
-1.11538461538462
|
||||
0.153846153846154
|
||||
-0.615384615384615
|
||||
1.38461538461538
|
||||
-0.307692307692308
|
||||
-0.461538461538462
|
||||
0.230769230769231
|
||||
-0.423076923076923
|
||||
-1.84615384615385
|
||||
0.576923076923077
|
||||
-1.34615384615385
|
||||
-0.730769230769229
|
||||
-1.19230769230769
|
||||
0.615384615384616
|
||||
-0.730769230769231
|
||||
-0.961538461538462
|
||||
-0.961538461538461
|
||||
0.307692307692308
|
||||
0.0769230769230764
|
||||
-0.192307692307693
|
||||
-0.384615384615386
|
||||
-1.61538461538462
|
||||
0.153846153846154
|
||||
-1.23076923076923
|
||||
-0.538461538461537
|
||||
@@ -0,0 +1,100 @@
|
||||
120
|
||||
109
|
||||
115
|
||||
122
|
||||
97
|
||||
118
|
||||
98
|
||||
103
|
||||
116
|
||||
100
|
||||
117
|
||||
116
|
||||
110
|
||||
114
|
||||
103
|
||||
114
|
||||
105
|
||||
112
|
||||
97
|
||||
101
|
||||
101
|
||||
100
|
||||
121
|
||||
108
|
||||
121
|
||||
112
|
||||
113
|
||||
97
|
||||
99
|
||||
121
|
||||
116
|
||||
115
|
||||
110
|
||||
116
|
||||
110
|
||||
104
|
||||
113
|
||||
106
|
||||
101
|
||||
104
|
||||
106
|
||||
98
|
||||
111
|
||||
105
|
||||
120
|
||||
121
|
||||
106
|
||||
119
|
||||
116
|
||||
106
|
||||
113
|
||||
108
|
||||
121
|
||||
118
|
||||
108
|
||||
101
|
||||
98
|
||||
101
|
||||
121
|
||||
97
|
||||
105
|
||||
121
|
||||
120
|
||||
108
|
||||
118
|
||||
116
|
||||
111
|
||||
112
|
||||
105
|
||||
109
|
||||
112
|
||||
107
|
||||
113
|
||||
110
|
||||
122
|
||||
122
|
||||
105
|
||||
97
|
||||
117
|
||||
101
|
||||
120
|
||||
103
|
||||
99
|
||||
105
|
||||
112
|
||||
105
|
||||
118
|
||||
99
|
||||
120
|
||||
108
|
||||
115
|
||||
121
|
||||
122
|
||||
109
|
||||
98
|
||||
103
|
||||
106
|
||||
114
|
||||
121
|
||||
117
|
||||
@@ -0,0 +1,114 @@
|
||||
<!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.3 DL=DISCOUNT">
|
||||
<META HTTP-EQUIV="Content-Type" CONTENT="text/html; charset=utf-8">
|
||||
<link rel="stylesheet"
|
||||
type="text/css"
|
||||
href="../hint.css">
|
||||
<title>Best data utility</title>
|
||||
</head>
|
||||
<body>
|
||||
<h1>Best data utility</h1>
|
||||
|
||||
<p>Szabolcs Borsanyi<br>
|
||||
Theoretische Physik<br>
|
||||
Gaussstraße 20<br>
|
||||
42097 Wuppertal<br>
|
||||
Germany<br>
|
||||
<a href="mailto:borsanyi@uni-wuppertal.de">borsanyi@uni-wuppertal.de</a></p>
|
||||
|
||||
<h2>Judges' comments:</h2>
|
||||
|
||||
<h3>To build:</h3>
|
||||
|
||||
<pre><code>make borsanyi
|
||||
</code></pre>
|
||||
|
||||
<h3>To run:</h3>
|
||||
|
||||
<pre><code>./borsanyi < some_data_file
|
||||
</code></pre>
|
||||
|
||||
<h3>Try:</h3>
|
||||
|
||||
<pre><code>./borsanyi < data.1
|
||||
./borsanyi < data.2
|
||||
./borsanyi < data.3
|
||||
</code></pre>
|
||||
|
||||
<h3>Selected Judges Remarks:</h3>
|
||||
|
||||
<p>This is a nice quick histogram plotter. A useful utility when you need to
|
||||
look at the distribution of some data.</p>
|
||||
|
||||
<p>Here are some challenges:</p>
|
||||
|
||||
<p>You can modify the number of histogram bins and the scaling of the histogram
|
||||
by editing the source. Try to find them!</p>
|
||||
|
||||
<p>If you look at the source you will notice that the usual array of
|
||||
histogram bins is missing. The source contains no arrays and it does not
|
||||
use malloc or alloca. How does it build the histogram?</p>
|
||||
|
||||
<p>While the input does not need to be sorted, the histogram output is sorted.
|
||||
How does it put the data into buckets? Why does it fork 22 times?</p>
|
||||
|
||||
<h2>Author’s comments:</h2>
|
||||
|
||||
<p>This small piece of program is meant to be a useful tool, when
|
||||
there are some data around and you need a quick glance at the
|
||||
histogram. I am all too often logged in to a remote machine with
|
||||
slow X connection, and a terminal-based program would be of
|
||||
great help.</p>
|
||||
|
||||
<h1>Limitations:</h1>
|
||||
|
||||
<ul>
|
||||
<li>I optimized the output for the data I had around, you might want to adjust
|
||||
for your needs. For a great excess of data points the program will crash
|
||||
(depending on the available stack).</li>
|
||||
<li>Giving too few (distinct) points can also cause crash (or division by zero).</li>
|
||||
<li>The program expects plain numbers separated by white spaces.</li>
|
||||
<li>ASCII is assumed.</li>
|
||||
<li>Some POSIX-like system is assumed (fork and wait(NULL) are used)</li>
|
||||
<li>Do not give any arguments to the program.</li>
|
||||
<li>Could rounding errors cause the omission of the highest bin? There might be
|
||||
empty bins at the edges.</li>
|
||||
</ul>
|
||||
|
||||
|
||||
<h1>Obfuscation:</h1>
|
||||
|
||||
<ul>
|
||||
<li>The program follows a rather unconventional approach to the task
|
||||
of histogram building. The usual array of integers (for the histogram
|
||||
bins) is missing entirely. The data are read once, the range is determined,
|
||||
but the data points are not put in any array. Yet they are remembered,
|
||||
and each of them is put into its own bin afterwards. But where are the bins?</li>
|
||||
<li>I tried to use as few keywords as possible, hence there are no loops.</li>
|
||||
<li>Multi-process approach for optimal use of resources.</li>
|
||||
<li>Some bin size obfuscation.</li>
|
||||
</ul>
|
||||
|
||||
|
||||
<hr />
|
||||
|
||||
<!--
|
||||
(c) Copyright 1984-2012, [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>© Copyright 1984-2012,
|
||||
<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> <!--<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>
|
||||
@@ -0,0 +1,81 @@
|
||||
# Best data utility
|
||||
|
||||
Szabolcs Borsanyi
|
||||
Theoretische Physik
|
||||
Gaussstraße 20
|
||||
42097 Wuppertal
|
||||
Germany
|
||||
<borsanyi@uni-wuppertal.de>
|
||||
|
||||
|
||||
## Judges' comments:
|
||||
### To build:
|
||||
|
||||
make borsanyi
|
||||
|
||||
### To run:
|
||||
|
||||
./borsanyi < some_data_file
|
||||
|
||||
### Try:
|
||||
|
||||
./borsanyi < data.1
|
||||
./borsanyi < data.2
|
||||
./borsanyi < data.3
|
||||
|
||||
### Selected Judges Remarks:
|
||||
|
||||
This is a nice quick histogram plotter. A useful utility when you need to
|
||||
look at the distribution of some data.
|
||||
|
||||
Here are some challenges:
|
||||
|
||||
You can modify the number of histogram bins and the scaling of the histogram
|
||||
by editing the source. Try to find them!
|
||||
|
||||
If you look at the source you will notice that the usual array of
|
||||
histogram bins is missing. The source contains no arrays and it does not
|
||||
use malloc or alloca. How does it build the histogram?
|
||||
|
||||
While the input does not need to be sorted, the histogram output is sorted.
|
||||
How does it put the data into buckets? Why does it fork 22 times?
|
||||
|
||||
## Author's comments:
|
||||
This small piece of program is meant to be a useful tool, when
|
||||
there are some data around and you need a quick glance at the
|
||||
histogram. I am all too often logged in to a remote machine with
|
||||
slow X connection, and a terminal-based program would be of
|
||||
great help.
|
||||
|
||||
# Limitations:
|
||||
|
||||
* I optimized the output for the data I had around, you might want to adjust
|
||||
for your needs. For a great excess of data points the program will crash
|
||||
(depending on the available stack).
|
||||
* Giving too few (distinct) points can also cause crash (or division by zero).
|
||||
* The program expects plain numbers separated by white spaces.
|
||||
* ASCII is assumed.
|
||||
* Some POSIX-like system is assumed (fork and wait(NULL) are used)
|
||||
* Do not give any arguments to the program.
|
||||
* Could rounding errors cause the omission of the highest bin? There might be
|
||||
empty bins at the edges.
|
||||
|
||||
# Obfuscation:
|
||||
|
||||
* The program follows a rather unconventional approach to the task
|
||||
of histogram building. The usual array of integers (for the histogram
|
||||
bins) is missing entirely. The data are read once, the range is determined,
|
||||
but the data points are not put in any array. Yet they are remembered,
|
||||
and each of them is put into its own bin afterwards. But where are the bins?
|
||||
* I tried to use as few keywords as possible, hence there are no loops.
|
||||
* Multi-process approach for optimal use of resources.
|
||||
* Some bin size obfuscation.
|
||||
|
||||
--------------------------------------------------------------------------------
|
||||
<!--
|
||||
(c) Copyright 1984-2012, [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/
|
||||
-->
|
||||
Reference in new issue
Block a user