{"provider_url":"https://hatena.blog","blog_url":"https://jeneshicc.hatenadiary.org/","width":"100%","type":"rich","version":"1.0","url":"https://jeneshicc.hatenadiary.org/entry/20081213/1229181702","categories":["Project Euler","Haskell"],"height":"190","title":"Problem 148","image_url":null,"blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","author_name":"jeneshicc","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081213%2F1229181702\" title=\"Problem 148 - \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>","provider_name":"Hatena Blog","description":"http://projecteuler.net/index.php?section=problems&id=148 \u89b3\u5bdf\u304b\u3089\u3001\u898f\u5247\u6027\u3092\u307f\u3064\u3051\uff08\u8a3c\u660e\u306f\u3057\u3066\u3044\u306a\u3044\u304c\u3001\u7d0d\u5f97\u3067\u304d\u308b\u898f\u5247\u6027\u306a\u306e\u3067\u3088\u3057\u3068\u3059\u308b\uff09\u3001\u305d\u308c\u3092\u5229\u7528\u3002 \u8981\u3059\u308b\u306b7\u9032\u6570\u5c55\u958b\u3057\u3066\u3001\u3054\u306b\u3087\u3054\u306b\u3087\u3063\u3068\u3059\u308b\u3068\u7b54\u3048\u304c\u51fa\u3066\u304f\u308b\u3002 import Data.List toSepta =reverse. unfoldr f where f 0 = Nothing f n =let (q,r) = divMod n 7 in Just(r,q) decode = fst. foldl f (0,1) where f (x,p) y = (28*x + p*\u2026","author_url":"https://blog.hatena.ne.jp/jeneshicc/","published":"2008-12-13 00:21:42"}