{"description":"https://atcoder.jp/contests/abc248/tasks/abc248_c\u3067\u306a\u304f\u3001\u3068\u3057\u305f\u65b9\u304c\u66f8\u304d\u3084\u3059\u3044\u306e\u3067\u3001\u305d\u3046\u3057\u307e\u3057\u3087\u3046\u3002\u305d\u3057\u3066\u3001\u3068\u3057\u307e\u3059\u3002\u30d1\u30c3\u30c8\u898b\u3001\u6bcd\u95a2\u6570\u3067\u3059\u304c\u3001C\u554f\u984c\u3067\u6bcd\u95a2\u6570\u306e\u306f\u305a\u306a\u3044\u3068\u601d\u3063\u3066\u8003\u3048\u76f4\u3059\u3068\u3001\u5358\u306a\u308bDP\u3067\u3059\u306d\u3002 def update(dp, M, L): new_dp = [0] * (L + 1) for i, a in enumerate(dp): for j in range(M): k = i + j if k > L: break new_dp[k] += a return new_dp def F(N, M, K): L = K - N d\u2026","height":"190","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Finamori.hateblo.jp%2Fentry%2F2022%2F04%2F19%2F204309\" title=\"AtCoder Beginner Contest 248 C - inamori\u2019s diary\" class=\"embed-card embed-blogcard\" scrolling=\"no\" frameborder=\"0\" style=\"display: block; width: 100%; height: 190px; max-width: 500px; margin: 10px 0px;\"></iframe>","image_url":null,"width":"100%","type":"rich","published":"2022-04-19 20:43:09","blog_url":"https://inamori.hateblo.jp/","provider_name":"Hatena Blog","author_url":"https://blog.hatena.ne.jp/inamori/","url":"https://inamori.hateblo.jp/entry/2022/04/19/204309","title":"AtCoder Beginner Contest 248 C","blog_title":"inamori\u2019s diary","version":"1.0","categories":[],"author_name":"inamori","provider_url":"https://hatena.blog"}