{"author_name":"a_kawashiro","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110317%2F1300365419\" title=\"SRM411 div2 hard - a_kawashiro\u306e\u30d6\u30ed\u30b0\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","categories":["topcoder"],"type":"rich","version":"1.0","width":"100%","provider_name":"Hatena Blog","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","height":"190","published":"2011-03-17 21:36:59","description":"\u6700\u5927\u3067\u3082200*200\u7a0b\u5ea6\u306e\u5927\u304d\u3055\u3067\u3057\u304b\u306a\u3044\u306e\u3067 \u5ea7\u6a19\u3092\u5168\u3066\u30e1\u30e2\u30ea\u306b\u3068\u3063\u3066\u30b7\u30e5\u30df\u30ec\u30fc\u30b7\u30e7\u30f3\u3002 #include <vector> #include <queue> #define OFFSET 100 using namespace std; class HoleCakeCuts { public: int cake[201][201]; int cutTheCake(int cakeLength, int holeLength, vector <int> horizontalCuts, vector <int> verticalCuts) { for(int x=-100;x<=100;x+\u2026","blog_url":"https://a-kawashiro.hatenablog.com/","provider_url":"https://hatena.blog","title":"SRM411 div2 hard","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","url":"https://a-kawashiro.hatenablog.com/entry/20110317/1300365419","image_url":null}