Submission #1230691

---

Source Code Expand

import Control.Applicative
import Control.Monad
import Data.List


primes :: [Integer]
primes = sieve [2..]
  where
    sieve (p:xs) = p : sieve [x|x <- xs, x `mod` p > 0]

isPrime k = null [ x | x <- [2..k - 1], k `mod`x  == 0]


main :: IO ()
main = do
  n <- readLn
  putStrLn $ if isPrime n then "YES" else "NO"

Submission Info

Judge Result