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
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; public class AddNum{ public static void main(String args[]){ int a , b; Scanner kb = new Scanner(System.IN); System.OUT.print("Input first number: ");
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; public class AddNum{ public static void main(String args[]){ int a , b; Scanner kb = new Scanner(System.IN); System.OUT.print("Input first number: ");
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; public class AddNum{ public static void main(String args[]){ int a , b; Scanner kb = new Scanner(System.IN); System.OUT.print("Input first number: ");
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; public class AddNum{ public static void main(String args[]){ int a , b; Scanner kb = new Scanner(System.IN); System.OUT.print("Input first number: ");
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; public class AddNum{ public static void main(String args[]){ int a , b; Scanner kb = new Scanner(System.IN); System.OUT.print("Input first number: ");
...
-
1 2 3 4 5 6 7 8 9
DON'T WORRY, BE HAPPY PLEASE COME FROM (4) (4) DO (1) NEXT (3) DO .2 <- '?"!1~.1'~#1"$#1'~#3 DO (5) NEXT (7) PLEASE DO NOTHING (5) PLEASE RESUME .2 (1) PLEASE NOTE THAT WE ARE NOT PROMPTING DO COME FROM (7)
...
-
1 2 3 4 5 6 7 8
DON'T WORRY, BE HAPPY DO (2) NEXT (1) PLEASE NOTE THAT WE ARE NOT PROMPTING DO WRITE IN .1 DO READ OUT .001 PLEASE RESUME .1 (2) DO (1) NEXT DO GIVE UP
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE D (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4
DO ,1 <- #1 DO ,1SUB#1 <- #234 DO READ OUT ,1 DO GIVE UP
-
1 2 3 4
DO ,1 <- #1 DO ,1SUB#1 <- #234 DO READ OUT ,1 PLEASE GIVE UP
-
1 2 3 4 5 6 7 8 9
DO ,1 <- #13 PLEASE DO ,1 SUB #1 <- #238 DO ,1 SUB #2 <- #108 DO ,1 SUB #3 <- #112 DO ,1 SUB #4 <- #0 DO ,1 SUB #5 <- #64 DO ,1 SUB #6 <- #194 DO ,1 SUB #7 <- #48 PLEASE DO ,1 SUB #8 <- #22
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { int intNum = 0; cin >> intNum; while (intNum != 42) {
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8 9
DO ,1 <- #13 PLEASE DO ,1 SUB #1 <- #238 DO ,1 SUB #2 <- #108 DO ,1 SUB #3 <- #112 DO ,1 SUB #4 <- #0 DO ,1 SUB #5 <- #64 DO ,1 SUB #6 <- #194 DO ,1 SUB #7 <- #48 PLEASE DO ,1 SUB #8 <- #22
...
-
1 2 3 4 5 6 7 8 9
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
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
DO ,915 <- #1 DO ,2216 <- #2 DO .2216 <- #1 DO .129 <- #0 DO .1215 <- #0 (19) PLEASE DON'T FORGET #1 DO REINSTATE FORGETTING PLEASE DO (18514) NEXT
...
-
1 2 3 4 5 6 7 8
#include <iostream> #include <cstdlib> #include <ctime> #include <algorithm> using namespace std; int array[10]; void setup(int max); void sort();
...
-
1 2 3 4 5 6 7 8 9
DO ,1 <- #13 PLEASE DO ,1 SUB #1 <- #238 DO ,1 SUB #2 <- #108 DO ,1 SUB #3 <- #112 DO ,1 SUB #4 <- #0 DO ,1 SUB #5 <- #64 DO ,1 SUB #6 <- #194 DO ,1 SUB #7 <- #48 PLEASE DO ,1 SUB #8 <- #22
...
-
1 2 3 4 5 6 7 8 9
DO ,1 <- #13 PLEASE DO ,1 SUB #1 <- #238 DO ,1 SUB #2 <- #108 DO ,1 SUB #3 <- #112 DO ,1 SUB #4 <- #0 DO ,1 SUB #5 <- #64 DO ,1 SUB #6 <- #194 DO ,1 SUB #7 <- #48 PLEASE DO ,1 SUB #8 <- #22
...
-
1 2 3 4 5 6 7 8
#include <iostream> using namespace std; int main() { return 0; }
-
1
it doesn't matter
-
1 2 3 4 5 6 7 8
#include <iostream> #include <cstdlib> #include <ctime> #include <algorithm> using namespace std; int array[10]; void setup(int max); void sort();
...
-
1 2 3 4
hi how is you doin yahoo megaman go boom
-
1 2 3 4 5 6 7 8
#include <iostream> #include <cstdlib> #include <ctime> #include <algorithm> using namespace std; int array[10]; void setup(int max); void sort();
...


