Run Code
|
API
|
Code Wall
|
Users
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
divisibleBy a b
--ghc 8.0.1 /opt/ghc/8.0.1/lib/ghc-8.0.0.20160127/ divisibleBy a b = (mod a b) == 0 main = do print(divisibleBy 10 2) print(divisibleBy 19 2) print(divisibleBy (-4) 2)
run
|
edit
|
history
|
help
0
Please
log in
to post a comment.
project euler 4, haskell
Invert a monotonic function
Sierpinski Triangle as lazy list
project euler 5, haskell
haskell fibonacci
hard 1.1
Is Preorder BST
Modular arithmetic with propagating type-checked modulus
State
Reader
Please log in to post a comment.