{"title":"Codeforces Round #373 (Div. 1)","image_url":null,"author_url":"https://blog.hatena.ne.jp/tozangezan/","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Ftozangezan.hatenablog.com%2Fentry%2F2017%2F01%2F01%2F182743\" title=\"Codeforces Round #373 (Div. 1) - tozangezan&#39;s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","description":"\u7d2b\u30b3\u30fc\u30c0\u30fc\u306fDiv1\u306ewriter\u3084\u308b\u306e\u3084\u3081\u3066\u307b\u3057\u3044\u3002 A B C D E Place 00:13 \u524a\u9664*1 01:02 -4 - 42th A: \u4e00\u756a\u5de6\u306b\u51fa\u3066\u304d\u305f5\u3092\u56db\u6368\u4e94\u5165\u3057\u3066\u3044\u304f\u3002\u3072\u3069\u3044\u5b9f\u88c5\u554f\u984c\u3002 #include<stdio.h> #include<math.h> #include<algorithm> #include<queue> #include<string.h> #include<vector> #include<set> #include<stdlib.h> using namespace std; const long long mod=1000000007; const\u2026","type":"rich","width":"100%","published":"2017-01-01 18:27:43","blog_url":"https://tozangezan.hatenablog.com/","author_name":"tozangezan","version":"1.0","provider_url":"https://hatena.blog","categories":["Codeforces"],"height":"190","blog_title":"tozangezan's diary","provider_name":"Hatena Blog","url":"https://tozangezan.hatenablog.com/entry/2017/01/01/182743"}