{"author_name":"a_kawashiro","provider_name":"Hatena Blog","height":"190","categories":["topcoder"],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fa-kawashiro.hatenablog.com%2Fentry%2F20110401%2F1301630590\" title=\"SRM332 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>","url":"https://a-kawashiro.hatenablog.com/entry/20110401/1301630590","image_url":null,"version":"1.0","provider_url":"https://hatena.blog","blog_title":"a_kawashiro\u306e\u30d6\u30ed\u30b0","description":"\u3048\u3089\u304f\u7c21\u5358\u3060\u3063\u305f\u3002 0 #include <string> #include <vector> using namespace std; class Squares { public: int countSquares(vector <string> field) { int ans=0,h=field[0].size(),w=field.size(),n=55; for(int x1=0;x1<n;x1++) for(int y1=0;y1<n;y1++) for(int xd=0;xd<n;xd++) for(int yd=1;yd<n;yd++) { int x2=x1+xd,y2=y1\u2026","author_url":"https://blog.hatena.ne.jp/a_kawashiro/","published":"2011-04-01 13:03:10","type":"rich","title":"SRM332 div2 hard","blog_url":"https://a-kawashiro.hatenablog.com/","width":"100%"}