Google Code Jam/Text Messaging Outrage: Difference between revisions

@@ Line 1: / Line 1: @@
-== Solution ==
-<haskell>
-main = (enumFromTo (1::Int) <$> readLn) >>= mapM_ go
-  where go i = do
-          [p,k,l] <- map read . words <$> getLine
-          nn <- map read . words <$> getLine
-          printf "Case #%i: %i\n" i (solve k nn)
-solve :: Int -> [Integer] -> Integer
-solve k l = let rounds = map sum $ chunks k $ sortBy (flip compare) l
-              in sum $ zipWith (*) [1..] rounds
-chunks n [] = []
-chunks n as = bs : chunks n cs where (bs,cs) = splitAt n as
-</haskell>

Revision as of 14:15, 6 February 2021