<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>h_chiro</author_name>
  <author_url>https://blog.hatena.ne.jp/h_chiro/</author_url>
  <blog_title>雑記</blog_title>
  <blog_url>https://h-chiro.hatenablog.com/</blog_url>
  <categories>
    <anon>AOJ</anon>
  </categories>
  <description>http://rose.u-aizu.ac.jp/onlinejudge/ProblemSet/description.jsp?id=1126 方針 ある位置までの可能な最大値でDPする。 ソース #include&lt;iostream&gt; #include&lt;string&gt; using namespace std; #define REP(i,a,b) for(int i=a; i&lt;b; ++i) #define rep(i,n) REP(i,0,n) char input[70][70]; string dp[70][70]; int comp(string s,string t) { if(s.…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2Fh-chiro.hatenablog.com%2Fentry%2F20101109%2F1289309699&quot; title=&quot; 1126 The Secret Number - 雑記&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-11-09 22:34:59</published>
  <title> 1126 The Secret Number</title>
  <type>rich</type>
  <url>https://h-chiro.hatenablog.com/entry/20101109/1289309699</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
