<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>jeneshicc</author_name>
  <author_url>https://blog.hatena.ne.jp/jeneshicc/</author_url>
  <blog_title>落書き、時々落学</blog_title>
  <blog_url>https://jeneshicc.hatenadiary.org/</blog_url>
  <categories>
    <anon>Project Euler</anon>
    <anon>Haskell</anon>
    <anon>Java</anon>
    <anon>C++</anon>
  </categories>
  <description>http://projecteuler.net/index.php?section=problems&amp;id=153とりあえず書いたが、速く動かない。（10^8ってかなり大きい気がするんですが。） import Number import Data.List -- ナーイブな実装 divisors n = [(a,b)| a &lt;- [1..n], b &lt;- [0..n-1], mod (n*a) (a*a+b*b) == 0, mod (n*b) (a*a+b*b) == 0] sumDiv = sum.map f.divisors where f (a,b) | b == 0 = a | ot…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081221%2F1229880435&quot; title=&quot;Problem 153 - 落書き、時々落学&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>2008-12-21 02:27:15</published>
  <title>Problem 153</title>
  <type>rich</type>
  <url>https://jeneshicc.hatenadiary.org/entry/20081221/1229880435</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
