2011-10-01ãã1ã¶æéã®è¨äºä¸è¦§
http://code.google.com/codejam/japan/contests.htmlæéãã¨ããã®ã§ããã£ã¦ã¿ããã©ã¡ãããlargeéã£ããã©ã解説èªãã§ãªããããå®å ¨ã«æ£ããä¿è¨¼ã¯ãªãï¼å¤åãã£ã¦ãã¨æããã©ãä¾å¤å¦çã¨ã A äºæ³ãã¤ãã¦ãå°ããåé¡ãµã¤ãºã§æ£ãããã¨ã確èªâ¦
ä¿éºã®ç¥èã¼ããªã®ã§ãå»çä¿éºã«ã¤ãã¦èª¿ã¹ã¦ã¿ãã Conclusion ç¬èº«ã§ä¼ç¤¾å¤ãã®èªåã«ã¯å½ã®å¥åº·ä¿éºã§ååã æ ¹æ ã¯ä»¥ä¸ããå¼ç¨ã http://39saku39saku.blog129.fc2.com/blog-entry-117.html ä¼ç¤¾å¡ã®ã»ã¨ãã©ãå å ¥ãã¦ããå¥åº·ä¿éºã¯ãé©ãã»ã©ä¿éâ¦
ãã£ã¦ã¿ããHaskellã§ã 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 -â¦