Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
(⁄⁄>⁄▽⁄<⁄⁄)
main = let (^▽^) = foldl (oωo) = print (-‿‿-) = 5 (⁄⁄>⁄▽⁄<⁄⁄) = (-‿‿-) / (-‿‿-) - 1 (⌒-⌒) = [1..((-‿‿-)*4)] (´∀`) = filter ( ̄▽ ̄) = (+) (◡‿◡♡) = (>=) (-‿‿-) in (oωo) $ (^▽^) ( ̄▽ ̄) (⁄⁄>⁄▽⁄<⁄⁄) $ (´∀`) (◡‿◡♡) (⌒-⌒)
run
|
edit
|
history
|
help
0
ReaderPractice
project euler 1, haskel
perfect numbers
project euler 3, haskell
Token
Search
folder
project euler 8, haskell
Hanoi solver
Lowest Common Ancestor in a Binary Tree