Problema de Ullman

6 Comentarios

1. Haskell

   import Data.List ullman :: (Num a, Ord a) => a -> Int -> [a] -> Bool ullman t k = (<t) . sum . take k . sort

   1 2 3

   import Data.List ullman :: (Num a, Ord a) => a -> Int -> [a] -> Bool ullman t k = (<t) . sum . take k . sort

   Responder

2. Haskell

   ullman :: (Num a, Ord a) => a -> Int -> [a] -> Bool ullman t k xs = [ ys | ys <- (subsequences xs), sum ys < t , length ys == k] /= []

   1 2	ullman :: (Num a, Ord a) => a -> Int -> [a] -> Bool ullman t k xs = [ ys | ys <- (subsequences xs), sum ys < t , length ys == k] /= []

   Responder

3. Haskell

   grupos xs = zip (map (sum) (subsequences xs)) (map (length) (subsequences xs)) ullman t k xs | (t,k) `elem` grupos xs = True | otherwise = False

   1 2 3 4

   grupos xs = zip (map (sum) (subsequences xs)) (map (length) (subsequences xs))   ullman t k xs | (t,k) `elem` grupos xs = True               | otherwise = False

   Responder

4. Haskell

   ullman :: (Num a, Ord a) => a -> Int -> [a] -> Bool ullman t k xs = any (<t) [ sum ys | ys <- (subcLongk xs k)] subcLongk xs k = [ys | ys <- subsequences xs , length ys == k]

   1 2 3 4

   ullman :: (Num a, Ord a) => a -> Int -> [a] -> Bool ullman t k xs = any (<t) [ sum ys | ys <- (subcLongk xs k)]   subcLongk xs k = [ys | ys <- subsequences xs , length ys == k]

   Responder

5. Haskell

   ullman :: (Num a, Ord a) => a -> Int -> [a] -> Bool ullman t k xs =[ ys | ys <- take k xs , sum (take k xs) < t]/=[]

   1 2	ullman :: (Num a, Ord a) => a -> Int -> [a] -> Bool ullman t k xs =[ ys | ys <- take k xs , sum (take k xs) < t]/=[]

   Responder

6. Haskell

   ullman :: (Num a, Ord a) => a -> Int -> [a] -> Bool ullman t k xs = if [ys | ys <- subsequences xs, length(ys)==k, sum(ys)<t] == [] then False else True

   1 2	ullman :: (Num a, Ord a) => a -> Int -> [a] -> Bool ullman t k xs = if [ys | ys <- subsequences xs, length(ys)==k, sum(ys)<t] == [] then False else True

   Responder