{"type":"rich","provider_name":"Hatena Blog","author_name":"jeneshicc","height":"190","description":"http://projecteuler.net/index.php?section=problems&id=157 150\u756a\u3042\u305f\u308a\u306e\u554f\u984c\u306b\u3057\u3066\u306f\u7c21\u5358\u3002 import Control.Monad import Number import Data.List divisor100 n = [2^x*5^y | x <-[0..2*n], y <- [0..2*n]] primitiveSolutions n = filter (uncurry (<=)) [(div (m^2) d + m, m + d) | d <- divisor100 n] where m = 10^n solutions \u2026","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","version":"1.0","author_url":"https://blog.hatena.ne.jp/jeneshicc/","width":"100%","published":"2008-12-24 23:58:38","categories":["Project Euler","Haskell"],"blog_url":"https://jeneshicc.hatenadiary.org/","title":"Problem 157","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081224%2F1230130718\" title=\"Problem 157 - \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>","url":"https://jeneshicc.hatenadiary.org/entry/20081224/1230130718","provider_url":"https://hatena.blog","image_url":null}