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:
1 parent
ddb78f6f33
commit
6625034139
263 files changed
+1181
-1181
No files matched your search
+1
-1
@@ -1,6 +1,6 @@
|
||||
# Best Output
|
||||
|
||||
Carlos Duarte
|
||||
Carlos Duarte\
|
||||
Portugal
|
||||
|
||||
|
||||
|
||||
@@ -1,9 +1,9 @@
|
||||
# Most Humorous
|
||||
|
||||
Don Dodson
|
||||
AG Communication Systems
|
||||
4101 W Union Hills Dr #1104
|
||||
Glendale, AZ 85308
|
||||
Don Dodson\
|
||||
AG Communication Systems\
|
||||
4101 W Union Hills Dr #1104\
|
||||
Glendale, AZ 85308\
|
||||
US
|
||||
|
||||
## To build:
|
||||
|
||||
@@ -1,6 +1,6 @@
|
||||
# Best Game
|
||||
|
||||
Don Dodson
|
||||
Don Dodson\
|
||||
US
|
||||
|
||||
## To build:
|
||||
|
||||
+3
-3
@@ -1,8 +1,8 @@
|
||||
# Interesting Algorithm
|
||||
|
||||
Sebastian Deorowicz
|
||||
ul. Radzionkowska 71a
|
||||
42-605 Tarnowskie Gory
|
||||
Sebastian Deorowicz\
|
||||
ul. Radzionkowska 71a\
|
||||
42-605 Tarnowskie Gory\
|
||||
Poland
|
||||
|
||||
## To build:
|
||||
|
||||
@@ -1,9 +1,9 @@
|
||||
# Best Layout
|
||||
|
||||
Heather Downs & Selene Makarios
|
||||
The Software Bungalow
|
||||
900 High School Way, #2202
|
||||
Mountain View, CA 94041
|
||||
Heather Downs & Selene Makarios\
|
||||
The Software Bungalow\
|
||||
900 High School Way, #2202\
|
||||
Mountain View, CA 94041\
|
||||
US
|
||||
|
||||
## To build:
|
||||
|
||||
+7
-7
@@ -1,8 +1,8 @@
|
||||
# Best Use of Obfuscation
|
||||
|
||||
Leonid A. Broukhis
|
||||
46728 Crawford St., apt. 20
|
||||
Fremont, CA 94539
|
||||
Leonid A. Broukhis\
|
||||
46728 Crawford St., apt. 20\
|
||||
Fremont, CA 94539\
|
||||
US
|
||||
|
||||
## To build:
|
||||
@@ -167,7 +167,7 @@ Step 6:
|
||||
|
||||
depending on the desired "hairiness". The original (paper-based)
|
||||
algorithm was "hairy", but it didn't look as good on the screen.
|
||||
|
||||
\
|
||||
The program cannot handle non-hairy mode 100% correctly - step 6 happens
|
||||
to be
|
||||
|
||||
@@ -190,7 +190,7 @@ the opening for step 1 is not a single line but a cross:
|
||||
```
|
||||
\./
|
||||
/ \
|
||||
|
||||
\
|
||||
```
|
||||
|
||||
To watch it repeatedly (as a screensaver), use:
|
||||
@@ -207,7 +207,7 @@ The command line:
|
||||
|
||||
draws the same as above. Try:
|
||||
|
||||
```sh
|
||||
```sh\
|
||||
./leo Variable 1 1 | cat - /dev/tty | gs -
|
||||
```
|
||||
|
||||
@@ -224,7 +224,7 @@ if you want to pipe the output to a printer.
|
||||
begin 664 spoiler1
|
||||
M*%1H92!C;VQO;B J:7,J('1H92!S96-R970@<W=I=&-H("T@=&AE('-P86-E
|
||||
=(&)E9F]R92!I="!I<R!N;W0@82!M:7-T86ME*0II
|
||||
|
||||
\
|
||||
end
|
||||
```
|
||||
|
||||
|
||||
@@ -1,9 +1,9 @@
|
||||
# Best Short Program
|
||||
|
||||
Selene Makarios & Heather Downs
|
||||
The Software Bungalow
|
||||
900 High School Way, #2202
|
||||
Mountain View, CA 94041
|
||||
Selene Makarios & Heather Downs\
|
||||
The Software Bungalow\
|
||||
900 High School Way, #2202\
|
||||
Mountain View, CA 94041\
|
||||
US
|
||||
|
||||
## To build:
|
||||
|
||||
@@ -1,9 +1,9 @@
|
||||
# Most Obfuscated Syntax
|
||||
|
||||
Michael Savastio
|
||||
Securicor Telesciences
|
||||
925 1/2 Anchor St, Apt 2
|
||||
Philadelphia, PA 19124
|
||||
Michael Savastio\
|
||||
Securicor Telesciences\
|
||||
925 1/2 Anchor St, Apt 2\
|
||||
Philadelphia, PA 19124\
|
||||
US
|
||||
|
||||
## To build:
|
||||
|
||||
@@ -1,10 +1,10 @@
|
||||
# Best One Liner
|
||||
|
||||
Mark Schnitzius
|
||||
ISX Corporation
|
||||
3215-C Post Woods Dr.
|
||||
Atlanta, GA 30339
|
||||
US
|
||||
Mark Schnitzius\
|
||||
ISX Corporation\
|
||||
3215-C Post Woods Dr.\
|
||||
Atlanta, GA 30339\
|
||||
US\
|
||||
<http://computronium.org/ioccc.html>
|
||||
|
||||
|
||||
|
||||
@@ -1,8 +1,8 @@
|
||||
# Abusing The Rules
|
||||
|
||||
Diomidis Spinellis
|
||||
Greece
|
||||
<https://www.spinellis.gr/>
|
||||
Diomidis Spinellis\
|
||||
Greece\
|
||||
<https://www.spinellis.gr/>\
|
||||
Mastodon: <https://mstdn.social/@DSpinellis>
|
||||
|
||||
## To build:
|
||||
|
||||
@@ -1,10 +1,10 @@
|
||||
# Worst Abuse of the C Preprocessor and Most Likely To Amaze
|
||||
|
||||
Mark Schnitzius & David Van Brackle
|
||||
ISX Corporation
|
||||
1165 Northchase Parkway
|
||||
Suite 120
|
||||
Marietta, GA 30067
|
||||
Mark Schnitzius & David Van Brackle\
|
||||
ISX Corporation\
|
||||
1165 Northchase Parkway\
|
||||
Suite 120\
|
||||
Marietta, GA 30067\
|
||||
US
|
||||
|
||||
## To build:
|
||||
@@ -53,7 +53,7 @@ never be placed on top of a smaller disk.
|
||||
|
||||
Our program solves the Towers of Hanoi problem. Well, that's
|
||||
not exactly true; actually, it's the compiler that solves the
|
||||
problem. The resulting program just prints out the correct
|
||||
problem. The resulting program just prints out the correct\
|
||||
solution.
|
||||
|
||||
How do you trick a compiler into actually solving the problem?
|
||||
@@ -70,7 +70,7 @@ gcc hanoi.c -o hanoi -Dn=4
|
||||
A default value of `5` will be used for `n` if you do not define
|
||||
it on the command line. The value of `n` cannot be greater than
|
||||
fifteen (the compiler we used to test has a limit on the #include
|
||||
depth). The compiler then solves the problem using binary
|
||||
depth). The compiler then solves the problem using binary\
|
||||
arithmetic based on whether particular symbols are defined or not.
|
||||
|
||||
To loop, the program `#include`s itself. This is, of course,
|
||||
@@ -97,7 +97,7 @@ gcc hanoi.c -E -Dn=5 | grep -v \# | grep -v ^\$
|
||||
|
||||
For an odd number of disks, the program will provide a
|
||||
solution wherein the disks end up on peg 2; for an even
|
||||
number of disks, they will end on peg 3. This should
|
||||
number of disks, they will end on peg 3. This should\
|
||||
provide some hint as to what sort of algorithm is used.
|
||||
|
||||
We have included a [spoiler](spoiler.c) version of the program, with
|
||||
|
||||
Reference in new issue
Block a user