zachlanne, Ocaml - rextester

Language: Layout:

(* Zadanie 4 *)
let rec print_list = function 
[] -> ()
| e::l -> print_int e ; print_string " " ; print_list l

let silnie n =
    let n = ref n in
    let lst = ref [(1,1)] in (* lista postaci [(x,x!),(x-1,x-1!)...] *)
    while snd (List.hd !lst) < !n do
        let (x,y) = List.hd !lst in
        lst := (x+1,y*(x+1)) :: !lst;
    done;
    let res = ref [] in
    while !n <> 0 && !lst <> [] do
        let (x,y) = List.hd !lst in
        if y <= !n then begin
            res := x :: !res;
            n := !n - y;
        end else begin
            lst := List.tl !lst
        end;
    done;
    !res;;

print_list (silnie 44);;

(* Zadanie 5 *)

(*
((())))(()()
  /\
 /  \
/    \  /\/\
      \/
*)

type nawias = Otwierajacy | Zamykajacy;;
let zamien = function Otwierajacy -> 1 | Zamykajacy -> (-1);;

let nawiasy lst =
    let n = List.length lst in
    if n mod 2 = 1 then -1 else 
    let arr = Array.of_list (List.map zamien lst) in
    let sum = Array.fold_left (+) 0 arr in
    let wynik = ref 0 in
    if sum < 0 then (* wiecej zamykajacych *)
        let k = ref ((-sum) / 2) in
        wynik := !k;
        for i = 0 to (n-1) do begin
            if arr.(i) = -1 && !k > 0 then begin
                arr.(i) <- 1;
                k := !k - 1;
            end;
        end done;
    if sum > 0 then (* wiecej otwierajacych*)
        let k = ref (sum / 2) in begin
        wynik := !k;
        for i = 0 to n-1 do
            if arr.(i) = 1 && !k > 0 then begin 
                arr.(i) <- (-1);
                k := !k - 1;
            end;
        done;
    end;
    let h = ref 0 in
    let _ = Array.fold_left (fun acc x -> (if (acc+x) < !h then h := (acc+x)); acc+x) 0 arr in
    wynik := !wynik + (2 * !h);
    !wynik;;

Show compiler warnings [ + ] Show input
Compilation time: 0.14 sec, absolute service time: 0,38 sec