primalitytesting Batch , stdin/stdout

Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

primalitytesting.html

Given a number 0 < n < 100, and on the following line n numbers 0 < D₁, D₂, D₃, ..., D_n < 1,000, for each D_i in sequence output "D_i is a prime number." if D_i is prime and "D_i is a composite number." if D_i is not prime.

Sample Input 1

2
1 3

Sample Output 1

1 is a composite number.
3 is a prime number.

Sample Input 2

3
2 5 6

Sample Output 2

2 is a prime number.
5 is a prime number.
6 is a composite number.

Subtasks and Limits

Subtask	Score	#TC	Time	Memory	Scoring
1	100	5	1s	32MB	Average
2	0	2	1s	32MB	Average

Judge Compile Command

g++-8 ans.cpp -o primalitytesting -Wall -Wshadow -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512