{"image_url":null,"description":"http://projecteuler.net/index.php?section=problems&id=105\u3061\u3087\u3063\u3068\u8003\u3048\u305f\u3089\u3001\u30b7\u30f3\u30d7\u30eb\u306a\u89e3\u6cd5\u306b\u6c17\u304c\u3064\u3044\u305f\u3002 import Data.List monotone xs = all (f.sort$xs) [1..length xs `div` 2] where f ys n = (sum.take (n+1)) ys > (sum.take n.reverse) ys subsetSumNeq xs = all (f xs) [1..length xs `div` 2] where f ys n = all (null.tail).group\u2026","author_name":"jeneshicc","blog_url":"https://jeneshicc.hatenadiary.org/","version":"1.0","title":"Problem 105","type":"rich","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081125%2F1227616311\" title=\"Problem 105 - \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>","categories":["Project Euler","Haskell"],"published":"2008-11-25 21:31:51","width":"100%","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","provider_url":"https://hatena.blog","author_url":"https://blog.hatena.ne.jp/jeneshicc/","url":"https://jeneshicc.hatenadiary.org/entry/20081125/1227616311","height":"190","provider_name":"Hatena Blog"}