replace trailing whitespace with blackslash in README.md
As an alternative to the markdown trailing whitespace as a line break, we use a trailing blackslash as a markdown line break.
This commit is contained in:
Landon Curt Noll committed
1 parent
ddb78f6f33
commit
6625034139
263 files changed
+1181
-1181
No files matched your search
@@ -1,6 +1,6 @@
|
||||
# Most Educational
|
||||
|
||||
Adrian Mariano
|
||||
Adrian Mariano\
|
||||
US
|
||||
|
||||
|
||||
@@ -27,7 +27,7 @@ NOTE: if you do not specify an arg to the program it will segfault.
|
||||
|
||||
|
||||
## Judges' remarks:
|
||||
|
||||
\
|
||||
Once you get past the obfuscation, you have an opportunity to learn
|
||||
about regular expressions and state machines.
|
||||
|
||||
@@ -128,10 +128,10 @@ typing
|
||||
It will read stdin and print out all the lines which the automaton
|
||||
accepts. If the file cannot be opened, a system error message will
|
||||
be printed. If the input contains errors, then an error message along
|
||||
with the number of the offending line will be printed to stderr. The
|
||||
number of rules for each state is limited to 17. If more than 17 rules
|
||||
are present, you get the error `too_many_rules`, and the state that was
|
||||
being processed is printed. Error `no_destination` occurs if you specify a
|
||||
with the number of the offending line will be printed to stderr. The\
|
||||
number of rules for each state is limited to 17. If more than 17 rules\
|
||||
are present, you get the error `too_many_rules`, and the state that was\
|
||||
being processed is printed. Error `no_destination` occurs if you specify a\
|
||||
set of characters, but no destination state, and error `too_many_states`
|
||||
occurs if your automaton has more than 257 states.
|
||||
|
||||
@@ -144,8 +144,8 @@ Running:
|
||||
will perform a function similar to that of the unix from command.
|
||||
|
||||
If no filename is specified on the command line, then `"adgrep.c"` is used
|
||||
as the specification for the automaton. (This file has been renamed
|
||||
to `adrian.c` by the judges.) In this case, the program will search for
|
||||
as the specification for the automaton. (This file has been renamed\
|
||||
to `adrian.c` by the judges.) In this case, the program will search for\
|
||||
matches to the regular expression:
|
||||
|
||||
|
||||
@@ -234,7 +234,7 @@ shorter than 999 characters.
|
||||
The other info files are adrian.grep.[1-6] which contain the six
|
||||
examples that appear above, and from, which is used to emulate the
|
||||
unix from command. For reasons of clarity, the name "from" should
|
||||
probably not be changed if possible. I wouldn't want to be accused of
|
||||
probably not be changed if possible. I wouldn't want to be accused of\
|
||||
confusing people by giving the input files weird names.
|
||||
|
||||
If you want to change the default input filename (line 80) you must be
|
||||
|
||||
@@ -1,9 +1,9 @@
|
||||
# Most Useful Program
|
||||
|
||||
Albert van der Horst
|
||||
S P&A R&C
|
||||
Oranjestraat 8
|
||||
3511 RA UTRECHT
|
||||
Albert van der Horst\
|
||||
S P&A R&C\
|
||||
Oranjestraat 8\
|
||||
3511 RA UTRECHT\
|
||||
The Netherlands
|
||||
|
||||
## To build:
|
||||
@@ -59,7 +59,7 @@ make alt
|
||||
Use `albert.alt` as you would `albert` above.
|
||||
|
||||
## Judges' remarks:
|
||||
|
||||
\
|
||||
We were impressed with the speed at which it was able to factor
|
||||
arbitrarily large numbers consisting of factors that fit into
|
||||
a long.
|
||||
@@ -68,8 +68,8 @@ a long.
|
||||
|
||||
The Obfuscated version of the Horst algorithm.
|
||||
|
||||
This program will factor unlimited length numbers and print the
|
||||
factors in ascending order. Numbers of one digit (e.g. 8)
|
||||
This program will factor unlimited length numbers and print the\
|
||||
factors in ascending order. Numbers of one digit (e.g. 8)\
|
||||
are rejected without notice.
|
||||
|
||||
It quits as soon as there is at most one factor left, but that factor will not
|
||||
|
||||
+6
-6
@@ -1,10 +1,10 @@
|
||||
# Best Utility
|
||||
|
||||
Anthony C Howe
|
||||
Mortice Kern Systems Inc.
|
||||
Unit 1, 14 Weber Street North
|
||||
Waterloo, Ontario
|
||||
N2J 3G4
|
||||
Anthony C Howe\
|
||||
Mortice Kern Systems Inc.\
|
||||
Unit 1, 14 Weber Street North\
|
||||
Waterloo, Ontario\
|
||||
N2J 3G4\
|
||||
Canada
|
||||
|
||||
## To build:
|
||||
@@ -44,7 +44,7 @@ Like much of POSIX, obfuscation has its place. Your task is to
|
||||
figure out where.
|
||||
|
||||
This entry comes complete with a Posix-like command description.
|
||||
Interested POSIX balloters should lobby the IEEE for an obfuscated
|
||||
Interested POSIX balloters should lobby the IEEE for an obfuscated\
|
||||
P1003 subcommittee.
|
||||
|
||||
|
||||
|
||||
@@ -1,9 +1,9 @@
|
||||
# Most Obfuscated Algorithm
|
||||
|
||||
Sean Barrett
|
||||
Software Construction Company
|
||||
430 Southwest Parkway, #1906
|
||||
College Station, TX 77840
|
||||
Sean Barrett\
|
||||
Software Construction Company\
|
||||
430 Southwest Parkway, #1906\
|
||||
College Station, TX 77840\
|
||||
US
|
||||
|
||||
|
||||
|
||||
@@ -1,9 +1,9 @@
|
||||
# Best Language Tool
|
||||
|
||||
Sean Barrett
|
||||
Software Construction Company
|
||||
430 Southwest Parkway, #1906
|
||||
College Station, TX 77840
|
||||
Sean Barrett\
|
||||
Software Construction Company\
|
||||
430 Southwest Parkway, #1906\
|
||||
College Station, TX 77840\
|
||||
US
|
||||
|
||||
## To build:
|
||||
|
||||
+31
-31
@@ -1,9 +1,9 @@
|
||||
# Most Humorous Output
|
||||
|
||||
Andreas Gustafsson
|
||||
Helsinki University of Technology
|
||||
Arentikuja 1 D 305
|
||||
00410 Helsinki
|
||||
Andreas Gustafsson\
|
||||
Helsinki University of Technology\
|
||||
Arentikuja 1 D 305\
|
||||
00410 Helsinki\
|
||||
Finland
|
||||
|
||||
|
||||
@@ -69,16 +69,16 @@ The name of the game:
|
||||
AG is short for either Anagram Generator or simply AnaGram. It might also be
|
||||
construed to mean Alphabet Game, and by pure coincidence it happens to be the
|
||||
author's initials.
|
||||
|
||||
|
||||
\
|
||||
\
|
||||
### What it does
|
||||
|
||||
\
|
||||
AG takes one or more words as arguments, and tries to find anagrams of those
|
||||
words, i.e. words or sentences containing exactly the same letters.
|
||||
|
||||
|
||||
### How to use it
|
||||
|
||||
\
|
||||
To run AG, you need a dictionary file consisting of distinct words in the
|
||||
natural language of your choice, one word on each line. If your machine doesn't
|
||||
have one already, you can make your own dictionary by concatenating a few
|
||||
@@ -102,7 +102,7 @@ limit can be changed using a numeric command line option, as in
|
||||
`./ag -4 international obfuscated c code contest </usr/dict/words`.
|
||||
|
||||
### Bugs
|
||||
|
||||
\
|
||||
- There is no error checking.
|
||||
- Standard input must be seekable, so you can't pipe the dictionary into AG.
|
||||
- The input sentence and each line in the dictionary may contain at most 32
|
||||
@@ -115,7 +115,7 @@ less.
|
||||
|
||||
|
||||
### Obfuscatory notes
|
||||
|
||||
\
|
||||
As you can see, AG takes advantage of the new '92 whitespace rules to
|
||||
achieve a clear, readable, self-documenting layout. The identifiers
|
||||
have been chosen in a way appropriate for an alphabet game, and common
|
||||
@@ -132,9 +132,9 @@ algorithms are outlined in the rot-13 encoded spoiler below.
|
||||
Urer sbyybjf n qrfpevcgvba bs fbzr bs gur qngn fgehpgherf naq
|
||||
nytbevguzf hfrq ol NT. Vg vf ol ab zrnaf pbzcyrgr, ohg vg znl uryc
|
||||
lbh trg na vqrn nobhg gur trareny cevapvcyrf.
|
||||
|
||||
\
|
||||
--
|
||||
|
||||
\
|
||||
Vagreanyyl, NT ercerfragf jbeqf naq fragraprf nf neenlf bs 32
|
||||
4-ovg vagrtre ryrzragf. Rnpu ryrzrag ercerfragf gur ahzore bs
|
||||
gvzrf n yrggre bpphef va gur jbeq/fragrapr. Gurer ner 32 ryrzragf
|
||||
@@ -142,13 +142,13 @@ algorithms are outlined in the rot-13 encoded spoiler below.
|
||||
yrggref va zbfg jrfgrea nycunorgf, naq gur ryrzragf ner 4 ovgf
|
||||
rnpu orpnhfr gur fnzr yrggre vf hayvxryl gb bpphe zber guna 15
|
||||
gvzrf va n cenpgvpny nantenz trarengvba ceboyrz.
|
||||
|
||||
\
|
||||
Gurfr 32*4-ovg neenlf ner npghnyyl fgberq va zrzbel va n
|
||||
"ovg-genafcbfrq" sbezng, nf neenlf bs sbhe "ybat" inyhrf. Vg vf
|
||||
nffhzrq gung n "ybat" vf ng yrnfg 32 ovgf. Gur svefg 4-ovg yrggre
|
||||
pbhag vf sbezrq ol gur yrnfg fvtavsvpnag (2^0) ovg va rnpu bs gur
|
||||
sbhe ybatf, gur arkg bar vf sbezrq ol gur 2^1 ovgf, rgp.
|
||||
|
||||
\
|
||||
Guvf fgbentr sbezng znxrf vg cbffvoyr gb nqq be fhogenpg gjb fhpu
|
||||
irpgbef bs 32 4-ovg inyhrf va cnenyyry ol fvzhyngvat n frg bs 32
|
||||
ovanel shyy nqqref va fbsgjner hfvat ovgjvfr ybtvpny bcrengvbaf.
|
||||
@@ -159,17 +159,17 @@ algorithms are outlined in the rot-13 encoded spoiler below.
|
||||
vgrengvbaf bs n ybbc pbagnvavat fbzr 32-ovg ovgjvfr ybtvpny
|
||||
bcrengvbaf, ohg ab nevguzrgvp bcrengvbaf bgure guna gubfr vzcyvrq
|
||||
ol neenl vaqrkvat.
|
||||
|
||||
\
|
||||
Fhogenpgvba jbexf fvzvyneyl, naq va snpg NT bayl vzcyrzragf
|
||||
fhogenpgvba qverpgyl, unaqyvat nqqvgvba ol zrnaf bs gur vqragvgl
|
||||
n+o = n-(0-o).
|
||||
|
||||
\
|
||||
Va nqqvgvba gb guvf 32*4-ovg ercerfragngvba, NT nyfb sbezf n fb-pnyyrq
|
||||
"fvtangher" gung vf gur ovgjvfr BE bs gur sbhe ybatf, juvpu vf
|
||||
rdhvinyrag gb fnlvat gung gur fvtangher bs n jbeq pbagnvaf n ybtvpny 1
|
||||
va gur ovg cbfvgvbaf pbeerfcbaqvat gb yrggref bppheevat ng yrnfg bapr
|
||||
va gung jbeq.
|
||||
|
||||
\
|
||||
Gur svefg guvat NT qbrf vf gb pbafgehpg n ybbxhc gnoyr bs 256
|
||||
ybatf, bar sbe rnpu 8-ovg punenpgre inyhr. Gur ragel sbe n
|
||||
punenpgre jvyy or mreb vs gung punenpgre qbrfa'g nccrne va gur
|
||||
@@ -178,50 +178,50 @@ algorithms are outlined in the rot-13 encoded spoiler below.
|
||||
gbtrgure gur ovg znfxf sbe nyy gur yrggref va gur vachg fragrapr
|
||||
hfvat gur genafcbfr nqqvgvba zrgubq qrfpevorq nobir, NT sbezf gur
|
||||
32*4 ovg neenl ercerfragngvba bs gur vachg fragrapr.
|
||||
|
||||
\
|
||||
Gur arkg npgvba cresbezrq vf ernqvat gur qvpgvbanel. Gubfr jbeqf gung
|
||||
pbagnva yrggref abg va gur vachg fragrapr ner vzzrqvngryl qvfpneqrq.
|
||||
Jbeqf pbagnvavat gur evtug yrggref ohg va rkprffvir ahzoref ner
|
||||
ryvzvangrq va n frcnengr purpx vaibyivat gur 32*4 ovg neenl.
|
||||
|
||||
\
|
||||
Gur erznvavat jbeqf, juvpu jvyy or ersreerq gb nf "pnaqvqngr jbeqf",
|
||||
ner fgberq va 32*4-ovg ercerfragngvba, gbtrgure jvgu gurve fvtangherf
|
||||
ner fgberq va 32*4-ovg ercerfragngvba, gbtrgure jvgu gurve fvtangherf\
|
||||
naq bssfrgf vagb gur qvpgvbanel svyr fb gung gur cynva-grkg irefvba bs
|
||||
n jbeq pna yngre or sbhaq sbe cevagvat. Guvf vasbezngvba vf xrcg va n
|
||||
ybpny "fgehpg" va gur qvpgvbanel-ernqvat shapgvba, naq zrzbel vf
|
||||
nyybpngrq sbe rnpu pnaqvqngr jbeq fvzcyl ol znxvat nabgure erphefvir
|
||||
pnyy gb gung shapgvba.
|
||||
|
||||
\
|
||||
Rnpu fgehpg fb nyybpngrq vf yvaxrq vagb n svkrq-fvmr unfu gnoyr bs
|
||||
4096 ragevrf vaqrkrq ol gur 12 ybj ovgf bs gur jbeq'f fvtangher.
|
||||
4096 ragevrf vaqrkrq ol gur 12 ybj ovgf bs gur jbeq'f fvtangher.\
|
||||
Jura gur qvpgvbanel-ernqvat shapgvba rapbhagref raq-bs-svyr, nyy gur
|
||||
pnaqvqngr jbeqf unir orra fgberq va arfgrq npgvingvba erpbeqf ba gur
|
||||
fgnpx, npprffvoyr guebhtu gur unfu gnoyr.
|
||||
|
||||
\
|
||||
Trarengvat gur nantenzf vf gura qbar ol genirefvat gur unfu gnoyr naq
|
||||
fhogenpgvat gur yrggref bs rnpu jbeq va gur unfu gnoyr sebz gur
|
||||
"pheerag fragrapr", juvpu vavgvnyyl vf gur fragrapr tvira ba gur
|
||||
pbzznaq yvar.
|
||||
|
||||
\
|
||||
Gur fhogenpgvba vf cresbezrq va cnenyyry ba gur 4-ovg yrggre pbhagf
|
||||
nf qrfpevorq nobir, naq vs nyy 32 erfhygf ner mreb, na nantenz unf
|
||||
orra sbhaq. Vs gur erfhyg vf artngvir sbe bar be zber bs gur yrggref
|
||||
(nf vaqvpngrq ol bar be zber "1" va n irpgbe bs 32 obeebj ovgf
|
||||
erghearq ol gur fhogenpgvba ebhgvar), gur jbeq qvq abg zngpu gur
|
||||
pheerag fragrapr naq vf vtaberq. Svanyyl, vs gur erfhyg pbagnvarq
|
||||
bayl abaartngvir yrggre pbhagf, jr unir sbhaq n cnegvny nantenz:
|
||||
bayl abaartngvir yrggre pbhagf, jr unir sbhaq n cnegvny nantenz:\
|
||||
n jbeq pbagnvavat fbzr, ohg abg nyy, bs gur yrggref va gur pheerag
|
||||
fragrapr. Va guvf pnfr jr erphefviryl gel gb svaq na nantenz bs gur
|
||||
erznvavat yrggref. Gur qrcgu bs gur erphefvba vf yvzvgrq gb gur
|
||||
znkvzhz ahzore bs jbeqf va gur nantenz, nf fcrpvsvrq ol gur hfre.
|
||||
|
||||
\
|
||||
Jura gur qrrcrfg erphefvba yriry unf orra ernpurq, na bcgvzvmngvba pna
|
||||
or nccyvrq: orpnhfr ab shegure erphefvba jvyy or qbar, gurer vf ab
|
||||
arrq gb ybbx sbe cnegvny nantenzf, naq gurersber NT bayl arrqf gb
|
||||
purpx sbe jbeqf gung pbagnva rknpgyl gur fnzr yrggref nf gur pheerag
|
||||
fragrapr. Gubfr jbeqf pna or sbhaq fvzcyl ol vaqrkvat gur unfu gnoyr
|
||||
jvgu gur fvtangher bs gur pheerag fragrapr.
|
||||
|
||||
\
|
||||
Rira jura abg ba gur qrrcrfg erphefvba yriry, NT trarenyyl nibvqf
|
||||
rknzvavat nyy gur ragevrf bs gur unfu gnoyr. Gur vqrn vf gung jr ner
|
||||
abg vagrerfgrq va unfu ohpxrgf jubfr jbeqf pbagnva nal yrggref abg
|
||||
@@ -231,7 +231,7 @@ algorithms are outlined in the rot-13 encoded spoiler below.
|
||||
gubfr unfu ohpxrg vaqvprf "v" gung pbagnva mrebrf va nyy gur ovg
|
||||
cbfvgvbaf jurer gur fvtangher "f" bs gur pheerag fragrapr pbagnvaf
|
||||
n mreb; guvf pna or rkcerffrq va P nf (v & ~f == 0).
|
||||
|
||||
\
|
||||
Vg vf cbffvoyr gb ybbc guebhtu nyy fhpu ahzoref va na rssvpvrag jnl ol
|
||||
gnxvat nqinagntr bs pregnva cebcregvrf bs ovanel nevguzrgvp: ol
|
||||
sbepvat gur ovgf pbeerfcbaqvat gb mrebrf va "f" gb barf, jr pna znxr
|
||||
@@ -239,15 +239,15 @@ algorithms are outlined in the rot-13 encoded spoiler below.
|
||||
gubfr ovgf gung fubhyq erznva mreb. Sbe rknzcyr, gur sbyybjvat
|
||||
cebtenz cevagf nyy gubfr 16-ovg vagrtref gung pbagnva mrebrf va nyy
|
||||
rira ovg cbfvgvbaf:
|
||||
|
||||
\
|
||||
znva(){vag v=0,f=0kNNNN;qb{cevags("%04k\g",v);}juvyr(v=((v|~f)+1)&f);}
|
||||
|
||||
\
|
||||
NT hfrf n fvzvyne zrgubq ohg jbexf va gur bccbfvgr qverpgvba, svaqvat
|
||||
gur arkg ybjre inyhr jvgu mrebrf va tvira ovg cbfvgvbaf ol cebcntngvat
|
||||
obeebjf npebff gubfr ovgf. Fbzr nqqvgvbany nqwhfgzragf ner znqr
|
||||
gb gur unfu gnoyr vaqrk jura vavgvngvat n erphefvir frnepu, hfvat
|
||||
fvzvyne ovg-gjvqqyvat grpuavdhrf.
|
||||
|
||||
\
|
||||
Jurarire na nantenz unf orra sbhaq, vg vf cevagrq ol genirefvat n
|
||||
yvaxrq yvfg sbezrq ol fgehpgf va gur npgvingvba erpbeqf bs gur
|
||||
erphefvir vaibpngvbaf bs gur frnepu shapgvba, frrxvat gb gur ortvaavat
|
||||
|
||||
+7
-7
@@ -1,11 +1,11 @@
|
||||
# Best Output
|
||||
|
||||
Ian Collier
|
||||
Oxford University
|
||||
The Queen's College
|
||||
High Street
|
||||
Oxford
|
||||
OX1 4AW
|
||||
Ian Collier\
|
||||
Oxford University\
|
||||
The Queen's College\
|
||||
High Street\
|
||||
Oxford\
|
||||
OX1 4AW\
|
||||
England
|
||||
|
||||
## To build:
|
||||
@@ -20,7 +20,7 @@ make all
|
||||
# text mode
|
||||
./imc -text
|
||||
|
||||
./imc
|
||||
./imc\
|
||||
```
|
||||
|
||||
## Judges' remarks:
|
||||
|
||||
@@ -1,9 +1,9 @@
|
||||
# Best X Program
|
||||
|
||||
Tero Kivinen
|
||||
Helsinki University of Technology
|
||||
Klovinrinne 6b
|
||||
02180 Espoo
|
||||
Tero Kivinen\
|
||||
Helsinki University of Technology\
|
||||
Klovinrinne 6b\
|
||||
02180 Espoo\
|
||||
Finland
|
||||
|
||||
|
||||
|
||||
+2
-2
@@ -1,6 +1,6 @@
|
||||
# Worst Abuse of the C Preprocessor
|
||||
|
||||
Ed Luke
|
||||
Ed Luke\
|
||||
US
|
||||
|
||||
|
||||
@@ -21,7 +21,7 @@ make all
|
||||
## Judges' remarks:
|
||||
|
||||
The program uses error messages issued by the C Preprocessor to
|
||||
generate its message to the world. One program's error is another
|
||||
generate its message to the world. One program's error is another\
|
||||
program's data!
|
||||
|
||||
|
||||
|
||||
@@ -1,9 +1,9 @@
|
||||
# Best Game
|
||||
|
||||
Marangoni Andrea
|
||||
Department of Computer Science at Milano
|
||||
Via Pausula, 72
|
||||
62014 Corridonia (MC)
|
||||
Marangoni Andrea\
|
||||
Department of Computer Science at Milano\
|
||||
Via Pausula, 72\
|
||||
62014 Corridonia (MC)\
|
||||
Italy
|
||||
|
||||
## To build:
|
||||
|
||||
@@ -1,10 +1,10 @@
|
||||
# Worst Abuse of the Rules
|
||||
|
||||
Nathan Sidwell
|
||||
Inmos UK
|
||||
1000 Aztec West
|
||||
Almondsbury
|
||||
Bristol
|
||||
Nathan Sidwell\
|
||||
Inmos UK\
|
||||
1000 Aztec West\
|
||||
Almondsbury\
|
||||
Bristol\
|
||||
UK BS12 4SQ
|
||||
|
||||
## To build:
|
||||
|
||||
+6
-6
@@ -1,11 +1,11 @@
|
||||
# Best of Show
|
||||
|
||||
Vern Paxson
|
||||
Lawrence Berkeley Laboratory
|
||||
Computer Systems Engineering
|
||||
Bldg. 46A, Room 1123
|
||||
Lawrence Berkeley Laboratory
|
||||
1 Cyclotron Rd.
|
||||
Vern Paxson\
|
||||
Lawrence Berkeley Laboratory\
|
||||
Computer Systems Engineering\
|
||||
Bldg. 46A, Room 1123\
|
||||
Lawrence Berkeley Laboratory\
|
||||
1 Cyclotron Rd.\
|
||||
Berkeley, CA 94720 US
|
||||
|
||||
## To build:
|
||||
|
||||
@@ -1,7 +1,7 @@
|
||||
# Best Small Program
|
||||
|
||||
Brian Westley (aka Merlyn LeRoy)
|
||||
US
|
||||
Brian Westley (aka Merlyn LeRoy)\
|
||||
US\
|
||||
<http://www.westley.org>
|
||||
|
||||
|
||||
@@ -132,10 +132,10 @@ is reasonably accurate.
|
||||
|
||||
### Here are some cities you might like to try:
|
||||
|
||||
- New York 41 -74
|
||||
- London 52 0
|
||||
- Moscow 56 38
|
||||
- New Delhi 29 77
|
||||
- New York 41 -74\
|
||||
- London 52 0\
|
||||
- Moscow 56 38\
|
||||
- New Delhi 29 77\
|
||||
- Sydney -34 151
|
||||
- Los Angeles 34 -118
|
||||
- Paris 45 2
|
||||
|
||||
Reference in new issue
Block a user