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
i = 2; while(i < (stdin)) { i = i*i; print("louie"); } print(i);
-
1 2 3 4 5 6 7 8
i = 2; while(i < 32) { i = i*i; print("louie"); } print(i);
-
1 2 3 4 5 6 7 8
i = 2; while(i < 32) { i = i*i; print("louie"); } print(i);
-
1 2 3 4 5 6 7 8
i = 2; while(i < 64) { i = i*i; print("louie"); } print(i);
-
1 2 3 4 5 6 7
i = 2; while((i < readline()) ) { i = i*i; print("louie"); }
-
1 2 3
while((num = readline()) != 42) { print(num); }
-
1 2 3
while((num = readline()) != 42) { prium); }
-
1 2 3
i = 2; print(i);
-
1 2 3 4 5 6
i = 2; while(i < 256) { i =i*i; print("louie"); print(i); }
-
1 2 3 4 5 6
i = 2; while(i < 10000) { i =i*i; print("louie"); print(i); }
-
1 2 3 4 5 6
i = 2; while(i < 65537) { i =i*i; print("louie"); print(i); }
-
1 2 3 4 5 6
i = 2; while(i < 512) { i =i*i; print("louie"); print(i); }
-
1 2 3 4 5 6
i = 2; while(i < 64) { i =i*i; print("louie"); print(i); }
-
1 2 3 4 5
i = 2; while(i < 65537) { i =i*i; print("louie"); }
-
1 2 3 4 5
i = 2; while(i < 550) { i =i*i; print("louie"); }
-
1 2 3 4 5
i = 2; while(i < 512) { i =i*i; print("louie"); }
-
1 2 3 4 5
i = 2; while(i < 256) { i =i*i; print("louie"); }
-
1 2 3 4 5
i = 2; while(i < 128) { i =i*i; print("louie"); }
-
1 2 3 4 5
i = 2; while(i < 64) { i =i*i; print("louie"); }
-
1 2 3 4 5 6 7
i = 2; n = 64; while((i<n) { i = i*i print(Louie); }
-
1 2 3
while((num = readline()) != 42) { print(num); }
-
1 2 3 4 5 6 7 8
public class main { public static void main(String[] args){ int n = 3; int i = 1; int j = 1;
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; public class P1 { public static void main(String[] args){ Scanner input = new Scanner(System.in); int n = input.nextInt();
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; public class P2 { public static void main(String[] args){ Scanner input = new Scanner(System.in); int n = 3;
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; public class P2 { public static void main(String[] args){ Scanner input = new Scanner(System.in); int n = 3;
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; public class P2 { public static void main(String[] args){ Scanner input = new Scanner(System.in); int n = input.nextInt();
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; public class P4 { public static void main(String[] args) { Scanner input = new Scanner(System.in); int R = input.nextInt();
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; class P1 { public static void main(String[] args){ Scanner input = new Scanner(System.in); int n = input.nextInt();
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; public class P1 { public static void main(String[] args){ Scanner input = new Scanner(System.in); int n = input.nextInt();
...
-
1 2 3 4 5 6 7 8 9
import java.util.Scanner; public class P1 { public static void main(String[] args){ Scanner input = new Scanner(System.in); int n = input.nextInt();
...


