Submission #1454518

---

Source Code Expand

module IntMap = Map.Make (struct
  type t = int
  let compare = compare
end)

let rec foldn f init = function
  | 0 -> init
  | n -> foldn f (f init) (n - 1)

let rec gcd n m =
  if m = 0 then n
  else gcd m (n mod m)

let () =
  let n, d = Scanf.scanf "%d %d" (fun n d -> n, d) in
  foldn (fun m ->
    IntMap.fold (fun n p m ->
      List.fold_left (fun m d ->
        let n' = n / gcd n d in
        IntMap.add n'
          (p /. 6. +.
           try IntMap.find n' m with Not_found -> 0.) m) m [1; 2; 3; 4; 5; 6]) m IntMap.empty) (IntMap.singleton d 1.) n
  |> (fun m -> try IntMap.find 1 m with Not_found -> 0.)
  |> Printf.printf "%f\n"

Submission Info

Judge Result