Ideone.com | Online Ocaml Compiler & Debugging Tool

Computer geeks!

Recent public codes are listed below. You can filter them by the following programming languages:

codes: 7611 page: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40

30 days 10 hours ago view (lines: 18, size: 258, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
 
let rec reverse l = 
        match l with
        [] -> []
        | h::t -> ((reverse t) @ [h])
;;
 
 
 ...

30 days 12 hours ago view (lines: 18, size: 258, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
 
let rec reverse l = 
        match l with
        [] -> []
        | h::t -> ((reverse t) @ [h])
;;
 
 
 ...

30 days 13 hours ago view (lines: 18, size: 255, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
 
let rec reverse l = 
        match l with
        [] -> []
        | h::t -> (reverse t) :: h
;;
 
 
 ...

30 days 13 hours ago view (lines: 18, size: 245, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
 
let rec reverse l = 
        match l with
        [] -> []
        | h::t -> (reverse t) :: h
;;
 
 
 ...

30 days 13 hours ago view (lines: 18, size: 244, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
 
let rec reverse l = 
        match l with
        [] -> []
        | h::t -> (reverse t) :: h
;;
 
 
 ...

30 days 13 hours ago view (lines: 18, size: 242, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
 
let rec reverse l = 
        match l with
        [] -> []
        h::t -> (reverse t) :: h
;;
 
 
 ...

30 days 13 hours ago view (lines: 18, size: 241, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
 
let rec reverse l = 
        match l with
        [] -> []
        h:t -> (reverse t) :: h
;;
 
 
 ...

30 days 13 hours ago view (lines: 18, size: 224, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
 
let rec reverse l = 
        match l with
        [] -> []
        h:t -> (reverse t) :: h
;;
 
 
 ...

30 days 13 hours ago view (lines: 18, size: 224, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
 
let rec reverse l = 
        match l with
        [] -> []
        h:t -> (reverse t) :: h
;;
 
 
 ...

30 days 13 hours ago view (lines: 11, size: 239, inputs: 1) Ocaml Success

1
2
3
4
5
6
7
8
9
let size l =
        let rec counter l pos =
            match l with
                [] -> pos
            |   h::t -> counter t (pos+1)
        in
            counter l 0
          
;; 
 ...

30 days 13 hours ago view (lines: 12, size: 190, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
9
let size l =
        let rec counter l pos =
            match l with
                [] -> pos
            |   h::t -> counter t (pos+1)
        in
            counter l 0
          
;; 
 ...

30 days 13 hours ago view (lines: 12, size: 321, inputs: 1) Ocaml Success

1
2
3
4
5
6
7
8
9
let get_kth l k = List.nth l k;;
 
let rec get_kth_2 l k =
    match l with
        []  -> "err"
    |   h::t -> if k=0 then h else get_kth_2 t (k-1)
;;
 
(** test **)
 ...

30 days 13 hours ago view (lines: 12, size: 321, inputs: 1) Ocaml Success

1
2
3
4
5
6
7
8
9
let get_kth l k = List.nth l k;;
 
let rec get_kth_2 l k =
    match l with
        []  -> "err"
    |   h::t -> if k=0 then h else get_kth_2 t (k-1)
;;
 
(** test **)
 ...

30 days 13 hours ago view (lines: 12, size: 320, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
9
let get_kth l k = List.nth l k;;
 
let rec get_kth_2 l k =
    match l with
        []  -> "err"
    |   h::t -> if k=0 then h else get_kth_2 t (k-1)
;;
 
(** test **)
 ...

30 days 13 hours ago view (lines: 12, size: 318, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
9
let get_kth k = List.nth l k;;
 
let rec get_kth_2 l k =
    match l with
        []  -> "err"
    |   h::t -> if k=0 then h else get_kth_2 t (k-1)
;;
 
(** test **)
 ...

30 days 13 hours ago view (lines: 16, size: 415, inputs: 1) Ocaml Runtime error

1
2
3
4
5
6
7
8
9
exception Short_list;;
 
let my_last l = ( List.nth l ((List.length l) -2 ) );;
 
let rec my_last_2 l =
    match l with
        []  -> raise Short_list
    |   h::[]   -> raise Short_list
    |   h::h2::[] -> h
 ...

30 days 13 hours ago view (lines: 16, size: 413, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
9
exception Short_list;;
 
let my_last l = ( List.nth l ((List.length l) -2 ) );;
 
let rec my_last_2 l =
    match l with
        []  -> raise Short_list
    |   h::[]   -> raise Short_list
    |   h::h2::[] -> h
 ...

30 days 13 hours ago view (lines: 16, size: 414, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
9
exception Short_list;;
 
let my_last l = ( List.nth l ((List.length l) -2 ) );;
 
let rec my_last_2 l =
    match l with
        []  -> raise Short_list
    |   h::[]   -> raise Short_list
    |   h::h2::[] -> h;
 ...

30 days 13 hours ago view (lines: 16, size: 412, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
9
exception Short_list;;
 
let my_last l = ( List.nth l ((List.length l) -2 ) );;
 
let rec my_last_2 l =
    match l with
        []  -> raise Short_list
    |   h::[]   -> raise Short_list
    |   h:h2:[] -> h;
 ...

30 days 14 hours ago view (lines: 14, size: 312, inputs: 1) Ocaml Runtime error

1
2
3
4
5
6
7
8
9
exception Empty_list;;
 
let my_last l = ( List.nth l ((List.length l) -1 ) );;
 
let rec my_last_2 l =
    match l with
        []  -> raise Empty_list
    |   h::[]   -> h
    |   h::t    -> my_last_2 t
 ...

30 days 14 hours ago view (lines: 13, size: 272, inputs: 1) Ocaml Success

1
2
3
4
5
6
7
8
9
exception Empty_list;;
 
let my_last l = ( List.nth l ((List.length l) -1 ) );;
 
let rec my_last_2 l =
    match l with
        []  -> raise Empty_list
    |   h::[]   -> h
    |   h::t    -> my_last_2 t
 ...

30 days 16 hours ago view (lines: 11, size: 411, inputs: 1) Ocaml Compilation error

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) {
 ...

31 days 6 hours ago view (lines: 8, size: 160, inputs: 1) Ocaml Success

1
2
3
4
5
6
7
8
let rec multtab x y =
        let rec line y =
                if y = 0 then []
                else line (y-1) @ [x*y];
        in
                if x = 0 then []
                else multtab (x-1) y @ [line y];;
multtab 10 10;;

31 days 8 hours ago view (lines: 1, size: 0, inputs: 1) Ocaml Not running

31 days 12 hours ago view (lines: 11, size: 225, inputs: 1) Ocaml Success

1
2
3
4
5
6
7
8
9
let isPrime n =
  let rec noDivisors m =
    m * m > n || (n mod m != 0 && noDivisors (m + 1))
  in
    n >= 2 && noDivisors 2
    ;;
    
    
let is = isPrime 8 in
 ...

31 days 12 hours ago view (lines: 11, size: 225, inputs: 1) Ocaml Success

1
2
3
4
5
6
7
8
9
let isPrime n =
  let rec noDivisors m =
    m * m > n || (n mod m != 0 && noDivisors (m + 1))
  in
    n >= 2 && noDivisors 2
    ;;
    
    
let is = isPrime 7 in
 ...

31 days 12 hours ago view (lines: 8, size: 165, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
let isPrime n =
  let rec noDivisors m =
    m * m > n || (n mod m != 0 && noDivisors (m + 1))
  in
    n >= 2 && noDivisors 2
    ;;
    
print_boolean isPrime 7;;

31 days 12 hours ago view (lines: 8, size: 162, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
let isPrime n =
  let rec noDivisors m =
    m * m > n || (n mod m != 0 && noDivisors (m + 1))
  in
    n >= 2 && noDivisors 2
    ;;
    
print_bool isPrime 7;;

31 days 13 hours ago view (lines: 8, size: 160, inputs: 1) Ocaml Compilation error

1
2
3
4
5
6
7
8
let isPrime n =
  let rec noDivisors m =
    m * m > n || (n mod m != 0 && noDivisors (m + 1))
  in
    n >= 2 && noDivisors
    ;;
    
print_bool isPrime 7;;

31 days 13 hours ago view (lines: 1, size: 0, inputs: 1) Ocaml Success

page: 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40

1 2 3 4 5 6 7 8	let rec reverse l = match l with [] -> [] \| h::t -> ((reverse t) @ [h]) ;;
...

1 2 3 4 5 6 7 8 9	let size l = let rec counter l pos = match l with [] -> pos \| h::t -> counter t (pos+1) in counter l 0 ;;
...

1 2 3 4 5 6 7 8 9	let get_kth l k = List.nth l k;; let rec get_kth_2 l k = match l with [] -> "err" \| h::t -> if k=0 then h else get_kth_2 t (k-1) ;; ( test )
...

1 2 3 4 5 6 7 8 9	let get_kth k = List.nth l k;; let rec get_kth_2 l k = match l with [] -> "err" \| h::t -> if k=0 then h else get_kth_2 t (k-1) ;; ( test )
...

1 2 3 4 5 6 7 8 9	exception Short_list;; let my_last l = ( List.nth l ((List.length l) -2 ) );; let rec my_last_2 l = match l with [] -> raise Short_list \| h::[] -> raise Short_list \| h::h2::[] -> h
...

1 2 3 4 5 6 7 8 9	exception Empty_list;; let my_last l = ( List.nth l ((List.length l) -1 ) );; let rec my_last_2 l = match l with [] -> raise Empty_list \| h::[] -> h \| h::t -> my_last_2 t
...

1 2 3 4 5 6 7 8 9	let isPrime n = let rec noDivisors m = m * m > n \|\| (n mod m != 0 && noDivisors (m + 1)) in n >= 2 && noDivisors 2 ;; let is = isPrime 8 in
...

UsernamePassword

Username
Password