# Project Euler Problem 68 Solution

## Question

Consider the following “magic” 3-gon ring, filled with the numbers 1 to 6, and each line adding to nine.

Working clockwise, and starting from the group of three with the numerically lowest external node (4,3,2 in this example), each solution can be described uniquely. For example, the above solution can be described by the set: 4,3,2; 6,2,1; 5,1,3.

It is possible to complete the ring with four different totals: 9, 10, 11, and 12. There are eight solutions in total.

 Total Solution Set 9 4,2,3; 5,3,1; 6,1,2 9 4,3,2; 6,2,1; 5,1,3 10 2,3,5; 4,5,1; 6,1,3 10 2,5,3; 6,3,1; 4,1,5 11 1,4,6; 3,6,2; 5,2,4 11 1,6,4; 5,4,2; 3,2,6 12 1,5,6; 2,6,4; 3,4,5 12 1,6,5; 3,5,4; 2,4,6

By concatenating each group it is possible to form 9-digit strings; the maximum string for a 3-gon ring is 432621513.

Using the numbers 1 to 10, and depending on arrangements, it is possible to form 16- and 17-digit strings. What is the maximum 16-digit string for a “magic” 5-gon ring?

fivegon :: Int -> [[[Int]]]
fivegon n = [[[a, b, c], [d, c, e], [f, e, g], [h, g, i], [k, i, b]]
| a <- [1..10],
b <- filter (notElem [a]) [1..10],
c <- filter (notElem [a, b]) [1..10],
a + b + c == n,
d <- filter (notElem [a, b, c]) [a..10],
e <- filter (notElem [a, b, c, d]) [1..10],
d + c + e == n,
f <- filter (notElem [a, b, c, d, e]) [a..10],
g <- filter (notElem [a, b, c, d, e, f]) [1..10],
f + e + g == n,
h <- filter (notElem [a, b, c, d, e, f, g]) [a..10],
i <- filter (notElem [a, b, c, d, e, f, g, h]) [1..10],
h + g + i == n,
k <- filter (notElem [a, b, c, d, e, f, g, h, i]) [a..10],
k + i + b == n]

main :: IO ()
main = putStrLn $maximum [s | n <- [1..50], gon <- fivegon n, let s = concatMap show$ concat gon, length s == 16]
$ghc -O2 -o magic-5-gon magic-5-gon.hs$ time ./magic-5-gon
real   0m0.011s
user   0m0.008s
sys    0m0.000s