Submit solution
Points:
3
Time limit:
2.0s
Memory limit:
64M
Problem type
Allowed languages
Ada, Assembly, Awk, Brain****, C, C#, C++, COBOL, CommonLisp, D, Dart, F#, Forth, Fortran, Go, Groovy, Haskell, Intercal, Java, JS, Kotlin, Lisp, Lua, Nim, ObjC, OCaml, Octave, Pascal, Perl, PHP, Pike, Prolog, Python, Racket, Ruby, Rust, Scala, Scheme, Sed, Swift, TCL, Text, Turing, VB, Zig
DWITE Online Computer Programming Contest, October 2007, Problem 1
In mathematics, a prime number is a natural number which has exactly two distinct natural number divisors: and itself. For example:
,
,
,
,
,
,
,
are the first eight prime numbers. A vanilla flavour programming problem is to figure out if a given number is a prime or not.
The input will contain a single integer. .
The output will contain a single line, stating if the supplied integer is prime
or not
.
Sample Input 1
-1
Sample Output 1
not
Sample Input 2
1
Sample Output 2
not
Sample Input 3
2
Sample Output 3
prime
Comments