Untitled
unknown
plain_text
a year ago
1.1 kB
0
Indexable
Never
import Data.List myInt = 5 double :: Integer -> Integer double x = x+x triple :: Integer -> Integer triple x = x+x+x i0 = let x = myInt in [1..x] i1 = permutations i0 maxim :: Integer -> Integer -> Integer maxim x y = if (x > y) then x else y max3 :: Integer -> Integer -> Integer -> Integer max3 x y z = let u = maxim x y in maxim u z max3' :: Integer -> Integer -> Integer -> Integer max3' x y z = let u = if (x > y) then x else y in if (u > z) then u else z max4 :: Integer -> Integer -> Integer -> Integer -> Integer max4 x y z t = let u = max3 x y z in maxim u t ver :: Integer -> Integer -> Integer -> Integer -> Bool ver x y z t = let u = max4 x y z t in u == maxim x u && u == maxim y u && u == maxim z u && u == maxim t u f1 :: Integer -> Integer -> Integer f1 x y = let u = x*x; v = y*y in u + v f2 :: Integer -> [Char] f2 x = if (x`mod`2 == 0) then "par" else "impar" f3 :: Integer -> Integer f3 x = if (x == 0) then 1 else let u = let y = x - 1 in f3 y in x * u f4 :: Integer -> Integer -> Bool f4 x y = let u = 2*y in x == maxim x u