adventofcode
/
2017
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Day 14 - minor refactoring

This commit is contained in:
Jonathan Chan 2017-12-18 02:02:10 -08:00
parent a0cd4a375d
commit 1a515e1254
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
14.hs
View File

@ -3,7 +3,7 @@ import Data.Char (ord)
import Data.Bits (xor) import Data.Bits (xor)
import Text.Printf (printf) import Text.Printf (printf)
import Data.Graph (scc, graphFromEdges) import Data.Graph (scc, graphFromEdges)
import Data.Tuple.Select (sel1, sel2) import Data.Tuple.Select (sel1)
import Data.Sequence (Seq, index, fromList) import Data.Sequence (Seq, index, fromList)
type Length = Int type Length = Int
@ -48,4 +48,4 @@ main :: IO ()
main = do main = do
let hashes = concat $ map (sparseHash . (++ [17, 31, 73, 47, 23]) . map ord . ("ffayrhll-" ++) . show) [0..127] let hashes = concat $ map (sparseHash . (++ [17, 31, 73, 47, 23]) . map ord . ("ffayrhll-" ++) . show) [0..127]
print $ length . filter (== '1') $ hashes print $ length . filter (== '1') $ hashes
print $ length . scc . sel1 . graphFromEdges . sel2 $ foldr getEdges (fromList hashes, []) [0..128 * 128 - 1] print $ length . scc . sel1 . graphFromEdges . snd $ foldr getEdges (fromList hashes, []) [0..128 * 128 - 1]