From 6fc8ab9963b06895b9d6e3beb0318ef3638a1925 Mon Sep 17 00:00:00 2001 From: Daniele Fucini Date: Mon, 18 Nov 2024 21:19:50 +0100 Subject: [PATCH] Add Haskell solution for Problem 24 --- Haskell/p024.hs | 13 +++++++++++++ 1 file changed, 13 insertions(+) create mode 100644 Haskell/p024.hs diff --git a/Haskell/p024.hs b/Haskell/p024.hs new file mode 100644 index 0000000..c69cf0f --- /dev/null +++ b/Haskell/p024.hs @@ -0,0 +1,13 @@ +-- A permutation is an ordered arrangement of objects. For example, 3124 is one possible permutation of the digits 1, 2, 3 and 4. +-- If all of the permutations are listed numerically or alphabetically, we call it lexicographic order. The lexicographic permutations of 0, 1 and 2 are: +-- +-- 012 021 102 120 201 210 +-- +-- What is the millionth lexicographic permutation of the digits 0, 1, 2, 3, 4, 5, 6, 7, 8 and 9? + +import Data.List + +main = do + let result = sort (permutations "0123456789") !! 999999 + putStrLn $ "Project Euler, Problem 24\n" + ++ "Answer: " ++ result