Codeforces-Solutions/230B_TPrime.cpp at main · ishaanjav/Codeforces-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
/*
 * Created by ishaanjav
 * github.com/ishaanjav
 * Codeforces Solutions: https://github.com/ishaanjav/Codeforces-Solutions
 */

#include <iostream>
using namespace std;

#define ll long long
#define pb push_back
#define mp make_pair

#include <string>
#include <vector>
typedef vector<int> vi;
//#include <algorithm>
//#include <set>
//#include <map>
//#include <unordered_set>
//#include <unordered_map>
#include <cmath>
//#include <cstring>
//#include <sstream>
//#include <stack>
//#include <queue>
bool isprime(ll n) {
    for (ll i = 3; i <= sqrt(n); i++)
        if (n % i == 0) return 0;
    return 1;
}
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    ll nam;
    cin >> nam;

    for (ll tr = 0; tr < nam; tr++) {
        ll n;
        cin >> n;
        if (n == 4 || (n != 1 && (ll)(sqrt(n)) % 2 != 0 && isprime((ll)(sqrt(n)))) && (ll)(sqrt(n)) * (ll)(sqrt(n)) == n)
            cout << "YES\n";
        else
            cout << "NO\n";
    }
}