{"blog_url":"https://yambe2002.hatenablog.com/","width":"100%","blog_title":"yambe2002\u2019s diary","description":"\u4e45\u3057\u3076\u308a\u306e\u30d7\u30ed\u30b3\u30f3\u306f\u4eca\u56de\u304b\u3089Div1/2\u306b\u5206\u304b\u308c\u305fCodechef\u3002Div1\u3067344\u4f4d/633\u4eba\u306e\u7d50\u679c\u3060\u3063\u305f\u3002\u3066\u3044\u3046\u304bDiv2\u3067\u3044\u3044\u306e\u306b\u30fb\u30fb\u30fb\u3002Dibs on Fibs \u30b5\u30a4\u30baM\u306e\u914d\u5217A\u3001B\u3068\u6574\u6570N\u304c\u4e0e\u3048\u3089\u308c\u308b\u3002\u6b21\u306e\u6700\u7d42result\u3092\u300110^9+7\u3067Mod\u3057\u3066\u7b54\u3048\u3088\u3002 result := 0 for i := 1 to M for j := 1 to M array fib[1..max(2, N)] fib[1] := A[i] fib[2] := B[j] for k := 3 to N fib[k] := fib[k-1] + fib[k-2] result := result + fi\u2026","type":"rich","title":"Codechef May Challenge 2018 \u53c2\u52a0\u65e5\u8a18","published":"2018-05-23 12:55:23","provider_url":"https://hatena.blog","image_url":null,"version":"1.0","provider_name":"Hatena Blog","height":"190","author_url":"https://blog.hatena.ne.jp/yambe2002/","url":"https://yambe2002.hatenablog.com/entry/2018/05/23/125523","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fyambe2002.hatenablog.com%2Fentry%2F2018%2F05%2F23%2F125523\" title=\"Codechef May Challenge 2018 \u53c2\u52a0\u65e5\u8a18 - yambe2002\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>","author_name":"yambe2002","categories":[]}