Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
ReaderPractice
import Control.Applicative import Data.Maybe main = do mapM_ print [xs, ys, zs, z' 1] mapM_ print [x1, x2, x3 2] print $ summed (4, 9) mapM (print . bolt) [1, 3, 4, 7, 8, 9] x = [1, 2, 3] y = [4, 5, 6] z = [7, 8, 9] xs = lookup 3 $ zip x y ys = lookup 6 $ zip y z zs = lookup 4 $ zip x z z' n = lookup n $ zip x z x1 = (,) <$> xs <*> ys x2 = (,) <$> ys <*> zs x3 n = (,) <$> z' n <*> z' n summed :: Num c => (c, c) -> c summed = uncurry (+) bolt :: Integer -> Bool bolt = (&&) <$> (>3) <*> (<8)
run
|
edit
|
history
|
help
0
ad-hoc braille dot rendering
Split into n distinct parts
ex3
Pi
project euler 2, haskell
project euler 1, haskel
Sierpinski Triangle as lazy list
Factors of a number, prime numbers
Haskell remove item by index
Métodos simples