From 2ee661b014861911dc22a85c10f5fc37c7c2bf77 Mon Sep 17 00:00:00 2001 From: Yuchen Pei Date: Sat, 16 Dec 2017 09:46:08 +0100 Subject: finished a bit of puzzle 16, attempted puzzle 15 --- .Puzzle15.hs.swo | Bin 0 -> 12288 bytes Puzzle15 | Bin 0 -> 22680 bytes Puzzle15.hi | Bin 0 -> 1201 bytes Puzzle15.hs | 24 ++++++++++++++++++++++++ Puzzle15.o | Bin 0 -> 12328 bytes Puzzle16.hs | 15 +++++++++++++++ 6 files changed, 39 insertions(+) create mode 100644 .Puzzle15.hs.swo create mode 100755 Puzzle15 create mode 100644 Puzzle15.hi create mode 100644 Puzzle15.hs create mode 100644 Puzzle15.o create mode 100644 Puzzle16.hs diff --git a/.Puzzle15.hs.swo b/.Puzzle15.hs.swo new file mode 100644 index 0000000..7290ce3 Binary files /dev/null and b/.Puzzle15.hs.swo differ diff --git a/Puzzle15 b/Puzzle15 new file mode 100755 index 0000000..5b98560 Binary files /dev/null and b/Puzzle15 differ diff --git a/Puzzle15.hi b/Puzzle15.hi new file mode 100644 index 0000000..2df21fd Binary files /dev/null and b/Puzzle15.hi differ diff --git a/Puzzle15.hs b/Puzzle15.hs new file mode 100644 index 0000000..104e2aa --- /dev/null +++ b/Puzzle15.hs @@ -0,0 +1,24 @@ +import Data.Int + +stepA :: Int64 -> Int64 +stepA x = x * 16807 `mod` 2147483647 +stepB :: Int64 -> Int64 +stepB x = x * 48271 `mod` 2147483647 + +toInt16 :: Int64 -> Int16 +toInt16 = fromIntegral + +stepAB :: ((Int64, Int64), Int) -> ((Int64, Int64), Int) +stepAB ((x, y), n) = ((stepA x, stepB y), if (toInt16 x) == (toInt16 y) then n + 1 else n) + +solve1' :: ((Int64, Int64), Int) -> Int -> ((Int64, Int64), Int) +solve1' z 0 = z +solve1' z m = let !w = stepAB z in let !m' = m - 1 in solve1' w m' + +solve1 :: (Int64, Int64) -> Int +solve1 (x, y) = snd $ solve1' ((x, y), 0) 40000000 + +input :: (Int64, Int64) +input = (783, 325) + +main = (putStrLn . show . solve1) input diff --git a/Puzzle15.o b/Puzzle15.o new file mode 100644 index 0000000..0303362 Binary files /dev/null and b/Puzzle15.o differ diff --git a/Puzzle16.hs b/Puzzle16.hs new file mode 100644 index 0000000..a15f802 --- /dev/null +++ b/Puzzle16.hs @@ -0,0 +1,15 @@ +import Data.List (elemIndex) +import Data.Maybe (fromJust) + +spin n xs = let (ys, zs) = splitAt n xs in zs ++ ys + +exchange m n xs + | n > m = ys ++ [y] ++ zs ++ [x] ++ ws + | n == m = xs + | otherwise = exchange n m xs + where (ys, x:xs') = splitAt m xs + (zs, y:ws) = splitAt (n - m - 1) xs' + +partner x y xs = exchange m n xs + where m = fromJust $ elemIndex x xs + n = fromJust $ elemIndex y xs -- cgit v1.2.3