{"published":"2011-10-08 18:38:12","url":"https://jeneshicc.hatenadiary.org/entry/20111008/1318066692","image_url":null,"author_name":"jeneshicc","blog_url":"https://jeneshicc.hatenadiary.org/","author_url":"https://blog.hatena.ne.jp/jeneshicc/","title":"Google Code Jam Japan 2011 \u306e\u4e88\u9078C\u306e\u554f\u984c\u6587\u304c\u77ed\u304b\u3063\u305f\u306e\u3067\u3084\u3063\u3066\u307f\u305f\u3002","type":"rich","provider_name":"Hatena Blog","width":"100%","description":"\u3084\u3063\u3066\u307f\u305f\u3002Haskell\u3067\u3002 import Control.Monad (forM_, liftM) import Text.Printf (printf) import Data.List (unfoldr) f :: Integer -> Integer -> (Integer, Integer) f 0 0 = (2, 1) f 0 1 = (1, 0) f 1 0 = (1, 1) f 1 1 = (2, 1) count :: Integer -> Integer -> Integer -> Integer count s c 1 = s-c+1 count s c n = cou\u2026","categories":[],"html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20111008%2F1318066692\" title=\"Google Code Jam Japan 2011 \u306e\u4e88\u9078C\u306e\u554f\u984c\u6587\u304c\u77ed\u304b\u3063\u305f\u306e\u3067\u3084\u3063\u3066\u307f\u305f\u3002 - \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>","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","version":"1.0","provider_url":"https://hatena.blog","height":"190"}