{"author_url":"https://blog.hatena.ne.jp/inamori/","height":"190","description":"Problem 25 http://projecteuler.net/index.php?section=problems&id=25 \u5358\u306b\u6841\u6570\u3092\u6c42\u3081\u308b\u3068\u9045\u3044\u304c\u3001\u6841\u6570\u306f\u6570\u5217\u306e\u524d\u306e\u9805\u306e\u305d\u308c\u3068\u540c\u3058\u304b\u305d\u308c\u3088\u308a1\u5927\u304d\u3044\u304b\u306a\u306e\u3067\u3001\u305d\u308c\u3092\u8003\u616e\u3059\u308b\u3068\u901f\u304f\u306a\u308b\u3002 -- number of digits of n is m or m + 1 num_digits n m = if n fib = 1:1:[ a + b | (a, b) fib_num = (1,1):[ (n, num_digits n m) | (n, (_,m)) a = filter (\\(_,(_,m)) -> m >= 1000) \u2026","image_url":null,"blog_title":"inamori\u2019s diary","version":"1.0","type":"rich","provider_name":"Hatena Blog","title":"Project Euler 25-27","width":"100%","categories":["Haskell"],"author_name":"inamori","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20100202%2Fp1\" title=\"Project Euler 25-27 - 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>","provider_url":"https://hatena.blog","blog_url":"https://inamori.hateblo.jp/","url":"https://inamori.hateblo.jp/entry/20100202/p1","published":"2010-02-02 00:00:01"}