{"provider_name":"Hatena Blog","height":"190","author_name":"jeneshicc","type":"rich","description":"\u3084\u3063\u3066\u307f\u305f\uff0c\u3068\u3044\u3046\u304b\u66f8\u3044\u3066\u307f\u305f\uff0e \u9045\u3044\u306a\u30fc import Data.List import Data.Array import Control.Monad import Text.Printf import Data.Bits main = do (n:_) <- getList :: IO [Int] forM_ [1..n] $ \\i -> do (k:_) <- getList cs <- getLine printf \"Case #%d: %d\\n\" i (minArray k cs) split :: Int -> [a] -> [[a]] split k xs = takeWhil\u2026","html":"<iframe src=\"https://hatenablog-parts.com/embed?url=https%3A%2F%2Fjeneshicc.hatenadiary.org%2Fentry%2F20090918%2F1253274342\" title=\"2008 \u306e Round2 \u306e D (Google Code Jam 2008) - \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_url":"https://jeneshicc.hatenadiary.org/","published":"2009-09-18 20:45:42","author_url":"https://blog.hatena.ne.jp/jeneshicc/","width":"100%","url":"https://jeneshicc.hatenadiary.org/entry/20090918/1253274342","blog_title":"\u843d\u66f8\u304d\u3001\u6642\u3005\u843d\u5b66","version":"1.0","title":"2008 \u306e Round2 \u306e D (Google Code Jam 2008)","categories":["\u65e5\u8a18","Haskell"],"image_url":null,"provider_url":"https://hatena.blog"}