Submission #180149

---

Source Code Expand

let ( |> ) x f = f x

let repeat f = 
  let rec repeat_aux acc = function
    | 0 -> List.rev acc
    | n -> repeat_aux (f () :: acc) (n - 1) in
  repeat_aux []

let rec solve n =
  if n mod 2 = 0 || n mod 3 = 2 then 1 + solve (n - 1)
  else 0

let () = 
  Scanf.scanf "%d\n" (fun n -> n)
    |> repeat (fun () -> Scanf.scanf "%d " (fun n -> n))
    |> List.map solve
    |> List.fold_left ( + ) 0
    |> Printf.printf "%d\n"

Submission Info

Judge Result