codeforces 230/B 素数变形计

http://codeforces.com/problemset/problem/230/B

B. T-primes

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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 nspace-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 %I64dspecifier.

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 test(s)

input

3
4 5 6

output

YES
NO
NO

Note

The given test has three numbers. The first number 4 has exactly three divisors — 1, 2 and 4, thus the answer for this number is "YES". The second number 5 has two divisors (1 and 5), and the third number 6 has four divisors (1, 2, 3, 6), hence the answer for them is "NO".

这道题就是求只有三个因数的数。。。

一个数他的算术平方根是质数，那么它一定是满足要求的数。。。。

#include <iostream>
#include <string.h>
#include <cmath>
#include <stdio.h>
using namespace std;
int vis[1000005];
int main()
{
    memset(vis, 0, sizeof(vis));
    vis[1] = 1;
    for(int i = 2; i <= 1000000; i++)
    {
        if(vis[i])
            continue;
        for(int j = 2 * i; j <= 1000000; j += i)
            vis[j] = 1;
    }
    int n;
    scanf("%d", &n);
    for(int i = 0; i < n; i++)
    {
        long long  x;
        scanf("%I64d", &x);
        long long  y = sqrt(x * 1.0);
        if(y *y == x && !vis[(int)y])printf("YES\n");
        else printf("NO\n");
    }
    return 0;
}