変な処理があれば修正してください。
times 0 action = return ()
times n action = action >> times (n-1) action
main = do
5 `times` putStrLn "Hello World!"
main = putStr $ "おっぱい！" >> "Hello World!\n"
import System.Environment
times 0 action = return ()
times n action = action >> times (n-1) action
main = do
x <- getArgs
(read (x !! 0)) `times` putStrLn "Hello World!"
main = do
mapM_ putStrLn (map fizzBuzz [1..100])
fizzBuzz :: Integer -> String
fizzBuzz n
| n `mod` 15 == 0 = "FizzBuzz"
| n `mod` 5 == 0 = "Buzz"
| n `mod` 3 == 0 = "Fizz"
| otherwise = show n
primesTo m = 2 : sieve [3, 5..m] where
sieve [] = []
sieve (p:xs) = p : sieve (xs `minus` [p*p, p*p+2*p..m])
minus (x:xs) (y:ys) = case (compare x y) of
LT -> x : minus xs (y:ys)
EQ -> minus xs ys
GT -> minus (x:xs) ys
minus xs _ = xs
main = do
print $ primesTo (floor 1e6)
isleap :: Integer -> Bool
isleap y
| y `mod` 400 == 0 = True
| y `mod` 100 == 0 = False
| y `mod` 4 == 0 = True
| otherwise = False
main = do
putStrLn "西暦を入力してください"
x <- getLine
putStrLn (x ++ "年はうるう年" ++ if isleap(read(x)) then "です" else "ではありません" )
import System.Environment
fibo = 0 : 1 : zipWith (+) fibo (tail fibo)
main = do
x <- getArgs
putStrLn (show (fibo !! read (x !! 0)))
pow :: Integer -> Integer -> Integer
pow _ 0 = 1
pow 0 _ = 0
pow a b = a * pow a (b-1)
main = do
putStrLn (show (pow 2 10))
pow :: Integer -> Integer -> Integer
pow 0 _ = 0
pow _ 0 = 1
pow a b = pow' 1 a b
where
pow' x a 0 = x
pow' x a b
| even b = pow' x (a*a) (div b 2)
| otherwise = pow' (x*a) a (b-1)
main = do
putStrLn (show (pow 2 1000007))
quicksort :: (Ord a) => [a] -> [a]
quicksort [] = []
quicksort (x:xs) =
let smallerSorted = quicksort[a | a<-xs, a <= x]
biggerSorted = quicksort[a | a<-xs, a > x]
in smallerSorted ++ [x] ++ biggerSorted
main :: IO()
main = print $ quicksort [5, 7, 9, 2, 1, 3, 8, 4, 6, 0]
toAho :: Integer -> String
toAho x | mod x 3 == 0 || elem '3' s = "Aho"
| otherwise = s
where s = show x
main :: IO ()
main = mapM_ (putStr . (++" ") . toAho) [1..100]