Skip to content

Commit f06f9f6

Browse files
committed
STY use . instead of $
1 parent e957d34 commit f06f9f6

File tree

5 files changed

+5
-5
lines changed

5 files changed

+5
-5
lines changed

euler001.hs

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,2 +1,2 @@
1-
main = print $ sum $ filter multiple3or5 [1..999]
1+
main = print . sum $ filter multiple3or5 [1..999]
22
where multiple3or5 = (\n -> n `rem` 3 == 0 || n `rem` 5 == 0)

euler002.hs

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
import Data.List
22

3-
main = print $ sum [x | x <- takeWhile (< 4000000) fibs, even x]
3+
main = print . sum $ [x | x <- takeWhile (< 4000000) fibs, even x]
44
where fibs = unfoldr (\(a, b) -> Just (a, (b, a+b))) (1, 1)
55

66
{-

euler003.hs

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
main = print $ maximum $ prime_factors 600851475143
1+
main = print . maximum . prime_factors $ 600851475143
22

33
prime_factors :: (Integral a) => a -> [a]
44
prime_factors 1 = []

euler004.hs

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,3 +1,3 @@
1-
main = print $ maximum palindromes
1+
main = print . maximum $ palindromes
22
where palindromes = [x*y | x <- [100..999], y <- [x..999],
33
(reverse $ show (x*y)) == (show (x*y))]

euler005.hs

+1-1
Original file line numberDiff line numberDiff line change
@@ -1,6 +1,6 @@
11
import Data.List
22

3-
main = print $ product $ foldl1 lcm_primes $ map prime_factors [1..20]
3+
main = print . product $ foldl1 lcm_primes $ map prime_factors [1..20]
44

55
lcm_primes :: (Eq a) => [a] -> [a] -> [a]
66
lcm_primes a b = a ++ (b \\ a)

0 commit comments

Comments
 (0)