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
- Java7
- 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
<?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();
...
-
1
herro world
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <stdio.h> #include <stdlib.h> #include <time.h> #include <algorithm> using namespace std; bool checkSorted(int c[]){
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <stdio.h> #include <stdlib.h> #include <time.h> #include <algorithm> using namespace std; bool checkSorted(int c[]){
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; void CtoF(int); int main() { //C = 67, c = 99, K = 75, k =107, F = 70, f = 102 int x; char y; cout << "Enter a temperature and temperature system (Ex. 100 F)" << endl;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { char x = x; char y = y; int numOfX; int numOfY;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { char x = x; char y = y; int numOfX; int numOfY;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { char x; char y; int numOfX; int numOfY;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { char x; char y; int numOfX; int numOfY;
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> using namespace std; int main() { char x; char y; int numOfX; int numOfY;
...
-
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
begin 644 webutils_pl M8F5G:6X@-C0T(&EN9F\R+FAT;6P-"DTO(UU8.S900#U&-5(\5D5/.T-40BPR M6%`H0F!?+T)@0")#4$$Q)%TC-25%,#$R(4@])E5,*"4A-3!$42D-"DTP4F!" M*S)<3S53+2,K4ETD-20P0#8D030S-%!`+#)84"@E,5(X-EE3.C<Q23M664$[ M(EQ/,3180B)"8$(-"DTZ)S%4/"-(3RM7/5<]4EE7+%)93SQ&/$\U)2A//B9! M5#LV4%$K5#$T,2)=6#HG,4T[(R1-/2<I03M'+4D-"DT])D5/.T8E3"M&,50Y M(BA>(D!(0"@B8"DH8$1`(D)@0"A@1$`H8$0I(C!(7#HG,4T[(B%8.S913CQ3 M5$(-"DTZ)S%4/"-(3RM7/5<]4EE7+%)93SQ&/$\L,T19+C)=6#HG,4T[(BA> M+R9!13@V,%XH(F!`(C!$*2@B8"D-"DTB0U%4.C<Q3#DS62<Y-EU#.#8M2#DR
...
-
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
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
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
namespace Home8 { class Program { static void Time(int MaxDelay) { double temp; for (int delay = 1; delay <= MaxDelay; delay++) temp = Math.Pow(Math.PI, 2);
...
-
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
...


