Descomposiciones en sumas de primos

Un comentario

1. Haskell

   import Data.Numbers.Primes sumaDePrimos :: Int -> [[Int]] sumaDePrimos 0 = [[0]] sumaDePrimos n = aux n ys where ys = reverse $ takeWhile (<=n) primes aux _ [] = [] aux n (x:xs) | x > n = aux n xs | x == n = [n] : aux n xs | otherwise = map (x:) (aux (n-x) (x:xs)) ++ aux n xs

   1 2 3 4 5 6 7 8 9 10

   import Data.Numbers.Primes   sumaDePrimos :: Int -> [[Int]] sumaDePrimos 0 = [[0]] sumaDePrimos n = aux n ys     where ys = reverse $ takeWhile (<=n) primes           aux _ [] = []           aux n (x:xs) | x > n     = aux n xs                        | x == n    = [n] : aux n xs                        | otherwise = map (x:) (aux (n-x) (x:xs)) ++ aux n xs

   Responder