Comment detail

LL Golf Hole 5 - 最上位の桁を数え上げる (Nested Flatten)
1
2
3
count n = takeWhile (<= n) (0:[x*n | n <- [10^n|n<-[0..]], x <- [1..9]])

main = mapM_ print $ count 300

Index

Feed

Other

Link

Pathtraq

loading...