{"image_url":null,"title":"SRM515 Div2 Hard","categories":["topcoder"],"width":"100%","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2From-k.hatenadiary.org%2Fentry%2F20110821%2F1313944651\" title=\"SRM515 Div2 Hard - coding@ease\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","type":"rich","height":"190","url":"https://rom-k.hatenadiary.org/entry/20110821/1313944651","version":"1.0","author_name":"rom_k","blog_url":"https://rom-k.hatenadiary.org/","description":"writer(lyrically\u3055\u3093)\u89e3\u3092\u898b\u3066\u628a\u63e1\u3002 \u78ba\u7387\u3092yet\u3067\u51e6\u7406\u3057\u306a\u3044\u3068\u3044\u3051\u306a\u3044\u3063\u3066\u3068\u3053\u3092\u601d\u3044\u3064\u3051\u306a\u304b\u3063\u305f\u3002 class NewItemShopTwo { public: double getMaximum(vector <string> customers) { int w[24]; double c[24]; double p[24]; FORI(i, 24) w[i]=0; // split /\\s+/ // stringstream ss; // string s; // ss <<strHOGE; // while (ss >> s) { ... } stringstream\u2026","provider_name":"Hatena Blog","author_url":"https://blog.hatena.ne.jp/rom_k/","published":"2011-08-21 01:37:31","provider_url":"https://hatena.blog","blog_title":"coding@ease"}