## DWITE '07 R2 #1 - Not Quite Prime

View as PDF

Points: 5
Time limit: 2.0s
Memory limit: 64M

Problem type
##### DWITE Online Computer Programming Contest, November 2007, Problem 1

In mathematics, a semiprime number is a natural number that is the product of exactly two prime numbers. For example: , , , , , , , 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 will contain five integers, one per line. .

The output will contain five lines, stating if the supplied integers were semiprime or not.

#### Sample Input

2
3
4
5
6

#### Sample Output

not
not
semiprime
not
semiprime

Problem Resource: DWITE

• commented on Dec. 17, 2020, 5:47 p.m.

Why is there only one test case? My first solution shouldn't have passed, but since there's only one case, it happened to be correct.

• commented on March 9, 2019, 9:12 a.m.

This comment is hidden due to too much negative feedback. Show it anyway.

• commented on March 9, 2019, 12:38 p.m. edit 2

are the first eight semiprime numbers

• commented on March 10, 2019, 11:54 a.m.

Thanks