{"author_name":"peryaudo","provider_name":"Hatena Blog","categories":["Programming","Algorithm","AOJ"],"author_url":"https://blog.hatena.ne.jp/peryaudo/","blog_title":"\u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5","version":"1.0","description":"404 Not Found #include <cstdio> int main(){ char b[10], a[3][3]; while(~scanf(\"%9s\\n\", b)){ char r = 0; for(int i = 0; i < 9; i++) a[i%3][i/3] = b[i]; for(int i = 0, j, f; i < 3; i++){ if(a[i][0] == 's') continue; for(j = 0, f = 1; j < 3; j++) if(a[i][0] != a[i][j]) f = 0; if(f) r = a[i][0]; } for(i\u2026","url":"https://peryaudo.hatenablog.com/entry/20100806/1281105944","height":"190","provider_url":"https://hatena.blog","width":"100%","title":"AOJ 0066 Tic Tac Toe","blog_url":"https://peryaudo.hatenablog.com/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fperyaudo.hatenablog.com%2Fentry%2F20100806%2F1281105944\" title=\"AOJ 0066 Tic Tac Toe - \u30da\u30ea\u30e3\u30a6\u30c9\u306e\u65e5\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","published":"2010-08-06 23:45:44","image_url":null,"type":"rich"}