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
let n = 1 + 1
-
1
1 + 1
-
1 2 3 4
let x = ref 0 let f () = x := !x + 1; !x print f
-
1 2
let x = ref 0 let f () = x := !x + 1; !x
-
1 2 3 4 5 6
let x = ref 0 let f () = x := !x + 1; !x let a = f () in let b = f () in print_int ( a - b )
-
1 2 3 4 5
let x = ref 0 let f () = x := !x + 1; !x let a = f() print_int a
-
1 2 3 4 5
let x = ref 0 let f () = x := !x + 1; !x let a = f() print a
-
1 2
let x = ref 0 let f () = x := !x + 1; !x
-
1 2
let x = ref 0 let f () = x := !x + 1; !x
-
1 2 3 4 5 6
let x = ref 0 let f () = x := !x + 1; !x let a = f () in let b = f () in a - b
-
1 2 3 4 5 6 7 8 9
let x = ref 0 let f () = lazy (x := !x + 1; !x) let (!$) x = Lazy.force x let a = f () in let b = f () in print_int (!$ b); print_int (!$ a); (!$ a) - (!$ b) ;;
-
1 2 3 4 5 6 7 8 9
let x = ref 0 let f () = lazy (x := !x + 1; !x) let (!$) x = Lazy.force x let a = f () in let b = f () in print_int (!$ b); print_int (!$ a); (!$ a) - (!$ b)
-
1 2 3 4 5 6 7 8 9
let x = ref 0 let f () = lazy (x := !x + 1; !x) let (!$) x = Lazy.force x let a = f () in let b = f () in print_int (!$ b); print_int (!$ a); (!$ a) - (!$ b)
-
1 2 3 4 5 6 7 8 9
let x = ref 0 let f () = lazy (x := !x + 1; !x) let (!$) x = Lazy.force x let a = f () in let b = f () in print_int (!$ b); print_int (!$ a); (!$ a) - (!$ b)
-
1 2 3 4 5 6 7 8 9
let x = ref 0 let f () = lazy (x := !x + 1; !x) let (!$) x = Lazy.force x let a = f () in let b = f () in print_int (!$ b); print_int (!$ a); (!$ a) - (!$ b)
-
1 2 3 4 5 6 7 8 9
let x = ref 0 let f () = lazy (x := !x + 1; !x) let (!$) x = Lazy.force x let a = f () in let b = f () in print_int (!$ b); print_int (!$ a); (!$ a) - (!$ b)
-
1 2 3 4 5 6 7 8 9
let x = ref 0 let f () = lazy (x := !x + 1; !x) let (!$) x = Lazy.force x let a = f () in let b = f () in print_int (!$ b); print_int (!$ a); (!$ a) - (!$ b)
-
1 2 3 4 5 6 7 8 9
let x = ref 0 let f () = lazy (x := !x + 1; !x) let (!$) x = Lazy.force x let a = f () in let b = f () in print_int (!$ b); print_int (!$ a); (!$ a) - (!$ b)
-
1 2 3 4 5 6 7 8 9
(*O/*_/ Cu #%* )pop mark/CuG 4 def/# 2 def%%%%@@P[TX---P\P_SXPY!Ex(mx2ex("SX!Ex4P)Ex= CuG #%* *+Ex= CuG #%*------------------------------------------------------------------*+Ex= CuG #%* POLYGLOT - a program in eight languages 15 February 1991 *+Ex= CuG #%* 10th Anniversary Edition 1 December 2001 *+Ex= CuG #%* *+Ex= CuG #%* Written by Kevin Bungard, Peter Lisle, and Chris Tham *+Ex= CuG #%* *+Ex=
...
-
1 2 3 4 5 6 7 8 9
(* * Haxe Compiler * Copyright (c)2005 Nicolas Cannasse * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License as published by * the Free Software Foundation; either version 2 of the License, or * (at your option) any later version. *
...
-
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
-
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
class exercício1 { public static void main (String[] args) { int n1=2; square mySquare = new square(); mySquare.displaySquare(int n1); } }
...
-
1 2 3 4 5
Fixpoint make (n : nat) (A : Set) : Set := match n with | O => unit | S m => (A * (make m A))%type end.
-
1
print_string "ASDASDASDASD";
-
1
print_str "ASDASDASDASD";
-
1
print "ASDASDASDASD";
-
1 2
let a = 10;; print a;;
-
1 2 3 4 5 6 7 8
let tot1=read_int();; let s1=read_line();; let tot2=read_int();; let s2=read_line();; let mtz=Array.make_matrix (tot1+1) (tot2+1) 0;; let big=ref 0;; let auxi=ref 0;; let auxj=ref 0;;
...


