DWITE Online Computer Programming Contest
November 2007
Problem 1
Not Quite Prime
In mathematics, a semiprime number is a natural number that is the product of exactly two prime numbers. For example: 4, 6, 9, 10, 14, 15, 21, 22 are the first eight semiprime numbers. Given a set of numbers, one should be able to identify semiprime numbers contained in that set.
The input file DATA1.txt will contain five integers, one per line. 1 <= N <= 1000.
The output file OUT1.txt will contain five lines, stating if the supplied integers were "semiprime" or "not". Use the exact string output, all lower case, without quotes.
Sample Input:
2 3 4 5 6
Sample Output:
not not semiprime not semiprime