{"image_url":null,"url":"https://jeneshicc.hatenadiary.org/entry/20090112/1231773373","author_name":"jeneshicc","blog_url":"https://jeneshicc.hatenadiary.org/","width":"100%","author_url":"https://blog.hatena.ne.jp/jeneshicc/","title":"Problem 172","categories":["Project Euler","Haskell"],"provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20090112%2F1231773373\" title=\"Problem 172 - \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>","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","published":"2009-01-12 00:16:13","version":"1.0","type":"rich","description":"http://projecteuler.net/index.php?section=problems&id=172 \u6d41\u308c\u306f\u524d\u554f\u3068\u4f3c\u3066\u3044\u308b\u3002 \u307e\u305a\u3001\u5206\u5272\u3057\u3066\u3001\u305d\u306e\u51fa\u73fe\u56de\u6570\u3092\u6570\u3048\u3001\u548c\u3092\u3068\u308b\u3002 \u4e45\u3005\u306b\u4e00\u77ac\u3067\u8d70\u308b\u3002 import Data.List divid :: Int -> Int -> Int -> [[Int]] divid 0 _ k = [replicate k 0] divid x m k = concat [map (n:).divid (x-n) n $ k-1| n <- [1..m], x - n >= 0, x - k*n <= 0] count :: [Int] -> In\u2026","provider_url":"https://hatena.blog","height":"190"}