{"image_url":null,"author_name":"jeneshicc","blog_url":"https://jeneshicc.hatenadiary.org/","provider_url":"https://hatena.blog","description":"haskell\u3067\u66f8\u3044\u305f\u3089\u9045\u304b\u3063\u305f\u306e\u3067\uff0cC++\u3067\u66f8\u3044\u3066\u307f\u305f\uff0e \u30a2\u30eb\u30b4\u30ea\u30ba\u30e0\u306f\u307b\u307c\u540c\u3058\uff0e\u30e1\u30e2\u5316\u518d\u5e30\u3067\u306f\u306a\u304f\uff0c\u914d\u5217\u3067\u30d3\u30eb\u30c9\u30a2\u30c3\u30d7\uff0e\u5b9f\u306f numeric_limits::max() \u3067 int\u306e\u6700\u5927\u5024\u304c\u3068\u308a\u3060\u305b\u308b\u3089\u3057\u3044\uff0e #include<iostream> #include<cmath> #include<limits> using namespace std; int main() { int n; cin >> n; for (int i = 1; i <= n; i++) { int p, q; cin >> p >> q; int s[q+1], pre = 0; // scan input\u2026","published":"2009-09-14 20:34:52","author_url":"https://blog.hatena.ne.jp/jeneshicc/","title":"Round 1C \u306e C \u3092 C++\u3067\u66f8\u3044\u3066\u307f\u305f(Google Code Jam 2009)","url":"https://jeneshicc.hatenadiary.org/entry/20090914/1252928092","width":"100%","height":"190","provider_name":"Hatena Blog","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","version":"1.0","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20090914%2F1252928092\" title=\"Round 1C \u306e C \u3092 C++\u3067\u66f8\u3044\u3066\u307f\u305f(Google Code Jam 2009) - \u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","categories":["\u65e5\u8a18","C++"],"type":"rich"}