inamori https://blog.hatena.ne.jp/inamori/ inamori’s diary https://inamori.hateblo.jp/ Haskell Problem 65 http://projecteuler.net/index.php?section=problems&id=65 連分数の計算法を適用する。最初に1を付加すると計算しやすい。 digits 0 = [] digits n = (mod n 10):(digits (div n 10)) a = 2:1:2:1:[ if n == 1 then 1 else n + 2 | n <- tail a ] p = 1:(head a):[ a1 * p1 + p0 | (a1, p0, p1) <- zip3 (tail a) p (tail p) ] main = print… 190 <iframe src="https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20100227%2Fp1" title="Project Euler 65,66 - inamori’s diary" class="embed-card embed-blogcard" scrolling="no" frameborder="0" style="display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;"></iframe> Hatena Blog https://hatena.blog 2010-02-27 00:00:01 rich https://inamori.hateblo.jp/entry/20100227/p1 1.0 100%