adamhp
diff --git a/‎problem1/problem1.hs renamed to ‎problem001/problem1.hs b/‎problem1/problem1.hs renamed to ‎problem001/problem1.hs
diff --git a/‎problem2/problem2.hs renamed to ‎problem002/problem2.hs b/‎problem2/problem2.hs renamed to ‎problem002/problem2.hs
diff --git a/‎problem3/problem3.hs renamed to ‎problem003/problem3.hs b/‎problem3/problem3.hs renamed to ‎problem003/problem3.hs
diff --git a/‎problem4/problem4.hs renamed to ‎problem004/problem4.hs b/‎problem4/problem4.hs renamed to ‎problem004/problem4.hs
diff --git a/‎problem5/problem5.hs renamed to ‎problem005/problem5.hs b/‎problem5/problem5.hs renamed to ‎problem005/problem5.hs
diff --git a/‎problem6/problem6.hs renamed to ‎problem006/problem6.hs b/‎problem6/problem6.hs renamed to ‎problem006/problem6.hs
diff --git a/‎problem7/problem7.hs renamed to ‎problem007/problem7.hs b/‎problem7/problem7.hs renamed to ‎problem007/problem7.hs
diff --git a/‎problem8/number.txt renamed to ‎problem008/number.txt b/‎problem8/number.txt renamed to ‎problem008/number.txt
diff --git a/‎problem8/problem8.hs renamed to ‎problem008/problem8.hs b/‎problem8/problem8.hs renamed to ‎problem008/problem8.hs
diff --git a/‎problem9/problem9.hs renamed to ‎problem009/problem9.hs b/‎problem9/problem9.hs renamed to ‎problem009/problem9.hs
diff --git a/‎problem010/problem10.hs
+40 b/‎problem010/problem10.hs
+40
@@ -0,0 +1,40 @@
+import Data.List
+import Data.Maybe
+import Text.Printf
+import Control.Exception
+import System.CPUTime
+import System.Environment
+
+main :: IO ()
+time :: IO t -> IO t
+time a = do
+    start <- getCPUTime
+    v <- a
+    end   <- getCPUTime
+    let diff = (fromIntegral (end - start)) / (10^12)
+    printf "Computation time: %0.3f sec\n" (diff :: Double)
+    return v
+
+{-
+The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
+
+Find the sum of all the primes below two million.
+-}
+--
+prime :: Int -> Bool
+prime n 
+  | even n = False
+  | otherwise = Nothing == (find (==0) $ map (mod n) [(n-2),(n-4)..3])
+
+sum' :: [Integer] -> Int
+sum' = foldl (+) 0
+-- 
+-- TODO Time solution and add produt of resulting tuple below
+-- find (isTriplet) [(x,y,z) | x <- [1..1000], y <- [x..1000], z <- [y..1000], x+y+z==1000]
+solution = putStrLn $ show $ sum' [x.. | x <- prime x]
+
+main = do
+  putStrLn "Starting..."
+  time solution
+  putStrLn "Done."
+