Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Test
--ghc 7.10 g n = n * (n + 1) * 5 `div` 2 f n | n == 1 = 10 | otherwise = f (n - 1) + 5 + g n lei n = f n `div` 100 bani n = f n `mod` 100 main = do line <- getLine putStrLn $ show (lei (read line)) ++ " " ++ show (bani (read line))
run
|
edit
|
history
|
help
0
haskell fibonacci
Is Preorder BST
Haskell Fibonacci Numbers
suffix trie
project euler 6, haskell
ex3
appending and prepending list
mapper
(⁄⁄>⁄▽⁄<⁄⁄)
folder