{"version":"1.0","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081210%2F1228915093\" title=\"Problem 143 - \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>","image_url":null,"provider_url":"https://hatena.blog","author_name":"jeneshicc","url":"https://jeneshicc.hatenadiary.org/entry/20081210/1228915093","width":"100%","height":"190","published":"2008-12-10 22:18:13","description":"http://projecteuler.net/index.php?section=problems&id=143 \u3084\u3063\u3068\u89e3\u3051\u305f\u3002 import Control.Monad import Data.List import qualified Data.Map as M import qualified Data.IntSet as S eisenstein :: Int -> [(Int,Int)] eisenstein upp = do n <- [1..sqrt' upp -1] m <- [n+1..min (div (upp-n*n) (2*n)).sqrt'$ upp + n^2] \u2026","provider_name":"Hatena Blog","author_url":"https://blog.hatena.ne.jp/jeneshicc/","categories":["Project Euler","Haskell"],"blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","type":"rich","title":"Problem 143","blog_url":"https://jeneshicc.hatenadiary.org/"}