Sum of Primes

    1#include <bits/stdc++.h>
    2using namespace std;
    3using ll = long long;
    4using i128 = __int128;
    5const int inf = 1e9;
    6const ll INF = 1e18; //❄️
    7const int MM = 1e5 + 5;
    8int main() {
    9    ios::sync_with_stdio(0); cin.tie(0);
    10    vector<bool> prime(MM, true);
    11    for (int i = 2; i * i <= MM; i++) {
    12        if (prime[i]) {
    13            for (int j = i * i; j < MM; j += i) prime[j] = 0;
    14        }
    15    }
    16    vector<int> psa(MM);
    17    for (int i = 2; i < psa.size(); i++) {
    18        psa[i] = (prime[i] ? psa[i - 1] + i : psa[i - 1]);
    19    }
    20    int t = 5;
    21    while (t--) {
    22        int n; cin >> n;
    23        cout << psa[n] << '\n';
    24    }
    25    return 0;
    26}