7-89 1029 素数的和

#include <algorithm>
#include <cmath>
#include <cstdint>
#include <iomanip>
#include <iostream>
#include <limits>
#include <numeric>
#include <string>
#include <unordered_map>
#include <utility>
#include <vector>

using i32 = std::int32_t;
using i64 = std::int64_t;
using u32 = std::uint32_t;
using u64 = std::uint64_t;
using pii = std::pair<i32, i32>;
using pll = std::pair<i64, i64>;
using vi = std::vector<i32>;
using vll = std::vector<i64>;
using vpii = std::vector<pii>;
using vpll = std::vector<pll>;

void solve();

int main()
{
    std::cin.tie(nullptr)->sync_with_stdio(false);
    solve();
}

bool is_prime(i32 n)
{
    if (n <= 1)
    {
        return false;
    }
    for (i32 i = 2; i * i <= n; ++i)
    {
        if (n % i == 0)
        {
            return false;
        }
    }
    return true;
}

void solve()
{
    i32 sum = 0;
    i32 n;
    while (std::cin >> n)
    {
        if (n <= 0)
        {
            std::cout << sum << std::endl;
            sum = 0;
        }
        if (is_prime(n))
        {
            sum += n;
        }
    }
}