Recent public codes are listed below. You can filter them by the following programming languages:
- view
- All
- Ada
- Assembler
- Assembler
- AWK (gawk)
- AWK (mawk)
- Bash
- bc
- Brainf**k
- C
- C#
- C++
- C++0x
- C99 strict
- CLIPS
- Clojure
- COBOL
- COBOL 85
- Common Lisp (clisp)
- D (dmd)
- Erlang
- F#
- Factor
- Falcon
- Forth
- Fortran
- Go
- Groovy
- Haskell
- Icon
- Intercal
- Java
- JavaScript (rhino)
- JavaScript (spidermonkey)
- Lua
- Nemerle
- Nice
- Nimrod
- Objective-C
- Ocaml
- Oz
- Pascal (fpc)
- Pascal (gpc)
- Perl
- Perl 6
- PHP
- Pike
- Prolog (gnu)
- Prolog (swi)
- Python
- Python 3
- R
- Ruby
- Scala
- Scheme (guile)
- Smalltalk
- SQL
- Tcl
- Text
- Unlambda
- VB.NET
- Whitespace
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
Er ist’s Frühling läßt sein blaues Band
...
-
1 2 3 4 5 6 7 8 9
AWPEJ LMIPZ SNWQR JMBBU NRWAN EXMPY LNOLF DZBZA KCSOI ZSSRI ILSJU PDUCG TOLTV STPEZ VJFYT GUIAB BMBDL KYOWI MWWSJ PCFFC TOXPS BNOOO SPYTA IOIDU BZENQ RZLPT LDXXB VWXHY FRVXX KPUUL JNVKG BMHTR MDVGL GWALB FFHLG PCWKO YYTII RTYRE ZGPHP HWECW YAXBI LSJBE YDEPY FMELM YUVBX
...
-
1 2 3 4 5 6 7 8 9
<html xmlns="http://www.w3.org/1999/xhtml"><head> <title>Geocache GC... Für Informatiker - 2</title> </head> <body> <h1>GC33VAC Für Informatiker - 2</h1> <p>Da bei <a href="http://coord.info/GC33PE9">GC33PE9</a> <a href="http://www.geocaching.com/seek/log.aspx?LUID=b3581348-cdb9-41ff-9014-40b52df3446b">der Wunsch nach mehr derartigen Caches</a> geäußert wurde, gibt es jetzt "Für Informatiker - 2".</p> <p>Meiner Einschätzung nach, dürfte das zugehörige Rätsel sogar noch etwas schwerer sein, als beim
...
-
1
-
1
-
1 2 3 4 5 6 7 8 9
Er ist’s Frühling läßt sein blaues Band
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1
asdf
-
1 2 3 4 5 6 7 8 9
++ Counter for loop (a) >+ unused >++ Counter for loop (b) > Flag for 'no more' >+ Flag for not 'no more' >>> (5) to (7) : temporary values ++++++++++[->+>+>++++++++++<<<]>>> 10 10 100 in (8) (9) (10) >++++++++++ 10 in (11) [-
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
Ask the user how many fibonacci numbers they want from the sequence and print that many one number per line.
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
-
1 2 3 4 5 6 7 8 9
-
1 2 3 4 5 6 7 8 9
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
<?xml version="1.0" ?> <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> <html xmlns="http://www.w3.org/1999/xhtml"><head> <title>Geocache GC... Für Informatiker - 2</title> </head>
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
...
-
1