Language detail: OCaml

Coverage: 64.29%
number of '+' ratings
contribution for coverage

Unsolved challenges

codes

Feed

Used modules

next >>

タブ区切りデータの処理 (Nested Flatten)
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
let succ_str s =
  try (string_of_int (int_of_string s + 1))
  with Failure _ -> s

let read scanbuf f =
  let t = "\t"  and nl = "\n"  in
  Scanf.bscanf scanbuf "%[^\t]\t%[^\t]\t%[^\t]\t%[^\n]%c"
  (fun a b c d _ -> f [a;t;c;t;b;t; succ_str d; nl])  

let f ch =
  let accu = ref [] in
  try
    read ch (List.iter print_string);
    while true do
      (read ch (fun l -> accu := l::!accu))
    done;
  with End_of_file ->
    let l = List.stable_sort (fun a b ->
      compare (List.hd a) (List.hd b)) !accu
    in List.iter (List.iter print_string) l;;
(*  
let s = "\
ID\tSurname\tForename\tAge
1\tSato\tHanako\t17
0\tSuzuki\tTaro\t18
"
let (path,o) = 
  Filename.open_temp_file "doukaku209_" ".txt";;
output_string o s;  close_out o;;

let sbuf = Scanf.Scanning.from_file path in (f sbuf);;
*)
起動オプションの解析 (Nested Flatten)

資料としてArg版も。3,5,7には非対応です。

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
let switch t = if t then "ON" else "OFF"

let cmdopt arr = 
  let o = ref false 
  and q = ref false
  and d = ref "-"
  and args = Queue.create () in

  Arg.parse_argv ~current:(ref 0) arr
    [ "-o", Arg.Set o, "";
      "-q", Arg.Set q, "";
      "-d", Arg.Symbol (["0";"1";"2";], fun s -> d:=s),"";] 
    (fun anon -> Queue.push anon args) "";

  if not !o then raise Exit ;

  let len = Queue.length args in

  Printf.printf "\
    [オプション情報]\n\
    o(output): %s\n\
    q(quote): %s\n\
    d(debug): %s\n\
    \n[パラメータ情報]\n指定数:%d \n"
    (switch !o) (switch !q) !d len;

  for i = 1 to len do 
    Printf.printf "%2d : %s \n" i (Queue.pop args);
  done;;

(* cmdopt [| "prog_name"; "-q"; "-o"; "aa"; "bb"|];; *)
LL Golf Hole 8 - 横向きのピラミッドを作る (Nested Flatten)
1
2
3
4
let pyramid n = 
  for i = 1 to n*2 do
    print_endline (String.make (if i<n then i else n*2-i) '*');
  done;;
起動オプションの解析 (Nested Flatten)
OCamlはまだ文字コードがeuc-jpでないと日本語がコンパイルできません。
それと、実行結果が文字化けしたらコンソールをeucで起動してください。
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
(* lv -Oej xx.ml > xx-ej.ml  euc-jpでない場合の変換
   xterm -en euc-jp & 
   ocaml -I +extlib extLib.cma xx-ej.ml
*)(*
  スクリプト用途時
  #!/usr/bin/env ocaml
  #directory "+extlib";;
  #load "extLib.cma";;
*)

let get = OptParse.Opt.get
let opt = OptParse.Opt.opt
let switch t = if t then "ON" else "OFF"
let debug = function
  | Some (0 | 1 | 2 as n) -> string_of_int n
  | _ -> "-";;

let t = OptParse.OptParser.make ~usage:
  "cmdopt -o [-q] [-d{0|1|2}] 文字列 [文字列 ...]" ()
and o = OptParse.StdOpt.store_true () 
and q = OptParse.StdOpt.store_true () 
and d = OptParse.StdOpt.int_option ();;
OptParse.OptParser.add ~short_name:'o' t o;
OptParse.OptParser.add ~short_name:'q' t q;
OptParse.OptParser.add ~short_name:'d' t d;;

let opts_form = format_of_string "\
  [オプション情報] \n\
  o(output) : %s \n\
  q(quote) : %s \n\
  d(debug) : %2s \n\n"

let opts_info () =
  if not (get o) then 
    (print_string "-o オプションがありません。\n"; exit 0) 
  else
    Printf.printf opts_form
     (switch (get o)) (switch (get q)) (debug (opt d))

let params_info l = 
  Printf.printf 
    "[パラメータ情報]\n指定数 : %d \n" (List.length l);
  ExtList.List.iteri (fun i s ->
    Printf.printf "%d : %s \n" (i+1) s) l;;

let _ = 
  if !Sys.interactive then () else
  let rest = OptParse.OptParser.parse_argv t in
  (opts_info (); params_info rest);;
文字列型日時ののN秒後時間取得 (Nested Flatten)
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
#load "unix.cma";;

let scan_time s =
  Scanf.sscanf s "%4d%2d%2d%2d%2d%2d" (fun year mon day h m s ->
    { Unix.tm_sec = s;  tm_min = m;  tm_hour = h;
      tm_mday = day;  tm_mon = mon;  tm_year = year-1900;
      tm_wday = 0;  tm_yday = 0;  tm_isdst = false
    } ) ;;

let print_time { 
  tm_year = yy; tm_mon = mm; tm_mday = dd;
  tm_hour = h; tm_min = m; Unix.tm_sec = s } =
  Printf.printf "%d%02d%02d%02d%02d%02d" (yy+1900) mm dd h m s;;
  
let date_ex s sec =
  let {Unix.tm_sec = tsec} as tm = scan_time s in
  print_time (snd (Unix.mktime {tm with Unix.tm_sec=tsec+sec}));;

(* date_ex "20080827235925" 40;; *)
LL Golf Hole 7 - バイト数を読みやすくする (Nested Flatten)

OCamlで。

値は引数文字列, 1k = 1000, 小数点は 1 桁まで, 切捨てです。

短くして 247 bytes でした

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
let foo n =
  let u = " kMGT" in
  let l = String.length n in
  let idx = if (l mod 3) == 0 then (l / 3) - 1 else (l / 3) in
    Printf.printf "%s%s %cbytes\n"
      (String.sub n 0 (l - (idx * 3)))
      (if l > 3 then "." ^ (String.sub n (l-(idx*3)) 1) else "")
      u.[idx]
;;

(*
短く
let f n = let u = " kMGT" in let l = String.length n in let x = if (l mod 3) == 0 then (l / 3) - 1 else (l / 3) in Printf.printf "%s%s %cbytes\n" (String.sub n 0 (l - (x * 3))) (if l > 3 then "."^(String.sub n (l-(x*3)) 1) else "") u.[x];;
*)

foo "76543210";;
LL Golf Hole 8 - 横向きのピラミッドを作る (Nested Flatten)

OCaml で

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
let foo n =
  let s = String.make n '*' in
  let rec bar x =
    if x > n then ()
    else (
      print_string ((String.sub s 0 (n-(abs(x))))^"\n");
      bar (x + 1);
    )
  in
    bar (0 - n)
;;

foo 4;;
必ず解ける迷路 (Nested Flatten)

osiireさんからブログ経由でアドバイスを頂いたのを皮切りに、色々無駄な処理が気になってきたので再度修正した自己満足第三弾。Array.iter等を使うように、などなど。

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
type field = Space | Wall

let x = int_of_string (Sys.argv.(1))
let y = int_of_string (Sys.argv.(2))

let rec repeate f x i n =
  if i < n then repeate f (f i x) (i + 1) n else x

let make_line v = Array.make (x * 2 - 1) v

let make_empty_line () = make_line Space

let make_filled_line () = make_line Wall

let print_line line =
  print_string "■";
  Array.iter (
    fun a -> if a = Wall then print_string "■" else print_string " "
  ) line;
  print_endline "■"

type mode = Top | Normal

let make_maze mode lines =
  let way = match mode with Top -> 4 | Normal -> 3 in
  let rec make_wall pos =
    let (y, x) =
      match (Random.int way) with
      | 0 -> (1, pos + 1)
      | 1 -> (2, pos)
      | 2 -> (1, pos - 1)
      | 3 -> (0, pos)
      | _ -> failwith "invalid value" in
    if lines.(y).(x) = Wall
      then make_wall pos
      else (
        lines.(1).(pos) <- Wall;
        lines.(y).(x) <- Wall
      ) in
  Array.iteri (fun i a -> if i mod 2 = 1 then make_wall i) lines.(0)

let main () =
  let _ = Random.init (int_of_float (Unix.time ())) in
  let draw_maze pos last_line =
    let lines = [|last_line; make_empty_line (); make_empty_line ()|] in
    make_maze (if pos = 0 then Top else Normal) lines;
    print_line lines.(0);
    print_line lines.(1);
    lines.(2) in
  let filled_line = make_filled_line () in
  print_line filled_line;
  print_line (repeate draw_maze (make_empty_line ()) 0 y);
  print_line filled_line

let _ = main ()

壁かどうかはヴァリアントにすべきでした… 自己満足ですが修正版を。

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
type field = Space | Wall

let x = int_of_string (Sys.argv.(1))
let y = int_of_string (Sys.argv.(2))

let line_loop line func =
  let rec loop pos =
    if pos < x * 2 - 1 then (
      func line pos;
      loop (pos + 1)
    ) in
  loop 0

let make_line v = Array.make (x * 2 - 1) v

let make_empty_line () = make_line Space

let make_filled_line () = make_line Wall

let make_checked_line () =
  let line = make_empty_line () in
  line_loop line (
    fun l p -> if (p mod 2) = 1 then l.(p) <- Wall
  );
  line

let print_line line =
  print_string "■";
  line_loop line (
    fun l p -> if l.(p) = Wall then print_string "■" else print_string " "
  );
  print_endline "■"

_build  maze.ml
type mode = Top | Normal

let make_maze mode lines =
  let way = match mode with Top -> 4 | Normal -> 3 in
  let rec make_wall pos =
    let (y, x) =
      match (Random.int way) with
      | 0 -> (1, pos + 1)
      | 1 -> (2, pos)
      | 2 -> (1, pos - 1)
      | 3 -> (0, pos)
      | _ -> failwith "invalid value" in
    if lines.(y).(x) = Wall then make_wall pos else lines.(y).(x) <- Wall in
  let rec loop pos =
    if pos < x * 2 - 1 then (
      if pos mod 2 = 1 then make_wall pos; loop (pos + 1)
    ) in
  loop 0

let main () =
  let _ = Random.init (int_of_float (Unix.time ())) in
  let filled_line = make_filled_line () in
  print_line filled_line;
  let rec loop cnt last_line =
    if cnt < y
      then (
        let lines = [|last_line; make_checked_line (); make_empty_line ()|] in
        make_maze (if cnt = 0 then Top else Normal) lines;
        print_line lines.(0);
        print_line lines.(1);
        loop (cnt + 1) lines.(2)
      )
      else print_line last_line in
  loop 0 (make_empty_line ());
  print_line filled_line

let _ = main ()
前々から気になっていたので今更ながら挑戦してみました。棒倒し法です。


OS, マシンスペックは以下の通り。
OS: FreeBSD 7.0-STABLE
CPU: Celeron 500MHz
Mem: 320MB
…orz


バイトコードとネイティブコードを作成して性能を比べてみました。

mitsu@garlic$ ocamlfind c -package unix -linkpkg -o maze.byte maze.ml
mitsu@garlic$ ocamlfind opt -package unix -linkpkg -o maze.native maze.ml

mitsu@garlic$ time ./maze.byte 1024 1024 > /dev/null

real    0m15.978s
user    0m15.583s
sys     0m0.132s
mitsu@garlic$ time ./maze.native 1024 1024 > /dev/null

real    0m2.443s
user    0m2.367s
sys     0m0.037s
mitsu@garlic$

ネイティブコードはさすがに早いなぁ、と思いました。

あと、このマシンスペックで3秒を切っているので、まぁ良いかな、と。

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
let x = int_of_string (Sys.argv.(1))
let y = int_of_string (Sys.argv.(2))

let line_loop line func =
  let rec loop pos =
    if pos < x * 2 - 1 then (
      func line pos;
      loop (pos + 1)
    ) in
  loop 0

let make_line v = Array.make (x * 2 - 1) v

let make_empty_line () = make_line 0

let make_filled_line () = make_line 1

let make_checked_line () =
  let line = make_empty_line () in
  line_loop line (
    fun l p -> if (p mod 2) = 1 then l.(p) <- 1
  );
  line

let print_line line =
  print_string "■";
  line_loop line (
    fun l p -> if l.(p) = 1 then print_string "■" else print_string " "
  );
  print_endline "■"

type mode = Top | Normal

let make_maze mode lines =
  let way = match mode with Top -> 4 | Normal -> 3 in
  let rec make_wall pos =
    let (y, x) =
      match (Random.int way) with
      | 0 -> (1, pos + 1)
      | 1 -> (2, pos)
      | 2 -> (1, pos - 1)
      | 3 -> (0, pos)
      | _ -> failwith "invalid value" in
    if lines.(y).(x) = 1 then make_wall pos else lines.(y).(x) <- 1 in
  let rec loop pos =
    if pos < x * 2 - 1 then (
      if pos mod 2 = 1 then make_wall pos; loop (pos + 1)
    ) in
  loop 0

let main () =
  let _ = Random.init (int_of_float (Unix.time ())) in
  let filled_line = make_filled_line () in
  print_line filled_line;
  let rec loop cnt last_line =
    if cnt < y
      then (
        let lines = [|last_line; make_checked_line (); make_empty_line ()|] in
        make_maze (if cnt = 0 then Top else Normal) lines;
        print_line lines.(0);
        print_line lines.(1);
        loop (cnt + 1) lines.(2)
      )
      else print_line last_line in
  loop 0 (make_empty_line ());
  print_line filled_line

let _ = main ()
LL Golf Hole 7 - バイト数を読みやすくする (Nested Flatten)

移植しました。

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
#load "nums.cma";;
open Num
let conv =
  let base = (Int 1024) in
  let rec sub byte k bound = function
    | [] -> raise (Invalid_argument "over")
    | hd::tl -> 
        if byte </ bound then
          Printf.sprintf "%.1f%s" (float_of_num (byte // k)) hd
        else
          sub byte (k */ base) (bound */ base) tl
  in
    fun byte -> sub byte (Int 1) base ["b"; "k"; "M"; "G";"T"]
  ;;
(*
  conv (Int 1024);;
  conv (Big_int (Big_int.big_int_of_string "10000000000"));; 
*)
LL Golf Hole 6 - 10進数を2進数に基数変換する (Nested Flatten)
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
let rec f acc i =
  let a,i = ((if i land 1 = 1 then "1" else "0") :: acc), (i lsr 1) in
  if i = 0 then String.concat "" a else f a i
in f [] (int_of_string Sys.argv.(1));;


(* 先にstringを作っておいたほうが速くなります。*)
let bin_of_int i =
  let res = String.create (Sys.word_size-1) in
  let rec loop pos i =
    res.[pos] <- if i land 1 = 1 then '1' else '0';
    let i = i lsr 1 in 
    if 0 = i then String.sub res pos (Sys.word_size - 1 - pos)
    else loop (pos - 1) i
  in loop (Sys.word_size-2) i;;
LL Golf Hole 2 - 文字列に含まれる単語の最初の文字を大文字にする (Nested Flatten)

標準ライブラリ内でがんばる。

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
(fun s->String.iter(fun c->try let rec l p=s.[p]<-Char.uppercase s.[p];
l(String.index_from s p c+1)in l 0with _->())" \t\n\r\012\011";s)
"LL day and night";;

(fun s->for i=0to 5do try let rec l p=s.[p]<-Char.uppercase s.[p];
l(String.index_from s p" \t\n\r\012\011".[i]+1)in l 0with _->()done;s)
"LL future";;

#load "str.cma";;
open Str;;
global_substitute(regexp"[A-Za-z0-9][A-Za-z0-9]*") 
(fun s->String.capitalize(matched_string s))
"LL day and night";;

#load "str.cma";;
(fun s->String.concat" "(List.map String.capitalize
(Str.split (Str.regexp"[ \t\n\r\012\011]")s)))
"LL future";;
LL Golf Hole 5 - 最上位の桁を数え上げる (Nested Flatten)
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
(* 例解の *)
#load "nums.cma";;
open Num
let f = 
  let rec loop n m =
    let s = string_of_num m in print_endline s;
    if n<>m then loop n (m +/ (power_num (Int 10) (Int (String.length s - 1))))
  in 
    fun n -> loop (Int n) (Int 0);; 
(* f 300;; *)

(* 正規表現の *)
#load "str.cma";;
let f =
  let reg = Str.regexp "^[0-9]?0*$" in
  fun n -> Str.string_match reg (string_of_int n) 0;;
(* for i = 0 to 300 do (if f i then Printf.printf "%d\n" i) done;; *)

(* 自力の *)
let f n = 
  let rec loop next diff b = 
    if n<b then () else
    if next>b then (Printf.printf "%d\n" b; loop next diff (diff + b)) else
    loop (next*10) next b
  in loop 10 1 0;;
LL Golf Hole 6 - 10進数を2進数に基数変換する (Nested Flatten)

割り算を使わずに作ってみました。

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
let _ =
    let rec loop input result sr =
        let i = input lsr sr in
        if i = 0 then
            result
        else begin
            let result = (string_of_int (i land 1)) ^ result in
            loop input result (sr + 1);
        end;
    in

    let input = int_of_string (Sys.argv.(1)) in
    if input = 0 then
        print_endline "0"
    else
        print_endline (loop input "" 0);
;;
echoクライアント (Nested Flatten)

ocamlfind c -package unix -linkpkg -o echoc echoc.ml

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
open Unix

let conn host port =
  let hostent = gethostbyname host in
  open_connection (ADDR_INET(hostent.h_addr_list.(0), port))

let main () =
  let (ich, och) = conn Sys.argv.(1) (int_of_string Sys.argv.(2)) in
  let rec loop () =
    let str = read_line () in
    Printf.fprintf och "%s\r\n" str; flush och;
    print_endline (input_line ich);
    loop () in
  loop ()

let _ = main ()
環境変数の取得 (Nested Flatten)
キーから値を得るにはSys.getenvを使う。
環境変数を全部取得するにはUnix.environmentを使う。
ちょっと紛らわしいけど、Unix.environmentはWindowsやcygwin環境でも使える。
以下のコードをコンパイルするには
$ ocamlc unix.cma hogehoge.ml
または
$ ocamlopt unix.cmxa hogehoge.ml
のようにunix.cma,unix.cmxaも一緒にコンパイルする必要がある。
1
2
3
4
5
(* show path *)
let v = Sys.getenv "PATH" in print_string v;;

(* show all enviroments *)
let e = Unix.environment () in Array.iter (Printf.printf "%s\n") e;;
Hello, world! (Nested Flatten)
1
2
3
4
5
6
7
8
9
print_endline (Obj.magic
  [|6.5188685003647886e+265; 4.77846189372792702e-299|]:string);;

(* open Obj;;
let of_string (s:string) =
  let t = dup (repr s) in
  set_tag t double_array_tag;
  (obj t:float array);;
*)
指定されたフォルダ以下のゴミ掃除 (Nested Flatten)
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#load "unix.cma";;

let dir_fold f acc path =
  let dir = Unix.opendir path in
  let acc = ref acc in
  try 
    while true do
      match Unix.readdir dir with
      | "." | ".." -> ()
      |  s  -> acc := f !acc (Filename.concat path s)
    done; assert false
  with err -> Unix.closedir dir;
    if err=End_of_file then !acc else (raise err);;

let dir_iter_rec =
  let file_iter f path =
    dir_fold (fun acc s ->
      match (Unix.stat s).Unix.st_kind with
      | Unix.S_DIR -> (s::acc)
      | _ -> f s; acc
      ) [] path in
  let rec iter_rec f ls =
    List.iter (fun path -> iter_rec f (file_iter f path)) ls
  in 
    (fun f path -> iter_rec f (file_iter f path));;

let rmbak path =
  dir_iter_rec (fun s -> 
    if Filename.check_suffix s "~" then Unix.unlink s
    ) path;;