Terminaciones de Fibonacci

4 Comentarios

1. Haskell

   sucFinalesFib :: [(Integer,Integer)] sucFinalesFib = [(a,b) | (a,b) <- zip [0..] sucFib , show a `isSuffixOf` show b] where sucFib = 0 : 1 : zipWith (+) sucFib (tail sucFib)

   1 2 3 4 5

   sucFinalesFib :: [(Integer,Integer)] sucFinalesFib =   [(a,b) | (a,b) <- zip [0..] sucFib          , show a `isSuffixOf` show b]   where sucFib = 0 : 1 : zipWith (+) sucFib (tail sucFib)

   Responder

2. Haskell

   import Data.List (isSuffixOf) sucFinalesFib :: [(Integer,Integer)] sucFinalesFib = (filter esTerminacion . zip [0..]) fibs where esTerminacion (n,x) = show n `isSuffixOf` show x fibs :: [Integer] fibs = 0 : scanl (+) 1 fibs

   1 2 3 4 5 6 7 8

   import Data.List (isSuffixOf)   sucFinalesFib :: [(Integer,Integer)] sucFinalesFib = (filter esTerminacion . zip [0..]) fibs   where esTerminacion (n,x) = show n `isSuffixOf` show x   fibs :: [Integer] fibs = 0 : scanl (+) 1 fibs

   Responder

3. Haskell

   sucFinalesFib :: [(Integer,Integer)] sucFinalesFib = [(n,x) | (n,x) <- zip [0..] fibs , esFinal x n] fibs :: [Integer] fibs = 0 : 1 : zipWith (+) fibs (tail fibs) esFinal :: Integer -> Integer -> Bool esFinal x n | x == n = True | x > n = show n == drop (length (show x) - length (show n)) (show x) | otherwise = False

   1 2 3 4 5 6 7 8 9 10 11 12 13

   sucFinalesFib :: [(Integer,Integer)] sucFinalesFib =   [(n,x) | (n,x) <- zip [0..] fibs          , esFinal x n]   fibs :: [Integer] fibs = 0 : 1 : zipWith (+) fibs (tail fibs)   esFinal :: Integer -> Integer -> Bool esFinal x n   | x == n    = True   | x > n     = show n == drop (length (show x) - length (show n)) (show x)   | otherwise = False

   Responder

4. Haskell

   sucFinalesFib :: [(Integer,Integer)] sucFinalesFib = [(n,x) | n <- [0..] , let x = genericIndex fibs n , finales n x] fibs :: [Integer] fibs = aux 0 1 where aux x y = x : aux y (x+y) finales :: Integer -> Integer -> Bool finales x y = x' == drop (length y' - length x') y' where x' = show x y' = show y

   1 2 3 4 5 6 7 8 9 10 11 12 13

   sucFinalesFib :: [(Integer,Integer)] sucFinalesFib = [(n,x) | n <- [0..]                        , let x = genericIndex fibs n                        , finales n x]   fibs :: [Integer] fibs = aux 0 1   where aux x y = x : aux y (x+y)   finales :: Integer -> Integer -> Bool finales x y = x' == drop (length y' - length x') y'   where x' = show x         y' = show y

   Responder