{"author_url":"https://blog.hatena.ne.jp/peroon/","description":"Quiz https://codeforces.com/contest/1036/problem/B AC https://codeforces.com/contest/1036/submission/89997834 \u89e3\u8aac \u3067\u304d\u308b\u3060\u3051\u659c\u3081\u79fb\u52d5\u3057\u3088\u3046\u3068\u3057\u305f\u3068\u304d\u3001X\u56de\u76ee\u306b\u3044\u308c\u308b\u5ea7\u6a19\u306b\u306f\u5236\u9650\u304c\u3042\u308b\u3002\u9006\u306b\u305d\u306e\u5ea7\u6a19\u306a\u3089\u5168\u3066\u659c\u3081\u3067\u884c\u3051\u308b \u76ee\u7684\u5730\u307e\u3067\u306e\u5927\u62b5\u306e\u79fb\u52d5\u306f\u659c\u3081\u3067\u6e08\u307e\u3059\u3053\u3068\u304c\u3067\u304d\u3001\u6700\u5f8c\u306e\u6570\u56de\u3067\u8abf\u6574\u3059\u308b void solve(){ ll x,y,k;cin>>x>>y>>k; if(x>k or y>k){ p(-1); return; } // can ll ans = k; if(k%2==0){\u2026","blog_url":"https://perogram.hateblo.jp/","type":"rich","width":"100%","provider_url":"https://hatena.blog","image_url":"https://cdn-ak.f.st-hatena.com/images/fotolife/p/peroon/20200815/20200815165107.png","version":"1.0","categories":["1600"],"provider_name":"Hatena Blog","height":"190","blog_title":"perogram","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fperogram.hateblo.jp%2Fentry%2F2020%2F08%2F15%2F165154\" title=\"B. Diagonal Walking v.2 - perogram\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","title":"B. Diagonal Walking v.2","author_name":"peroon","published":"2020-08-15 16:51:54","url":"https://perogram.hateblo.jp/entry/2020/08/15/165154"}