<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>inamori</author_name>
  <author_url>https://blog.hatena.ne.jp/inamori/</author_url>
  <blog_title>inamori’s diary</blog_title>
  <blog_url>https://inamori.hateblo.jp/</blog_url>
  <categories>
    <anon>Haskell</anon>
  </categories>
  <description>http://projecteuler.net/index.php?section=problems&amp;id=91 点Pを軸上以外に取って、Pを通りOPに垂直に直線を引く。その直線上の格子点がQ。 f n = 3 * n * n + sum [ g (x,y) | x &lt;- [1..n], y &lt;- [1..n] ] g (x,y) = (min (div x dx) (div (n - y) dy)) + (min (div y dy) (div (n - x) dx)) where d = gcd x y dx = div y d dy = div x d n = 50 main = pri…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F20100324%2Fp1&quot; title=&quot;Project Euler 91 - inamori’s diary&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>2010-03-24 00:00:00</published>
  <title>Project Euler 91</title>
  <type>rich</type>
  <url>https://inamori.hateblo.jp/entry/20100324/p1</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
