求10的10次方内素数的个数与素数和的模板

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll check(ll v, ll n, ll ndr, ll nv) {
   
    return v >= ndr ? (n / v - 1) : (nv - v);
}
ll primenum(ll n) // O(n^(3/4))
{
   
  ll r = (ll)sqrt(n);
  ll ndr = n / r;
  assert(r*r <= n && (r+1)*(r+1) > n);
  ll nv = r + ndr - 1;
  std::vector<ll> S(nv+1);
  std::vector<ll> V(nv+1);
  for(ll i=0;i<r;i++) {
   
    V[i