{"provider_name":"Hatena Blog","blog_url":"https://jeneshicc.hatenadiary.org/","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20081120%2F1227140563\" title=\"Problem 97 - \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>","version":"1.0","provider_url":"https://hatena.blog","url":"https://jeneshicc.hatenadiary.org/entry/20081120/1227140563","height":"190","title":"Problem 97","width":"100%","author_url":"https://blog.hatena.ne.jp/jeneshicc/","description":"powMod a n m | n < 3 = a^n `mod` m | otherwise = let (q,r) = divMod n 2 aq = powMod a q m in aq*aq*a^r `mod` m main = print $ (powMod 2 7830457 (10^10) * 28433 + 1) `mod` (10^10)","published":"2008-11-20 09:22:43","type":"rich","image_url":null,"author_name":"jeneshicc","categories":["Project Euler","Haskell"]}