{"version":"1.0","type":"rich","image_url":null,"height":"190","url":"https://jeneshicc.hatenadiary.org/entry/20081123/1227456229","author_name":"jeneshicc","author_url":"https://blog.hatena.ne.jp/jeneshicc/","width":"100%","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","title":"Problem 103","provider_name":"Hatena Blog","description":"http://projecteuler.net/index.php?section=problems&id=103\u826f\u304f\u5206\u304b\u3089\u306a\u3044\u304b\u3089\u3001\u3068\u308a\u3042\u3048\u305a\u5165\u529b\u3057\u3066\u307f\u305f\u3089\u3042\u3063\u3066\u3044\u305f\u3002 \u5f8c\u3067\u30b3\u30fc\u30c9\u304b\u3053\u3046\u3002[\u8ffd\u8a18] Problem 105\u3092\u5229\u7528 import Data.List import Data.Ord 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..lengt\u2026","provider_url":"https://hatena.blog","categories":["Project Euler","Haskell"],"blog_url":"https://jeneshicc.hatenadiary.org/","published":"2008-11-23 01:03:49","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081123%2F1227456229\" title=\"Problem 103 - \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>"}