nsmaciej · February 16, 2013 22:03
diff --git a/q3.hs b/q3.hs
 isPrime :: Int -> Bool
 isPrime u
      | u < 2  = False
      | u == 2 = True
      | otherwise = not $ maximum [ mod u x == 0 | x <- [2..s]] where s = u - 1

 main = do y <- readLn :: IO Int
          mapM_ print $ filter (\x -> mod y x == 0 && isPrime x) [1..y]
	isPrime :: Int -> Bool
	isPrime u
	\| u < 2 = False
	\| u == 2 = True
	\| otherwise = not $ maximum [ mod u x == 0 \| x <- [2..s]] where s = u - 1

	main = do y <- readLn :: IO Int
	mapM_ print $ filter (\x -> mod y x == 0 && isPrime x) [1..y]