Comment detail

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;;

Index

Feed

Other

Link

Pathtraq

loading...