challenge ビンゴの結果を整形表示

重複無し乱数」の続編です。

「重複無し乱数」で作ったbingo関数の結果を下のように「何番目の乱数か」とセットにして10個ずつ折り返して表示するコードを書いてください。

>>> bingo(30)
  1  2  3  4  5  6  7  8  9 10
 29 14 16 13 30 15 22 11 25  9

 11 12 13 14 15 16 17 18 19 20
 23  4 18  5 28 17  8 12 21 20

 21 22 23 24 25 26 27 28 29 30
 26  6  2 19  1  7 10 27  3 24

>>> bingo(35)
  1  2  3  4  5  6  7  8  9 10
  7 15  3 32  1 16 17 28  6 29

 11 12 13 14 15 16 17 18 19 20
 19 23 30 26 20  5 12  2 25 31

 21 22 23 24 25 26 27 28 29 30
 35 13 24 18 11  8 10 34 22 21

 31 32 33 34 35
  9  4 27 33 14

Posted feedbacks - OCaml


	
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
#light
let rec bingo n = shuffle [1..n]
and  shuffle ls =
    let rnd = new System.Random()
    List.sort (fun x y-> rnd.Next(-1,2)) ls

let printLine ln n =
    let rec len (m:int) = ( m.ToString() ).Length
    and mk (m:int) = (String.make ((len n) - (len m)) ' ') ^ m.ToString()
    and (|SplitAt|) m xs = List.partition (fun (x,i) -> i <= m) xs
    and mkLns c = function
        | [] -> []
        | SplitAt c (head,tail) -> (List.unzip head)::mkLns (c+ln) tail
    and concatMap f xs = String.concat " " <| List.map f xs
    and bs = mkLns ln (List.zip (bingo n) [1..n])
    [for (xs,ids) in bs -> (concatMap mk xs) ^ "\n" ^ (concatMap mk ids)]
    |> String.concat "\n"
    |> printf "%s\n"

let bingoPr = fun n -> printLine 10 n

Index

Feed

Other

Link

Pathtraq

loading...