help me help me :))

helpmeeeeeeeeeeeeeeeeee

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 1e6 + 5;

vector<int> prime(MAXN + 1, 1);

void sieve() {
    prime[0] = prime[1] = 0;

    for (int i = 1; i * i <= MAXN; i++) 
        if (prime[i]) 
            for (int j = i * i; j <= MAXN; j += i) 
                prime[j] = 0;
    
    for (int i = 1; i <= MAXN; i++) prime[i] += prime[i - 1];
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);   
    
    sieve();

    int t;
    cin >> t;
    while (t--) {
        int n;
        cin >> n;
        cout << prime[n] << '\n';
    }

    return 0;
}

#include<bits/stdc++.h>
#define ll long long
#define ios ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#pragma GCC optimize("O3","unroll-loops")
#pragma GCC optimize("Ofast")
using namespace std;
//Nhan :))))
const ll N=1e6;
bool snt[N];
void sang(int n)
{         // sàng nguyên tố
    memset(snt,true,N);
    snt[1]=false;
    snt[0]=false;
    for(int i=2;i<=sqrt(n);i++)
        if(snt[i])
            for(int j=i*i;j<=n;j=j+i)
            snt[j]=false;
}
ll a[N];
int main()
{
    ios
    sang(N);
    //sàng tính toán :)
    ll d=0;
    for(int i=1;i<=N;i++)
    {
        if(snt[i]) d++;
        a[i]=d;
    }

    ll t;
    cin>>t;
    while(t--)
    {
        ll r;
        cin>>r;
        cout<<a[r]<<"\n";
    }
    return 0;
}