Haskell solution (hopefully...) to BAPC 2013 Problem F

gistfile1.hs

import Control.Monad

minimalize [] _ = []
minimalize remaining ((a, b) : xs)
	| elem a remaining || elem b remaining = 
		(a, b) : minimalize (filter (\x -> x /= a && x /= b) remaining) xs
	| otherwise = minimalize remaining xs

readInts = getLine >>= \line -> return $ map read $ words $ line
readEdge = readInts >>= \[a, b] -> return (a, b)

run = do
	[cities, pilots] <- readInts
	edges <- replicateM pilots readEdge
	print $ length $ minimalize [1..cities] edges

main :: IO ()
main = readLn >>= \n -> replicateM_ n run