{"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20100402%2Fp2\" title=\"Project Euler 4\uff083\uff09 - inamori\u2019s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","image_url":null,"author_url":"https://blog.hatena.ne.jp/inamori/","author_name":"inamori","provider_name":"Hatena Blog","height":"190","url":"https://inamori.hateblo.jp/entry/20100402/p2","blog_url":"https://inamori.hateblo.jp/","version":"1.0","provider_url":"https://hatena.blog","categories":["PE","C++"],"blog_title":"inamori\u2019s diary","description":"Haskell\u3067 import Data.List digits 0 = [] digits n = (digits (div n 10)) ++ [mod n 10] is_palindromic n = n == (foldr (\\x y -> x + y * 10) 0 (digits n)) main = print (foldl1' max (filter is_palindromic [ x * y | x <- [100..999], y <- [100..999] ])) \u3053\u3046\u66f8\u304f\u306e\u3068\u4f3c\u305f\u3088\u3046\u306b\u66f8\u304d\u305f\u3044\u3002itertools.h #include <iostream> #incl\u2026","published":"2010-04-02 00:00:01","type":"rich","width":"100%","title":"Project Euler 4\uff083\uff09"}