6 lines
No EOL
136 B
Haskell
6 lines
No EOL
136 B
Haskell
divisible x y = x `mod` y == 0
|
|
|
|
smallest x = if all (divisible x) [2..20] then x else smallest (succ x)
|
|
|
|
main = do
|
|
print(smallest 1) |