làm bằng c++ mình đnag cần gấp ai làm đc mình vote 5 sao

`Code:`

#include<bits/stdc++.h>
#define ll long long int
using namespace std;

bool snt(ll n) {
if (n < 2) return false;

vector <ll> primes(sqrt(n) + 1, true);

for (ll p = 2; p * p <= sqrt(n); ++p) {

if (primes[p]) {

for (long long i = p * p; i <= sqrt(n); i += p)
primes[i] = false;
}
}

return primes[n];
}

bool scp(ll n){
ll x = sqrt(n);
if (x * x == n) return true;
return false;
}

ll n;

void solve(){
cin >> n;
ll cnt = 0;
for (int i = 0; i < n; i++){
ll a; cin >> a;
if (scp(a) && snt(sqrt(a))) cnt++;
}
cout << cnt << "\n";
}

int main(){
freopen("UOC.INP","r",stdin);
freopen("UOC.OUT","w",stdout);
solve();
return 0;
}

$\text{#KL0112}$

#include <bits/stdc++.h>
#define ll long long

const ll nmax = 1e7 + 7;

using namespace std;
bool f[nmax];
void sangnt() 
{
    memset(f, true, sizeof(f)); 
    f[0] = f[1] = false;
    for (int i = 2; i * i <= nmax; i++)
    {
        if (f[i])
            for (int j = i * i; j <= nmax; j += i) 
                f[j] = false;
    }
}

bool scp(ll n)
{
    ll k=sqrt(n);
    if(k*k==n) return true;
    else return false;
}

int main()
{
    sangnt();
    ll n,dem=0;
    cin>>n;
    while(n--)
    {
        ll a;
        cin>>a;
        if(scp(a))
        {
            ll k=sqrt(a);
            if(f[k]) dem++;
        }
    }
    cout<<dem;
}