day 7

day_7/code.hs

@@ -26,6 +26,8 @@ minimumsSnd [] = []
 minimumsSnd xs = filter ((==) minsnd . snd) xs
     where minsnd = minimum (map snd xs)
 
+sumK n = ((n+1)*n) `div` 2
+
 main :: IO ()
 main = do
     input <- getContents
@@ -35,11 +37,11 @@ main = do
         splitStr "," input
     }
     let cases = do {
-        map (\x -> (x, sum (map (\y -> do {
+        map 
-            sum [1..((abs (y-x)))]
+        (\x -> (x, sum (map (\y -> sumK (abs (y-x))) crabs)))
-        }) crabs))) [(minimum crabs)..(maximum crabs)]
+        [(minimum crabs)..(maximum crabs)]
     }
     let min = minimumsSnd
     putStrLn $ show $ snd $ head $ min cases -- ans to part 2
 
--- C'est un code pas du tout efficace
+-- Gross, but it works