fork download
copy 
  1. sumarLista :: [Int] -> Int
  2. sumarLista = sum
  3.  
  4. esPrimo :: Int -> Bool
  5. esPrimo n
  6.     | n < 2 = False
  7.     | otherwise = all (\x -> n `mod` x /= 0) [2..floor (sqrt (fromIntegral n))]
  8.  
  9. fibonacci :: Int -> Int
  10. fibonacci 0 = 0
  11. fibonacci 1 = 1
  12. fibonacci n = fibonacci (n - 1) + fibonacci (n - 2)
  13.  
  14. main :: IO ()
  15. main = do
  16.     -- Prueba de sumarLista
  17.     let lista = [1, 2, 3, 4, 5]
  18.     putStrLn ("Suma de la lista " ++ show lista ++ ": " ++ show (sumarLista lista))
  19.  
  20.     -- Prueba de esPrimo
  21.     let numero = 7
  22.     putStrLn ("¿Es " ++ show numero ++ " primo? " ++ show (esPrimo numero))
  23.  
  24.     -- Prueba de Fibonacci
  25.     let n = 10
  26.     putStrLn ("El " ++ show n ++ "° número de Fibonacci es: " ++ show (fibonacci n))
  27.  
Success #stdin #stdout 0s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
Suma de la lista [1,2,3,4,5]: 15
¿Es 7 primo? True
El 10° número de Fibonacci es: 55
https://ideone.com/95dP5U
language:
Haskell (ghc 8.4.4)
created:
13 hours ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!