We use cookies to improve your experience, for authentication and to ensure that we show you advertising that is relevant to you. If you continue without changing your settings, we'll assume that you are happy to receive all cookies on Ideone website. However, if you wish, you can change cookie settings of your browser at any time.
language:
Haskell (ghc-7.4.1)
date:
322 days 18 hours ago
link:
visibility:
publicprivateuser'sdeleted
1
2
3
4
5
6
7
8
9
import Control.Monad
isPrime ::Integer->Bool
isPrime n =all(\i ->(n `rem` i)/=0)$ takeWhile (\i -> i^2<= n)[2..]
main ::IO()
main =do n <-readLn
forM_[1..n]$ \i ->putStrLn(show(i)++" is a prime? "++show(isPrime i))
result:
Success
time: 0.02s
memory: 3720 kB
returned value: 0
20
1 is a prime? True
2 is a prime? True
3 is a prime? True
4 is a prime? False
5 is a prime? True
6 is a prime? False
7 is a prime? True
8 is a prime? False
9 is a prime? False
10 is a prime? False
11 is a prime? True
12 is a prime? False
13 is a prime? True
14 is a prime? False
15 is a prime? False
16 is a prime? False
17 is a prime? True
18 is a prime? False
19 is a prime? True
20 is a prime? False
