Scanf.scanf "%d" (fun n -> let module S = Set.Make (struct type t = int let compare = compare end) in let calc_cost s limit = let len = String.length s in let pos = Array.make 26 S.empty in let arena = Array.make len 0 in String.iteri (fun i c -> let a = int_of_char c - 97 in pos.(a) <- S.add i pos.(a); arena.(i) <- a) s; let rec loop i cur count = if i = len then count else if count = limit then count else if arena.(i) = cur then let () = pos.(cur) <- S.remove i pos.(cur) in loop (i + 1) cur count else if S.is_empty pos.(cur) then loop i (cur + 1) count else let mp = S.min_elt pos.(cur) in let () = let q = arena.(i) in pos.(cur) <- S.remove mp pos.(cur); pos.(q) <- S.add mp (S.remove i pos.(q)); arena.(i) <- cur; arena.(mp) <- q in loop (i + 1) cur (count + 1) in let count = loop 0 0 0 in let count = if limit = max_int then ( if count = 0 then 2 else count ) else ( if (limit - count) mod 2 = 0 then count else ( let c = arena.(len - 1) in arena.(len - 1) <- arena.(len - 2); arena.(len - 2) <- c; limit ) ) in let ret = String.init len (fun i -> char_of_int (97 + arena.(i))) in count, ret in let s = Array.init n (fun _ -> Scanf.scanf " %s" (fun s -> s)) in let k = Array.fold_left (fun acc s -> min acc (fst (calc_cost s max_int))) max_int s in let k = 1 in let s2 = Array.map (fun s -> snd (calc_cost s k)) s in let s3 = Array.copy s2 in Array.sort compare s3; let winner = Array.fold_left (fun acc v -> if v = s3.(0) then acc + 1 else acc) 0 s2 in Array.iter (fun v -> Printf.printf "%d\n" @@ if v = s3.(0) then n + 1 - winner else 0) s2; )