<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>n9d</author_name>
  <author_url>https://blog.hatena.ne.jp/n9d/</author_url>
  <blog_title>計算機と戯れる日々</blog_title>
  <blog_url>https://n9d.hatenadiary.org/</blog_url>
  <categories>
  </categories>
  <description>まあ、そのまま。 sortByなりmaximumByなりがData.Ordのcomparingを使わないといけないのがrubyと比較して面倒 import Data.List import Data.Ord main = print $ p p = maximumBy (comparing length) $ group $ sort [x+y+z|x&lt;-[1..998],y&lt;-[x..998-x],z&lt;-[y..998-x-y],x&lt;=y,y&lt;z,z^2==x^2+y^2]</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fn9d.hatenadiary.org%2Fentry%2F20110925%2Fp2&quot; title=&quot;problem39 - 計算機と戯れる日々&quot; class=&quot;embed-card embed-blogcard&quot; scrolling=&quot;no&quot; frameborder=&quot;0&quot; style=&quot;display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;&quot;&gt;&lt;/iframe&gt;</html>
  <image_url></image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2011-09-25 00:00:01</published>
  <title>problem39</title>
  <type>rich</type>
  <url>https://n9d.hatenadiary.org/entry/20110925/p2</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
