<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<oembed>
  <author_name>rom_k</author_name>
  <author_url>https://blog.hatena.ne.jp/rom_k/</author_url>
  <blog_title>coding@ease</blog_title>
  <blog_url>https://rom-k.hatenadiary.org/</blog_url>
  <categories>
    <anon>topcoder</anon>
  </categories>
  <description>writer(lyricallyさん)解を見て把握。 確率をyetで処理しないといけないってとこを思いつけなかった。 class NewItemShopTwo { public: double getMaximum(vector &lt;string&gt; customers) { int w[24]; double c[24]; double p[24]; FORI(i, 24) w[i]=0; // split /\s+/ // stringstream ss; // string s; // ss &lt;&lt;strHOGE; // while (ss &gt;&gt; s) { ... } stringstream…</description>
  <height>190</height>
  <html>&lt;iframe src=&quot;https://hatenablog-parts.com/embed?url=https%3A%2F%2From-k.hatenadiary.org%2Fentry%2F20110821%2F1313944651&quot; title=&quot;SRM515 Div2 Hard - coding@ease&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>2011-08-21 01:37:31</published>
  <title>SRM515 Div2 Hard</title>
  <type>rich</type>
  <url>https://rom-k.hatenadiary.org/entry/20110821/1313944651</url>
  <version>1.0</version>
  <width>100%</width>
</oembed>
