Description
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 ≤ 109).
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.
Sample Input
Sample Output
分析:
这道题目是找出除了1,和本身外,仅有一个因数的数,所以说这个数是一个平方数,而且他的开方是一个素数;
我们通过遍历(i = 2; i<=sqrt(a); i++)来判断是否是素数;
代码:
#include<stdio.h>
#include<math.h>
int main()
{
int n,i,j;
long long a,b;
scanf("%d",&n);
for(i=1; i<=n; i++)
{
scanf("%lld",&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)
{
printf("YES\n");
}else
{
printf("NO\n");
}
}
return 0;
}