{"provider_url":"https://hatena.blog","url":"https://inamori.hateblo.jp/entry/20100314/p2","height":"190","blog_title":"inamori\u2019s diary","published":"2010-03-14 00:00:01","image_url":null,"description":"http://projecteuler.net/index.php?section=problems&id=80 \u6614\u7fd2\u3063\u305f\u5e73\u65b9\u6839\u30921\u6841\u305a\u3064\u6c42\u3081\u308b\u8a08\u7b97\u6cd5\u3092\u30b7\u30df\u30e5\u30ec\u30fc\u30c8\u3059\u308b\u3002 square_root\u306f\u5e73\u65b9\u6839\u306e\u7cbe\u5ea6\u304c1\u6841\u305a\u3064\u3088\u304f\u306a\u308b\u30ea\u30b9\u30c8\u3002\u4f8b\u3048\u3070\u3001 square_root = [1, 14, 141, 1414, 14142, \u2026] \u305d\u306e\u4e2d\u306ea\u306f\u3001\u4f59\u308a\u3068\u7b54\u3048\u306e\u30bf\u30d7\u30eb\u306e\u30ea\u30b9\u30c8\u3002 digits 0 = [] digits n = (digits (div n 10)) ++ [mod n 10] square_root n = map snd (tail a) where a = (n, 0):[ ne\u2026","author_name":"inamori","title":"Project Euler 80","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20100314%2Fp2\" title=\"Project Euler 80 - inamori\u2019s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","type":"rich","width":"100%","provider_name":"Hatena Blog","blog_url":"https://inamori.hateblo.jp/","categories":["Haskell"],"version":"1.0","author_url":"https://blog.hatena.ne.jp/inamori/"}