Sgu 113

113. Nearly prime numbers

time limit per test: 0.25  sec. memory limit per test: 4096 KB

 

Nearly prime number is an integer positive number for which it is possible to find such primes P₁ and P₂ that given number is equal to P₁*P₂. There is given a sequence on N integer positive numbers, you are to write a program that prints “Yes” if given number is nearly prime and “No” otherwise.

 

Input

Input file consists of N+1 numbers. First is positive integer N (1£N£10). Next N numbers followed by N. Each number is not greater than 10⁹. All numbers separated by whitespace(s).

 

Output

Write a line in output file for each number of given sequence. Write “Yes” in it if given number is nearly prime and “No” in other case.

 

Sample Input

1
6

Sample Output

Yes

---

Author	: Michael R. Mirzayanov
Resource	: PhTL #1 Training Contests
Date	: Fall 2001

#include <iostream>
#include <cstdio>
#include <string>
#include <sstream>
#include <memory>
#include <algorithm>
using namespace std;
int prv[50005], pri[50005];
int main(){
    int k = 0;
    for (int i = 2; i < 41000;i++)
    if (!prv[i])
    for (int j = i*i; j < 41000; j += i)
        if (!prv[j])prv[j] = 1;
        for (int i = 2; i < 41000; i++)if (!prv[i])pri[k++] = i;
    int n;
    cin >> n;
    while (n--){
        int x,t;
        cin >> x;
        if (x <= 0){ cout << "No\n"; continue; }
        int flag = 0;
        for (int i = 0; i < k; i++)
            while (x % pri[i] == 0)x = x / pri[i], flag++;
            if (x!=1)flag++;
        if (flag==2)printf("Yes\n"); else printf("No\n");
    }
}