<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>peroon</author_name>
  <author_url>https://blog.hatena.ne.jp/peroon/</author_url>
  <blog_title>perogram</blog_title>
  <blog_url>https://perogram.hateblo.jp/</blog_url>
  <categories>
  </categories>
  <description>Quiz https://atcoder.jp/contests/abc142/tasks/abc142_f Submission https://atcoder.jp/contests/abc142/submissions/7805082 解法 ワーシャルフロイドを使った最小閉路の検出 algorithm - graph - How to find Minimum Directed Cycle (minimum total weight)? - Stack Overflow https://stackoverflow.com/questions/10456935/graph-how-to-f…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fperogram.hateblo.jp%2Fentry%2F2019%2F10%2F01%2F042847&quot; title=&quot;F - Pure ～ワーシャルフロイド・最小閉路・経路(パス)復元～ - perogram&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>https://cdn-ak.f.st-hatena.com/images/fotolife/p/peroon/20191001/20191001042803.png</image_url>
  <provider_name>Hatena Blog</provider_name>
  <provider_url>https://hatena.blog</provider_url>
  <published>2019-10-01 04:28:47</published>
  <title>F - Pure ～ワーシャルフロイド・最小閉路・経路(パス)復元～</title>
  <type>rich</type>
  <url>https://perogram.hateblo.jp/entry/2019/10/01/042847</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
