
2 Problem 82
Find the minimal path sum from the left column to the right column.
Solution:
import Data.List import qualified Data.Map as M import Data.Array (\(_,a) (_,b) -> compare a[p|a<-[1..80],let p=minPathSum s (1,a)] primes, nonprimes :: [Int] primes = [2,3,5] ++ (diff [7,9..] nonprimes) nonprimes = foldr1 f . map g $ tail primes where f (x:xt) ys = x : (merge xt ys) g p = [ n*p | n <- [p,p+2..]] groups=1000000 problem_87 50 total=total problem_87 n total= problem_87 (n+1) (total+length expressible) where limit =groups+n*groups max =n*groups main=appendFile "p87.log"$show$problem_87 0 0
8 Problem 88
Exploring minimal product-sum numbers for sets of different sizes.
Solution:
problem_88 = undefined