diff options
| author | Lucas Ransan <lucas@ransan.tk> | 2021-07-15 14:17:13 +0200 |
|---|---|---|
| committer | Lucas Ransan <lucas@ransan.tk> | 2021-07-15 14:26:22 +0200 |
| commit | f7ff273615ac22432cd7f34c1f1fff02596d733f (patch) | |
| tree | 165aa866319152ea26fdf9adbd63cb89208bf3af | |
| parent | f32ac270c4b0cb654afd623f5e0e37bf61f7f27c (diff) | |
| download | perlweeklychallenge-club-f7ff273615ac22432cd7f34c1f1fff02596d733f.tar.gz perlweeklychallenge-club-f7ff273615ac22432cd7f34c1f1fff02596d733f.tar.bz2 perlweeklychallenge-club-f7ff273615ac22432cd7f34c1f1fff02596d733f.zip | |
Miranda week 121 task 2
| -rwxr-xr-x | challenge-121/luc65r/miranda/ch-2.m | 52 |
1 files changed, 52 insertions, 0 deletions
diff --git a/challenge-121/luc65r/miranda/ch-2.m b/challenge-121/luc65r/miranda/ch-2.m new file mode 100755 index 0000000000..5801a52c85 --- /dev/null +++ b/challenge-121/luc65r/miranda/ch-2.m @@ -0,0 +1,52 @@ +#!/usr/bin/env -S mira -exec + +matrix == [[num]] + +main = lay ( "matrix:":(map show mat) + ++ [ "" + , "tour: " ++ show besttour + , "length: " ++ show (length mat besttour) + ] + ) + where + arg = $* ! 1 + mat = (mkrandmat . numval) arg, if (and . map digit) arg + = readmat arg, otherwise + tour t = t ++ [t ! 0] + besttour = (minby (length mat) . map tour . perms) [0 .. #mat - 1] + +length :: matrix -> [num] -> num +length mat tour = (sum . map get . zip2 tour . tl) tour + where + get (i,j) = mat ! j ! i + +mkrandmat :: num -> matrix +mkrandmat n = [ [ f i j (rand ! (i * n + j)) | i <- [1..n] ] | j <- [1..n] ] + where + rand = (map ((+) 1 . (mod 9) . code) . readb) "/dev/random" + f i j = const 0, if i == j + = id, otherwise + +readmat :: [char] -> matrix +readmat = map (map numval . words) . lines . read + +words :: [char] -> [[char]] +words [] = [] +words (x:xs) = []:words xs, if x = ' ' + = (x:y):ys, otherwise + where + (y:ys) = words xs, if xs ~= [] + = []:[], otherwise + +perms :: [*] -> [[*]] +perms [] = [[]] +perms x = [ a:y | a <- x; y <- perms (x -- [a]) ] + +minby :: (* -> num) -> [*] -> * +minby f (x:xs) = g x (f x) xs + where + g v mv [] = v + g v mv (x:xs) = g x mx xs, if mx < mv + = g v mv xs, otherwise + where + mx = f x |
