<?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>
  </categories>
  <description>http://projecteuler.net/index.php?section=problems&amp;id=157 150番あたりの問題にしては簡単。 import Control.Monad import Number import Data.List divisor100 n = [2^x*5^y | x &lt;-[0..2*n], y &lt;- [0..2*n]] primitiveSolutions n = filter (uncurry (&lt;=)) [(div (m^2) d + m, m + d) | d &lt;- divisor100 n] where m = 10^n solutions …</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081224%2F1230130718&quot; title=&quot;Problem 157 - 落書き、時々落学&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-24 23:58:38</published>
  <title>Problem 157</title>
  <type>rich</type>
  <url>https://jeneshicc.hatenadiary.org/entry/20081224/1230130718</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
