1
2
3
4
5
6
while true do
 let n = read_int () in
 if n = 42 then exit 0;
 print_int n;
 print_newline ()
done;;

1
2
3
4
5
6
while true do
 let n = read_int () in
 if n = 42 then exit 0;
 print_int n;
 print_newline ()
done;;

1
2
3
4
5
6
7
8
datatype 'a List = ListNode of 'a * 'a List | Empty
exception EmptyList
 
fun getItem (ListNode (i,_)) = i
  | getItem (Empty) = raise EmptyList
 
fun nextNode (ListNode(_,rest)) = rest
  | nextNode (Empty) = raise EmptyList

1
2
3
4
5
6
7
8
9
let yg x y z=moveto x y;
set_color black;
fill_circle x y z;
set_color white;
fill_rect x (y-z) (2*z) (2*z);
fill_circle x (y+z/2) (z/2);
set_color black;
fill_circle x (y-z/2) (z/2);
draw_circle x y z;
 ...

1
2
3
4
let rec member x s = match s with
[]->false
|hd::tl when hd=x ->true
|hd::tl -> member x tl;;

1
2
3
4
5
6
7
8
9
exception Undefined
;;
type direction = R | L 
;; 
type stat = T | F
;;
type tape = {
   data : int array ;
   pos  : int ;
 ...

1
2
3
4
5
6
7
8
9
 
  
        let rec sqrthelp n half = 
          if ((half*half) > n) then sqrthelp n (half / 2)
                  else if ((half*half) = n) then half
                  else sqrthelp n (3 * half / 2);;
                  
 let my_sqrt n:int =
  let half = (n/2) in
 ...

1
2
3
4
5
6
7
8
9
 
  
        let rec sqrthelp n half = 
          if ((half*half) > n) then sqrthelp n (half / 2)
                  else if ((half*half) = n) then half
                  else sqrthelp n (3 * half / 2);;
                  
 let my_sqrt n:int =
  let half = (n/2) in
 ...

1
2
3
4
5
6
7
8
9
open Printf
 
module type CCC = sig
  type point
  val ccw : point -> point -> point -> bool
  val in_circle : point -> point -> point -> point -> bool
end
 
module type Triangulation = sig
 ...

1
2
3
4
5
6
7
8
9
 
  type 'a fifo = 'a list * 'a list
  let empty = [], []
  let push ~fifo:(input,output) ~item = (item::input,output)
  let is_empty ~fifo =
    match fifo with
    | [], [] -> true
    | _ -> false
  let rec pop ~fifo =
 ...

1
2
3
4
5
6
7
8
9
 
  type 'a fifo = 'a list * 'a list
  let empty = [], []
  let push ~fifo:(input,output) ~item = (item::input,output)
  let is_empty ~fifo =
    match fifo with
    | [], [] -> true
    | _ -> false
  let rec pop ~fifo =
 ...

1
2
3
4
5
6
7
8
9
module FIFO : sig
  type 'a fifo
  val empty: 'a fifo
  val push: fifo:'a fifo -> item:'a -> 'a fifo
  val pop: fifo:'a fifo -> 'a * 'a fifo
  val is_empty: fifo:'a fifo -> bool
end = struct
  type 'a fifo = 'a list * 'a list
  let empty = [], []
 ...

1
2
3
4
5
6
7
8
9
  type 'a fifo
  val empty: 'a fifo
  val push: fifo:'a fifo -> item:'a -> 'a fifo
  val pop: fifo:'a fifo -> 'a * 'a fifo
  val is_empty: fifo:'a fifo -> bool
end = struct
  type 'a fifo = 'a list * 'a list
  let empty = [], []
  let push ~fifo:(input,output) ~item = (item::input,output)
 ...

1
2
3
4
5
6
7
8
9
module FIFO : sig
  type 'a fifo
  val empty: 'a fifo
  val push: fifo:'a fifo -> item:'a -> 'a fifo
  val pop: fifo:'a fifo -> 'a * 'a fifo
  val is_empty: fifo:'a fifo -> bool
end = struct
  type 'a fifo = 'a list * 'a list
  let empty = [], []
 ...

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...

1
2
3
4
5
open Arg;;
open Sys;;
 
let matriz = read_line();;
printf "valor da var e %s" matriz;;

1
2
3
4
5
open Arg;;
open Sys;;
 
let matriz = read_line();
printf "valor da var e %s" matriz;

1
2
3
4
5
open Arg;;
open Sys;;
 
let matriz = read_string();
printf "valor da var e %s" matriz;

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...

1
2
3
4
5
6
7
8
9
 
let compare x range =
        (if (fst range)+1 < x then 1 else 0), (if (snd range)+1 < x then 1 else 0)
 
let insert range xs =
        let rec impl range xs ret =
                if xs = [] then (range::ret) else
                        let head = List.hd xs in
                        let tail = List.tl xs in
 ...