{"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20091008%2F1255005001\" title=\"Problem258 \u30e1\u30e2 - \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>","image_url":null,"categories":["Haskell","C++","C++","Project Euler"],"type":"rich","width":"100%","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","provider_url":"https://hatena.blog","provider_name":"Hatena Blog","title":"Problem258 \u30e1\u30e2","height":"190","blog_url":"https://jeneshicc.hatenadiary.org/","description":"\u3051\u3063\u3053\u3046\uff0c\uff08\u3068\u3044\u3063\u3066\u3082\uff0c4\uff0c5\u65e5\u524d\u3060\u304c\uff09\u306b\u89e3\u3044\u305f\uff0e\u554f\u984c\u6587\u306f\u7c21\u5358\uff0eg(k) = 1 if 0 g(k) = g(k-2000) + g(k-1999) if 2000 find g(10^18) (mod 20092010)\u666e\u901a\u306eFibonacci\u3060\u3063\u305f\u3089\uff0c\u7c21\u5358\u3067\u3059\u304c\uff0e \u305d\u3046\u7c21\u5358\u306b\u306f\u3044\u304b\u306a\u3044\uff0e\u307e\u3041\uff0c\u305d\u308c\u304c\u4eca\u56de\u306e\u554f\u984c\u3067\u3059\u304b\uff0e Haskell\u3067\u5b9f\u88c5\u3057\u305f\u3089\uff0c3\u5206\u4f4d\uff0e C++\u3067\u5b9f\u88c5\u3057\u305f\u3089\uff0c3\u79d2\u4f4d\uff0e NTL\u3092\u3064\u304b\u3063\u305f\u3089\uff0c0.2\u79d2\u4f4d\uff0eNTL\u30b9\u30b2\u30fc\uff0e \u304a\u305d\u3089\u304f\u4e57\u7b97\u306b\uff0cFFT\u4e57\u7b97\u3092\u4f7f\u3063\u3066\u3044\u308b\u304b\u3089\u3060\u308d\u3046\uff0e \u3057\u304b\u3057\uff0c\u6700\u8fd1C++\u306e\u901f\u3055\u304c\u9b45\u529b\u306b\u306a\u3063\u3066\u304d\u305f\uff0e# Haskell\u3082\u5185\u90e8\u3067\u306fFFT\u4e57\u7b97\u4f7f\u3063\u3066\u308b\uff1f","url":"https://jeneshicc.hatenadiary.org/entry/20091008/1255005001","published":"2009-10-08 21:30:01","version":"1.0","author_url":"https://blog.hatena.ne.jp/jeneshicc/","author_name":"jeneshicc"}