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 ,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 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
PLEASE DO this.PLEASE DO that.PLEASE say PLEASE,PLEASE,PLEASE,PLEASE
-
1 2
Hello World
-
1 2 3
Hello World PLEASE PLEASE
-
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
P VJJÖSÅPSJQQERISDPÄG ZANOWMÄYQOUFRULQBSIÅ YOEIZKMTWÅHYTFYÖQQEV ZOEIVKHMJÅAUMMPSJKOV UMQEMPTDQBSGGXCMCPXH NRBTQRQENNBEYHLOTXGZ ESHQHVXBTXÅÅKPKÄRZKP KÄÄNKNRHVXBTXÅÅKNEFG KVLAÅPFTHÅLNUUMBMDWW
...
-
1 2 3 4 5 6 7
#include<stdio.h> int main(void) { printf("hello"); }
-
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 ,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
private class Base{} public class Vis{ transient int iVal; public static void main(String elephant[]){ } }
-
1 2 3 4 5 6
public class Mod{ public static void main(String argv[]){ } public static native void amethod(); }
-
1 2 3 4 5 6 7 8 9
class Base{ public final void amethod(){ System.OUT.println("amethod"); } } public class Fin extends Base{ public static void main(String argv[]){ Base b = new Base();
...
-
1 2 3 4 5 6 7 8 9
class Base{ abstract public void myfunc(); public void another(){ System.OUT.println("Another method"); } } public class Abs extends Base{ public static void main(String argv[]){
...
-
1 2 3 4 5
public class MyMain{ public static void main(String argv){ System.OUT.println("Hello cruel world"); } }
-
1 2 3 4 5 6 7 8 9
v################################################ v################################################ >###8995*\9-13\##>-p55:2**3$#!+59*:!3$9$$2+2p6v## v############################################$<## v##########################?##################### 1################################################ 4#####?##########>v############################## 8##########>##v##$ ############################## *###########>v#########################v-<#######
...
-
1 2 3 4 5 6 7 8 9
Er ist’s Frühling läßt sein blaues Band wieder flattern durch die Lüfte; süße, wohlbekannte Düfte
...
-
1 2 3 4 5 6 7 8 9
IDENTIFICATION DIVISION. PROGRAM-ID. NUMBERS. AUTHOR. TEEBEE. ENVIRONMENT DIVISION. CONFIGURATION SECTION. OBJECT-COMPUTER. IBM-370. SOURCE-COMPUTER. IBM-370. DATA DIVISION. WORKING-STORAGE SECTION.
...
-
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 ,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
// fisier Salutare1.java import java.io.*; class Salutare1{ public static void main(String[ ] arg) { if(arg.length<2) System.OUT.println("Nu ati dat parametrii necesari!!"); else
-
1 2 3 4 5 6 7 8 9
int lim = 0x12345678; int pp = 256; for (int i = 1; (lim-pp) / ((64 + i) + pp) != 0; i++) { if (atan(i - ((i / lim) * lim)) > 1.55) // > ~50 lim = (lim / 50) * 40; int foo = lim; // bar for (int j = 0; j < 0x123456; j++) foo ^= (j >> 3) | (j << 29); // tidy pp &= foo; // IN 42-0 if (lim - ((lim / i) * i) == 0) {
...
-
1 2 3 4 5 6 7 8 9
int lim = 0x12345678; int pp = 256; for (int i = 1; (lim-pp) / ((64 + i) + pp) != 0; i++) { if (atan(i - ((i / lim) * lim)) > 1.55) // > ~50 lim = (lim / 50) * 40; int foo = lim; // bar for (int j = 0; j < 0x123456; j++) foo ^= (j >> 3) | (j << 29); // tidy pp &= foo; // IN 42-0 if (lim - ((lim / i) * i) == 0) {
...
-
1 2 3
DO ,1 <- #13 PLEASE DO ,1 SUB #1 <- #238 GIVE UP
-
1 2 3
DO ,1 <- #13 PLEASE DO ,1 SUB #1 <- #238 PLEASE GIVE UP


