B. T-primes

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.

Input

The first line contains a single positive integer, n (1 ≤ n ≤ 105), showing how many numbers are in the array. The next line contains n space-separated integers xi (1 ≤ xi ≤ 1012).

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.

Output

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

题目大意：对于输入的数字，判断它是否有三个因子。

思路：求该数是否为素数，如果是并且b的平方==a，则就是t素数；

答案：

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,i,j;
	long long a,b;
	cin>>n;
	for(i=1; i<=n; i++)
	{
		cin>>a;
		b = sqrt(a);
		for(j=2; j*j<=b; j++)
		{
			if( b%j==0 )
				break;
		}
		if(j*j>b && b*b==a && a>1)
		{
			cout<<"YES"<<endl;
		}
		else
		{
			cout<<"NO"<<endl;
		}
	}
	return 0;
}