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
(* Infinite sequence of whole numbers. 0 .. *) let indices = Seq.unfold (fun x -> Some(x, x + 1)) 0 (* Zips the given sequence with indices of elements. *) let zipWithIndex coll = Seq.zip coll indices printfn "%A" ([12; 8; 9; 90; 3; 24] |> zipWithIndex |> Seq.minBy fst) // meh
-
1 2 3 4 5 6 7
(* Infinite sequence of whole numbers. 0 .. *) let indices = Seq.unfold (fun x -> Some(x, x + 1)) 0 (* Zips the given sequence with indices of elements. *) let zipWithIndex coll = Seq.zip coll indices printfn "%A" ([12; 8; 9; 90; 3; 24] |> zipWithIndex |> Seq.minBy fst)
-
1 2 3 4
let indices = Seq.unfold (fun x -> Some(x, x + 1)) 0 let zipWithIndex coll = Seq.zip coll indices printfn "%A" ([12; 8; 9; 90; 3; 24] |> zipWithIndex |> Seq.minBy fst)
-
1 2 3 4 5
let indices = Seq.unfold (fun x -> Some(x, x + 1)) 0 let zipWithIndex coll = Seq.zip coll indices let x = [12; 8; 9; 90; 3; 24] |> zipWithIndex printfn "%A" (Seq.minBy fst x)
-
1 2 3 4 5
let indices = Seq.unfold (fun x -> Some(x, x + 1)) 0 let zipWithIndex coll = Seq.zip coll indices let x = [12; 8; 9; 90, 3; 24] |> zipWithIndex printfn "%A" (Seq.minBy fst x)
-
1 2 3 4 5
let indices = Seq.unfold (fun x -> Some(x, x + 1)) 0 let zipWithIndex coll = Seq.zip coll indices printfn "%A" ([12; 8; 9; 90, 3; 24] |> zipWithIndex |> Seq.minBy fst)
-
1 2 3 4 5
let indices = Seq.unfold (fun x -> Some(x, x + 1)) 0 let zipWithIndex coll = Seq.zip coll indices printfn "%A" ([12; 8; 9; 90, 3; 24] |> zipWithIndex |> Seq.minBy fst)
-
1 2 3 4 5 6 7 8 9
module Seq = let zipWithIndex coll = Seq.zip coll ( seq { let i = ref 0 while true do let x = !i i := !i + 1 yield x }
...
-
1 2 3 4 5 6 7 8 9
let foo = Seq.zip [3; 4; 89] ( seq { let i = ref 0 while true do let x = !i i := !i + 1 yield x } )
...
-
1 2 3
let foo = Seq.zip [3; 4; 89] (seq { 0 .. }) printfn "%A" foo
-
1 2 3 4 5 6 7 8 9
open System [<EntryPoint>] let main (args: string[]) = if args.Length <> 2 then failwith "Error: " let greeting, thing = args.[0], args.[1] let timeOfDay = DateTime.Now.ToString("hh:mm tt") printfn "%s, %s at %s" greeting thing timeOfDay 0
-
1 2 3 4 5 6 7 8 9
open System [<EntryPoint>] let main (args: string[]) = if args.Length <> 2 then failwith "Error: " let greeting, thing = args.[0], args.[1] let timeOfDay = DateTime.Now.ToString("hh:mm tt") printfn "%s, %s at %s" greeting thing timeOfDay 0
-
1 2 3 4 5 6 7 8 9
open System [<EntryPoint>] let main (args: string[]) = if args.Length <> 2 then failwith "Error: " let greeting, thing = args.[0], args.[1] let timeOfDay = DateTime.Now.ToString("hh:mm tt") printfn "%s, %s at %s" greeting thing timeOfDay 0
-
1 2 3 4 5 6 7 8 9
f~^kn~+c+ia~^+~cf+?/ [f!c-ki~:~b/au>++*+k~~r~bn!*+i <kk]k/>rkbrn~!:?[->+uc*a+af~>^b+ub+k +i?:fn>+b+kb^+>kn?+ii/kb++u>?a+^+?+u>u?c+ i:+~/+>++:kba+~b?+:>+rr!b+k+++u?n<k!b**<i<c~i <!^<<<<krb~^/]>>-u~/*-:<ck^<++!!:n+!kcbinc[~kr-: *k:!kb?>c~>>*u!nnrbabi>+irn>i?+~+?>icc*+ci+i+!<<rb ^knnb<!<!i<b^r<i!^/]>f/>>a/?>i~>~>>>b--.r/rucffa!/<n <:u<?ua<cr<*:<i:bb<fu/nb.>b:r:*?**>n:!>::~/*+.>>r-:.:
...
-
1 2 3 4 5 6 7
open System let mutable num = System.Console.ReadLine() while not(System.String.Equals(num, "42", System.StringComparison.CurrentCultureIgnoreCase)) do System.Console.Write(num) num <- System.Console.ReadLine() System.Console.WriteLine()
-
1 2 3 4 5 6 7 8 9
# #### ##### #### ## ################# ## ############# ############# ####### ####### ###### ###### ### Spieglein ### ###### ###### ###### Spieglein ######
...
-
1 2 3 4 5 6 7 8 9
let ReverseString (s:string) = new string(Array.rev (s.ToCharArray())) let listOfReverseAndAdd2 = [ for i in 1..10000 do if System.Int64.Parse( (ReverseString (i.ToString()))) |> (+) (System.Int64.Parse(i.ToString())) |> isPalindrome //this requires a string but the above computation is returning integer. What to do? then
...
-
1 2 3 4 5 6 7 8 9
int*** allocate3D(int m, int n, int p) { int ***arr3D; int i, j, k; int value = 3; arr3D = new int**[x]; for(i=0; i < x; i++) {
...
-
1 2 3 4 5 6 7 8 9
#include <iostream> #include <cstdio> #include <cstdlib> using namespace std; int*** allocate3D(int m, int n, int p) { int ***arr3D; int i, j, k;
...
-
1 2 3 4 5 6 7 8 9
let ReverseString (s:String) = new string(List.Reverse List.ofSeq s) Console.WriteLine(ReverseString "bhu") let isPalindrome str = match str with | String.rev str -> true
-
1 2 3 4 5 6 7 8 9
let rec permutations (xs : 'a list) = if List.isEmpty xs then [[]] else [ for a in xs do yield! xs |> List.filter (fun x -> x <> a) |> permutations |> List.map (fun xs -> a :: xs) ] let rec calcP acc = function | h :: t -> calcP (h / (h + Seq.sum t) :: acc) t
...
-
1
System.println("a")
-
1 2 3 4
open System let modValue = -5 % 2 System.Console.WriteLine( modValue )
-
1 2 3 4 5 6 7 8 9
...
-
1 2 3 4 5 6 7 8 9
open System let testString = List.ofArray ("not a or b and c iff (d imp e)".ToCharArray()); // Тип-прямая сумма с токенами type Token = | LBrace | RBrace | Follows | IFF | Imp | And | Or | Not | True | False | Term of string // Именование токенов
...
-
1 2 3 4 5 6 7 8 9
open System let testString = List.ofArray ("not a or b and c iff (d imp e)".ToCharArray()); // Тип-прямая сумма с токенами type Token = | LBrace | RBrace | Follows | IFF | Imp | And | Or | Not | True | False | Term of string // Именование токенов
...
-
1 2 3 4 5 6 7 8 9
class sample { public static void main(String args[]) { String a[]={'j','e','s','u','s'}; System.out.println("length"); for(int i=1;i<5;i++) { for(int j=0;j<i;j++)
...
-
1 2 3 4 5 6 7
open System let mutable num = System.Console.ReadLine() while not(System.String.Equals(num, "42", System.StringComparison.CurrentCultureIgnoreCase)) do System.Console.Write(num) num <- System.Console.ReadLine() System.Console.WriteLine()
-
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
open System nombre = System.Console.ReadLine() calif1 = System.Double.Parse(System.Console.ReadLine()) calif2 = System.Double.Parse(System.Console.ReadLine()) notaFinal = (calif1 + calif2)/2 if(notaFinal > 60) then mensaje = " Aprobó" else mensaje = " Reprobó"
...


