{"width":"100%","blog_title":"\u3088\u3058\u308d\u3081\u306e\u30bd\u30fc\u30b9\u7f6e\u304d\u5834","version":"1.0","title":"\u3081\u304c\u306d / paizaOnlineHackathon7","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fyorozu-itomochi.hatenadiary.jp%2Fentry%2F2016%2F12%2F31%2F050842\" title=\"\u3081\u304c\u306d / paizaOnlineHackathon7 - \u3088\u3058\u308d\u3081\u306e\u30bd\u30fc\u30b9\u7f6e\u304d\u5834\" 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","description":"paiza.jp #include <iostream> using namespace std; int q[100][100], p[10][10]; bool Check(int m, int y, int x) { bool flg = true; for (int i=0; i<m; ++i) for (int j=0; j<m; ++j) { if (i==0 && j==0) continue; if (q[y+i][x+j] != p[i][j]) { flg = false; break; } } return flg; } void Solve(int n) { int m\u2026","height":"190","author_name":"yorozu_itomochi","url":"https://yorozu-itomochi.hatenadiary.jp/entry/2016/12/31/050842","blog_url":"https://yorozu-itomochi.hatenadiary.jp/","provider_url":"https://hatena.blog","categories":["POH!","C++"],"image_url":null,"author_url":"https://blog.hatena.ne.jp/yorozu_itomochi/","provider_name":"Hatena Blog","published":"2016-12-31 05:08:42"}