Run Code

API

Code Wall

Misc

Feedback

Login

Theme

Privacy

Patreon
equiv_strings
Title of this code ghc 7.6.3 split xs = (take n xs, drop n xs) where n = div (length xs) 2 equiv xs ys = (xs == ys)  (equiv a1 b1 && equiv a2 b2)  (equiv a1 b2 && equiv a2 b1) where (a1,b1) = split xs (a2,b2) = split ys main = do a < getLine b < getLine let str = if equiv a b then "YES" else "NO" putStrLn str
run

edit

history

help
0
ReaderPractice
Perfect numbers
appending and prepending list
Modeling algebraic understanding with Haskell in KS1
Lowest Common Ancestor in a Binary Tree
(‿‿)
project euler 5, haskell
tried some polynoms 2: now with some `*` and foldr(p)
Derive type class for parameterized data type
Test