A8717 | $T-primes$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

We know that prime numbers are positive integers that have exactly two distinct positive divisors. Similarly, we'll call a positive integer $t$ Т-prime, if $t$ has exactly three distinct positive divisors. You are given an array of $n$ positive integers. For each of them determine whether it is Т-prime or not.

The first line contains a single positive integer, $n$ ( $1<=n<=10^{5}$ ), showing how many numbers are in the array. The next line contains $n$ space-separated integers $x_{i}$ ( $1<=x_{i}<=10^{12}$ ). Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is advised to use the cin, cout streams or the %I64d specifier.

Print $n$ lines: the $i$ -th line should contain "YES" (without the quotes), if number $x_{i}$ is Т-prime, and "NO" (without the quotes), if it isn't.

输入 #1

3
4 5 6

输出 #1

YES
NO
NO

C++ 编辑器

输入

输出