{"type":"rich","width":"100%","version":"1.0","blog_url":"https://mayokoex.hatenablog.com/","title":"yukicoder No.367 \u30ca\u30a4\u30c8\u306e\u8ee2\u8eab","categories":["yukicoder"],"url":"https://mayokoex.hatenablog.com/entry/2016/04/30/003000_1","author_name":"mayokoex","blog_title":"mayoko\u2019s diary","image_url":null,"author_url":"https://blog.hatena.ne.jp/mayokoex/","published":"2016-04-30 00:30:00","provider_url":"https://hatena.blog","height":"190","description":"\u554f\u984c No.367 \u30ca\u30a4\u30c8\u306e\u8ee2\u8eab - yukicoder \u89e3\u6cd5 2*H*W \u306e\u9802\u70b9\u3092\u4f5c\u3063\u3066\u9069\u5207\u306b\u8fba\u3092\u8cbc\u3063\u3066\u30c0\u30a4\u30af\u30b9\u30c8\u30e9\u3059\u308c\u3070\u826f\u3044\u3067\u3059\u3002 int knightX[] = {2, 1, -1, -2, -2, -1, 1, 2}; int knightY[] = {1, 2, 2, 1, -1, -2, -2, -1}; int miniX[] = {1, -1, -1, 1}; int miniY[] = {1, 1, -1, -1}; const int MAXH = 555; string board[MAXH]; struct edge { int v; ll w; edge() {} e\u2026","provider_name":"Hatena Blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fmayokoex.hatenablog.com%2Fentry%2F2016%2F04%2F30%2F003000_1\" title=\"yukicoder No.367 \u30ca\u30a4\u30c8\u306e\u8ee2\u8eab - mayoko\u2019s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>"}