{"width":"100%","image_url":null,"author_url":"https://blog.hatena.ne.jp/chiwawa_star/","blog_title":"C++\u7af6\u30d7\u30ed\u5b66\u7fd2\u65e5\u8a18(\u4eee)","blog_url":"https://chiwawa-star.hatenablog.com/","categories":["Codeforces","\u30b3\u30fc\u30c9","\u7af6\u30d7\u30ed","\u7af6\u30d7\u30ed\u30e1\u30e2"],"author_name":"chiwawa_star","type":"rich","height":"190","version":"1.0","provider_name":"Hatena Blog","title":"#65 A. Way Too Long Words\uff5cCodeforces","published":"2016-06-03 12:15:31","url":"https://chiwawa-star.hatenablog.com/entry/2016/06/03/121531","description":"Codeforces Round #65 Problem - A - Codeforces\u3092\u89e3\u304d\u307e\u3057\u305f\u3002 #include <bits/stdc++.h> #define REP(i,n) for(int i=0; i<(n); i++) #define REP2(i,x,n) for(int i=x; i<(n); i++) using namespace std; int main () { cin.tie(0); ios::sync_with_stdio(false); int N; string S; cin >> N; REP( i, N ) { cin >> S; if( S.si\u2026","provider_url":"https://hatena.blog","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fchiwawa-star.hatenablog.com%2Fentry%2F2016%2F06%2F03%2F121531\" title=\"#65 A. Way Too Long Words\uff5cCodeforces - C++\u7af6\u30d7\u30ed\u5b66\u7fd2\u65e5\u8a18(\u4eee)\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>"}