Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Split into n distinct parts
--ghc 7.10 main = print $ split 4 50 split m n = split' 0 m n where split' t 0 n = [] split' t m n | n < t*m + m*(m-1)`div`2 = [] split' t 1 n = [[n]] split' t m n = [p:q | p <- [t..n], q <- split' (p+1) (m-1) (n-p)]
run
|
edit
|
history
|
help
0
Welcome
(Int,Int) -> Bool plot
Square root
Modular arithmetic with propagating type-checked modulus
project euler 4, haskell
haskell
Producter
project euler 6, haskell
haskell_exam
Lowest Common Ancestor in a Binary Tree