{"height":"190","url":"https://jeneshicc.hatenadiary.org/entry/20081122/1227363251","author_name":"jeneshicc","image_url":null,"provider_url":"https://hatena.blog","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","type":"rich","blog_url":"https://jeneshicc.hatenadiary.org/","title":"Problem 98","description":"http://projecteuler.net/index.php?section=problems&id=98 \u30a2\u30ca\u30b0\u30e9\u30e0\u304b\u3064\u5e73\u65b9\u6570\u306b\u306a\u308b\u6587\u5b57\u306e\u7d44\u306e\u3046\u3061\u3001\u6700\u5927\u306e\u5e73\u65b9\u6570\u3092\u6c42\u3081\u308b\u3002 \u5148\u982d\uff10\u3060\u3081\u3092\u5fd8\u308c\u3066\u3044\u305f\u3002 import Data.List import Data.Function import qualified Data.Map as Map findAnagrams xs = map (map snd).filter((>1).length).groupBy((==)`on` fst).sort.zip (map sort xs) $ xs setNum x = filter uniNum\u2026","provider_name":"Hatena Blog","width":"100%","published":"2008-11-22 23:14:11","categories":["Project Euler","Haskell"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081122%2F1227363251\" title=\"Problem 98 - \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>","version":"1.0","author_url":"https://blog.hatena.ne.jp/jeneshicc/"}