{"author_name":"hamayanhamayan","version":"1.0","categories":["\u7af6\u6280\u30d7\u30ed\u30b0\u30e9\u30df\u30f3\u30b0"],"type":"rich","provider_name":"Hatena Blog","author_url":"https://blog.hatena.ne.jp/hamayanhamayan/","blog_url":"https://blog.hamayanhamayan.com/","image_url":null,"width":"100%","description":"http://codeforces.com/contest/932/problem/Bf(n) := n\u306e\u975e\u30bc\u30ed\u306e\u6841\u306e\u7dcf\u7a4d g(n) := n (n \uff1c 10) g(n) := g(f(n)) \u3068\u5b9a\u7fa9\u3059\u308b\u3002 Q\u500b\u306e\u4ee5\u4e0b\u306e\u30af\u30a8\u30ea\u3092\u51e6\u7406\u305b\u3088\u3002 \u300cx=[L,R]\u306e\u4e2d\u3067g(x)=K\u3068\u306a\u308b\u500b\u6570\u3092\u6c42\u3081\u3088\u300d","provider_url":"https://hatena.blog","published":"2018-02-16 01:51:32","title":"Recursive Queries [ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) B]","height":"190","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fblog.hamayanhamayan.com%2Fentry%2F2018%2F02%2F16%2F015132\" title=\"Recursive Queries [ICM Technex 2018 and Codeforces Round #463 (Div. 1 + Div. 2, combined) B] - \u306f\u307e\u3084\u3093\u306f\u307e\u3084\u3093\u306f\u307e\u3084\u3093\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","blog_title":"\u306f\u307e\u3084\u3093\u306f\u307e\u3084\u3093\u306f\u307e\u3084\u3093","url":"https://blog.hamayanhamayan.com/entry/2018/02/16/015132"}