<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>Rion778</author_name>
  <author_url>https://blog.hatena.ne.jp/Rion778/</author_url>
  <blog_title>もうカツ丼はいいよな</blog_title>
  <blog_url>https://rion778.hatenablog.com/</blog_url>
  <categories>
    <anon>R</anon>
    <anon>Project Euler</anon>
  </categories>
  <description>Problem 26 - Project Euler d &lt; 1000について、1/dの順環節が最長となるdを求めよ。 以下解答</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Frion778.hatenablog.com%2Fentry%2F2017%2F12%2F26%2F233021&quot; title=&quot;Project Euler Problem 26 - 最も長い順環節を持つ循環小数 - もうカツ丼はいいよな&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>2017-12-26 23:30:21</published>
  <title>Project Euler Problem 26 - 最も長い順環節を持つ循環小数</title>
  <type>rich</type>
  <url>https://rion778.hatenablog.com/entry/2017/12/26/233021</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
