{"url":"https://jeneshicc.hatenadiary.org/entry/20081225/1230196153","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081225%2F1230196153\" title=\"Problem 159 - \u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","author_url":"https://blog.hatena.ne.jp/jeneshicc/","version":"1.0","title":"Problem 159","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","image_url":null,"categories":["Project Euler","Haskell"],"author_name":"jeneshicc","type":"rich","width":"100%","provider_name":"Hatena Blog","description":"http://projecteuler.net/index.php?section=problems&id=159 mdrs(n) = max_{m*d=n}(mdrs(m) + mdrs(d)) \u307e\u3041\u3001\u6210\u308a\u7acb\u3064\u3067\u3057\u3087\u3002 import Control.Monad import Data.Array.IO lim = 10^6 main = do drs <- newListArray (2,lim-1).tail.cycle$[1..9] :: IO (IOUArray Int Int) let update n dn = forM_ [2..div (lim-1) n] $ \\m -> do\u2026","provider_url":"https://hatena.blog","published":"2008-12-25 18:09:13","height":"190","blog_url":"https://jeneshicc.hatenadiary.org/"}