Problem:
素数の和
p(i)
を小さい方から
i
番目の素数とします。例えば、7 は、2, 3, 5, 7 と小さい方から 4 番目の素数なので、
p(4) = 7
です。
n
が与えられたとき、
i = 1
から
n
までの
p(i)
の和
s
s = p(1) + p(2) +
....
+ p(n)
を出力するプログラムを作成してください。例えば、
n = 9
のとき、
s = 2 + 3 + 5 + 7 + 11 + 13 + 17 + 19 + 23 = 100
となります。
Input
複数のデータセットが与えられます。各データセットに整数
n
(
n
≤ 10000) が与えられます。
n
が 0 のとき入力の最後とします。データセットの数は 50 を超えません。
Output
各データセットの
n
に対して、
s
を１行に出力して下さい。
Sample Input
2
9
0
Output for the Sample Input
5
100

Submitted solutions:

code_snippet: #include <stdio.h>
#include <stdlib.h>
#include <math.h>
int sushu(int a)
{
    int i;
    for(i=2; i<=sqrt(a); i++)
    {
        if(a%i==0)
            return 0;
    }
    return 1;
}
int main()
{
    int n,i,j,t;
    while(~scanf("%d",&n)&&n!=0)
    {
        i=0;
        t=0;
            for(j=2;i<=n-1;j++)
            {
                if(sushu(j)==1)
                {
                    i++;
                    t=t+j;
                }
            }
            printf("%d\n",t);
    }
    return 0;
}
accuracy: 1
time_ms: 190
memory_kb: 2820
final_rank: 15

code_snippet: #include<bits/stdc++.h>
using namespace std;
int main(){
    int n, sum;
    bool sosu[300010];
    while(cin >> n, n!=0){
        sum = 0;
        memset(sosu, false, sizeof(sosu));
        for(int i=2;i<200000;i++){
            if(!sosu[i]){
                sum += i;
                n--;
                if(n == 0) break;
                for(int j=i+i;j<300000;j+=i){
                    sosu[j] = true;
                }
            }
        }
        cout << sum << endl;
    }
    return(0);
}
accuracy: 1
time_ms: 30
memory_kb: 3380
final_rank: 4

code_snippet: #line 1 "/home/maspy/compro/library/my_template.hpp"
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using pi = pair<ll, ll>;
using vi = vector<ll>;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;

template <class T>
using vc = vector<T>;
template <class T>
using vvc = vector<vc<T>>;
template <class T>
using vvvc = vector<vvc<T>>;
template <class T>
using vvvvc = vector<vvvc<T>>;
template <class T>
using vvvvvc = vector<vvvvc<T>>;
template <class T>
using pq = priority_queue<T>;
template <class T>
using pqg = priority_queue<T, vector<T>, greater<T>>;

#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define vv(type, name, h, ...) \
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define vvv(type, name, h, w, ...)   \
  vector<vector<vector<type>>> name( \
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
#define vvvv(type, name, a, b, c, ...)       \
  vector<vector<vector<vector<type>>>> name( \
      a, vector<vector<vector<type>>>(       \
             b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))

// https://trap.jp/post/1224/
#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)
#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)
#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)
#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))
#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)
#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)
#define FOR4_R(i, a, b, c) for (ll i = (b)-1; i >= ll(a); i -= (c))
#define overload4(a, b, c, d, e, ...) e
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FOR_R(...) \
  overload4(__VA_ARGS__, FOR4_R, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)

#define FOR_subset(t, s) for (ll t = s; t >= 0; t = (t == 0 ? -1 : (t - 1) & s))
#define all(x) x.begin(), x.end()
#define len(x) ll(x.size())
#define elif else if

#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second

#define stoi stoll

ll SUM(vector<int> &A) {
  ll sum = 0;
  for (auto &&a: A) sum += a;
  return sum;
}

template <typename T>
T SUM(vector<T> &A) {
  T sum = T(0);
  for (auto &&a: A) sum += a;
  return sum;
}

#define MIN(v) *min_element(all(v))
#define MAX(v) *max_element(all(v))
#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))
#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))
#define UNIQUE(x) sort(all(x)), x.erase(unique(all(x)), x.end())

int popcnt(int x) { return __builtin_popcount(x); }
int popcnt(u32 x) { return __builtin_popcount(x); }
int popcnt(ll x) { return __builtin_popcountll(x); }
int popcnt(u64 x) { return __builtin_popcountll(x); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)
int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }
int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }
// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)
int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }
int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }
int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }

template <typename T, typename U>
T ceil(T x, U y) {
  return (x > 0 ? (x + y - 1) / y : x / y);
}

template <typename T, typename U>
T floor(T x, U y) {
  return (x > 0 ? x / y : (x - y + 1) / y);
}

template <typename T, typename U>
pair<T, T> divmod(T x, U y) {
  T q = floor(x, y);
  return {q, x - q * y};
}

ll binary_search(function<bool(ll)> check, ll ok, ll ng) {
  assert(check(ok));
  while (abs(ok - ng) > 1) {
    auto x = (ng + ok) / 2;
    if (check(x))
      ok = x;
    else
      ng = x;
  }
  return ok;
}

template <typename F>
double binary_search_real(F check, double ok, double ng, int iter = 100) {
  FOR(iter) {
    double x = (ok + ng) / 2;
    if (check(x)) {
      ok = x;
    } else {
      ng = x;
    }
  }
  return (ok + ng) / 2;
}

template <class T, class S>
inline bool chmax(T &a, const S &b) {
  return (a < b ? a = b, 1 : 0);
}
template <class T, class S>
inline bool chmin(T &a, const S &b) {
  return (a > b ? a = b, 1 : 0);
}

vi s_to_vi(const string &S, char first_char) {
  vi A(S.size());
  FOR(i, S.size()) { A[i] = S[i] - first_char; }
  return A;
}

template <typename T>
vector<T> cumsum(vector<T> &A, int off = 1) {
  int N = A.size();
  vector<T> B(N + 1);
  FOR(i, N) { B[i + 1] = B[i] + A[i]; }
  if (off == 0) B.erase(B.begin());
  return B;
}

template <typename CNT, typename T>
vc<CNT> bincount(const vc<T> &A, int size) {
  vc<CNT> C(size);
  for (auto &&x: A) { ++C[x]; }
  return C;
}

template <typename T>
vector<int> argsort(const vector<T> &A) {
  // stable
  vector<int> ids(A.size());
  iota(all(ids), 0);
  sort(all(ids),
       [&](int i, int j) { return A[i] < A[j] || (A[i] == A[j] && i < j); });
  return ids;
}

// A[I[0]], A[I[1]], ...
template <typename T>
vc<T> rearrange(const vc<T> &A, const vc<int> &I) {
  int n = len(I);
  vc<T> B(n);
  FOR(i, n) B[i] = A[I[i]];
  return B;
}
#line 1 "/home/maspy/compro/library/other/io.hpp"
// based on yosupo's fastio
#include <unistd.h>

namespace detail {
template <typename T, decltype(&T::is_modint) = &T::is_modint>
std::true_type check_value(int);
template <typename T>
std::false_type check_value(long);
} // namespace detail

template <typename T>
struct is_modint : decltype(detail::check_value<T>(0)) {};
template <typename T>
using is_modint_t = enable_if_t<is_modint<T>::value>;
template <typename T>
using is_not_modint_t = enable_if_t<!is_modint<T>::value>;

struct Scanner {
  FILE *fp;
  char line[(1 << 15) + 1];
  size_t st = 0, ed = 0;
  void reread() {
    memmove(line, line + st, ed - st);
    ed -= st;
    st = 0;
    ed += fread(line + ed, 1, (1 << 15) - ed, fp);
    line[ed] = '\0';
  }
  bool succ() {
    while (true) {
      if (st == ed) {
        reread();
        if (st == ed) return false;
      }
      while (st != ed && isspace(line[st])) st++;
      if (st != ed) break;
    }
    if (ed - st <= 50) {
      bool sep = false;
      for (size_t i = st; i < ed; i++) {
        if (isspace(line[i])) {
          sep = true;
          break;
        }
      }
      if (!sep) reread();
    }
    return true;
  }
  template <class T, enable_if_t<is_same<T, string>::value, int> = 0>
  bool read_single(T &ref) {
    if (!succ()) return false;
    while (true) {
      size_t sz = 0;
      while (st + sz < ed && !isspace(line[st + sz])) sz++;
      ref.append(line + st, sz);
      st += sz;
      if (!sz || st != ed) break;
      reread();
    }
    return true;
  }
  template <class T, enable_if_t<is_integral<T>::value, int> = 0>
  bool read_single(T &ref) {
    if (!succ()) return false;
    bool neg = false;
    if (line[st] == '-') {
      neg = true;
      st++;
    }
    ref = T(0);
    while (isdigit(line[st])) { ref = 10 * ref + (line[st++] & 0xf); }
    if (neg) ref = -ref;
    return true;
  }
  template <class T, is_modint_t<T> * = nullptr>
  bool read_single(T &ref) {
    long long val = 0;
    bool f = read_single(val);
    ref = T(val);
    return f;
  }
  bool read_single(double &ref) {
    string s;
    if (!read_single(s)) return false;
    ref = std::stod(s);
    return true;
  }
  bool read_single(char &ref) {
    string s;
    if (!read_single(s) || s.size() != 1) return false;
    ref = s[0];
    return true;
  }
  template <class T>
  bool read_single(vector<T> &ref) {
    for (auto &d: ref) {
      if (!read_single(d)) return false;
    }
    return true;
  }
  template <class T, class U>
  bool read_single(pair<T, U> &p) {
    return (read_single(p.first) && read_single(p.second));
  }
  template <class A, class B, class C>
  bool read_single(tuple<A, B, C> &p) {
    return (read_single(get<0>(p)) && read_single(get<1>(p))
            && read_single(get<2>(p)));
  }
  template <class A, class B, class C, class D>
  bool read_single(tuple<A, B, C, D> &p) {
    return (read_single(get<0>(p)) && read_single(get<1>(p))
            && read_single(get<2>(p)) && read_single(get<3>(p)));
  }
  void read() {}
  template <class H, class... T>
  void read(H &h, T &... t) {
    bool f = read_single(h);
    assert(f);
    read(t...);
  }
  Scanner(FILE *fp) : fp(fp) {}
};

struct Printer {
  Printer(FILE *_fp) : fp(_fp) {}
  ~Printer() { flush(); }

  static constexpr size_t SIZE = 1 << 15;
  FILE *fp;
  char line[SIZE], small[50];
  size_t pos = 0;
  void flush() {
    fwrite(line, 1, pos, fp);
    pos = 0;
  }
  void write(const char &val) {
    if (pos == SIZE) flush();
    line[pos++] = val;
  }
  template <class T, enable_if_t<is_integral<T>::value, int> = 0>
  void write(T val) {
    if (pos > (1 << 15) - 50) flush();
    if (val == 0) {
      write('0');
      return;
    }
    if (val < 0) {
      write('-');
      val = -val; // todo min
    }
    size_t len = 0;
    while (val) {
      small[len++] = char(0x30 | (val % 10));
      val /= 10;
    }
    for (size_t i = 0; i < len; i++) { line[pos + i] = small[len - 1 - i]; }
    pos += len;
  }
  void write(const string &s) {
    for (char c: s) write(c);
  }
  void write(const char *s) {
    size_t len = strlen(s);
    for (size_t i = 0; i < len; i++) write(s[i]);
  }
  void write(const double &x) {
    ostringstream oss;
    oss << fixed << setprecision(15) << x;
    string s = oss.str();
    write(s);
  }
  void write(const long double &x) {
    ostringstream oss;
    oss << fixed << setprecision(15) << x;
    string s = oss.str();
    write(s);
  }
  template <class T, is_modint_t<T> * = nullptr>
  void write(T &ref) {
    write(ref.val);
  }
  template <class T>
  void write(const vector<T> &val) {
    auto n = val.size();
    for (size_t i = 0; i < n; i++) {
      if (i) write(' ');
      write(val[i]);
    }
  }
  template <class T, class U>
  void write(const pair<T, U> &val) {
    write(val.first);
    write(' ');
    write(val.second);
  }
  template <class A, class B, class C>
  void write(const tuple<A, B, C> &val) {
    auto &[a, b, c] = val;
    write(a), write(' '), write(b), write(' '), write(c);
  }
  template <class A, class B, class C, class D>
  void write(const tuple<A, B, C, D> &val) {
    auto &[a, b, c, d] = val;
    write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d);
  }
  template <class A, class B, class C, class D, class E>
  void write(const tuple<A, B, C, D, E> &val) {
    auto &[a, b, c, d, e] = val;
    write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e);
  }
  template <class A, class B, class C, class D, class E, class F>
  void write(const tuple<A, B, C, D, E, F> &val) {
    auto &[a, b, c, d, e, f] = val;
    write(a), write(' '), write(b), write(' '), write(c), write(' '), write(d), write(' '), write(e), write(' '), write(f);
  }
  template <class T, size_t S>
  void write(const array<T, S> &val) {
    auto n = val.size();
    for (size_t i = 0; i < n; i++) {
      if (i) write(' ');
      write(val[i]);
    }
  }
  void write(i128 val) {
    string s;
    bool negative = 0;
    if(val < 0){
      negative = 1;
      val = -val;
    }
    while (val) {
      s += '0' + int(val % 10);
      val /= 10;
    }
    if(negative) s += "-";
    reverse(all(s));
    if (len(s) == 0) s = "0";
    write(s);
  }
};

Scanner scanner = Scanner(stdin);
Printer printer = Printer(stdout);

void flush() { printer.flush(); }
void print() { printer.write('\n'); }
template <class Head, class... Tail>
void print(Head &&head, Tail &&... tail) {
  printer.write(head);
  if (sizeof...(Tail)) printer.write(' ');
  print(forward<Tail>(tail)...);
}

void read() {}
template <class Head, class... Tail>
void read(Head &head, Tail &... tail) {
  scanner.read(head);
  read(tail...);
}

#define INT(...)   \
  int __VA_ARGS__; \
  read(__VA_ARGS__)
#define LL(...)   \
  ll __VA_ARGS__; \
  read(__VA_ARGS__)
#define STR(...)      \
  string __VA_ARGS__; \
  read(__VA_ARGS__)
#define CHAR(...)      \
  char __VA_ARGS__; \
  read(__VA_ARGS__)
#define DBL(...)      \
  double __VA_ARGS__; \
  read(__VA_ARGS__)

#define VEC(type, name, size) \
  vector<type> name(size);    \
  read(name)
#define VV(type, name, h, w)                     \
  vector<vector<type>> name(h, vector<type>(w)); \
  read(name)

void YES(bool t = 1) { print(t ? "YES" : "NO"); }
void NO(bool t = 1) { YES(!t); }
void Yes(bool t = 1) { print(t ? "Yes" : "No"); }
void No(bool t = 1) { Yes(!t); }
void yes(bool t = 1) { print(t ? "yes" : "no"); }
void no(bool t = 1) { yes(!t); }
#line 2 "/home/maspy/compro/library/nt/primetest.hpp"
struct m64 {
  using i64 = int64_t;
  using u64 = uint64_t;
  using u128 = __uint128_t;

  inline static u64 m, r, n2; // r * m = -1 (mod 1<<64), n2 = 1<<128 (mod m)
  static void set_mod(u64 m) {
    assert(m < (1ull << 62));
    assert((m & 1) == 1);
    m64::m = m;
    n2 = -u128(m) % m;
    r = m;
    FOR(_, 5) r *= 2 - m * r;
    r = -r;
    assert(r * m == -1ull);
  }
  static u64 reduce(u128 b) { return (b + u128(u64(b) * r) * m) >> 64; }

  u64 x;
  m64() : x(0) {}
  m64(u64 x) : x(reduce(u128(x) * n2)){};
  u64 val() const {
    u64 y = reduce(x);
    return y >= m ? y - m : y;
  }
  m64 &operator+=(m64 y) {
    x += y.x - (m << 1);
    x = (i64(x) < 0 ? x + (m << 1) : x);
    return *this;
  }
  m64 &operator-=(m64 y) {
    x -= y.x;
    x = (i64(x) < 0 ? x + (m << 1) : x);
    return *this;
  }
  m64 &operator*=(m64 y) {
    x = reduce(u128(x) * y.x);
    return *this;
  }
  m64 operator+(m64 y) const { return m64(*this) += y; }
  m64 operator-(m64 y) const { return m64(*this) -= y; }
  m64 operator*(m64 y) const { return m64(*this) *= y; }
  bool operator==(m64 y) const {
    return (x >= m ? x - m : x) == (y.x >= m ? y.x - m : y.x);
  }
  bool operator!=(m64 y) const { return not operator==(y); }
  m64 pow(u64 n) const {
    m64 y = 1, z = *this;
    for (; n; n >>= 1, z *= z)
      if (n & 1) y *= z;
    return y;
  }
};

bool primetest(const uint64_t x) {
  using u64 = uint64_t;
  if (x == 2 or x == 3 or x == 5 or x == 7) return true;
  if (x % 2 == 0 or x % 3 == 0 or x % 5 == 0 or x % 7 == 0) return false;
  if (x < 121) return x > 1;
  const u64 d = (x - 1) >> __builtin_ctzll(x - 1);
  m64::set_mod(x);
  const m64 one(1), minus_one(x - 1);
  auto ok = [&](u64 a) {
    auto y = m64(a).pow(d);
    u64 t = d;
    while (y != one and y != minus_one and t != x - 1) y *= y, t <<= 1;
    if (y != minus_one and t % 2 == 0) return false;
    return true;
  };
  if (x < (1ull << 32)) {
    for (u64 a: {2, 7, 61})
      if (not ok(a)) return false;
  } else {
    for (u64 a: {2, 325, 9375, 28178, 450775, 9780504, 1795265022}) {
      if (x <= a) return true;
      if (not ok(a)) return false;
    }
  }
  return true;
}
#line 4 "main.cpp"

void solve() {
  while (1) {
    LL(N);
    if (N == 0) break;
    ll ANS = 0;
    ll cnt = 0;
    ll p = 2;
    while (cnt < N) {
      if (primetest(p++)) {
        ANS += p - 1;
        ++cnt;
      }
    }
    print(ANS);
  }
}

signed main() {
  cout << fixed << setprecision(15);

  ll T = 1;
  // LL(T);
  FOR(T) solve();

  return 0;
}
accuracy: 1
time_ms: 110
memory_kb: 3152
final_rank: 9

code_snippet: #define _GLIBCXX_DEBUG
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;

const ll inf = 1ll << 60;
const ll mod = (ll)1e9 + 7;

#define rep(i, n) for (ll i = 0; i < (ll)n; i++)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define range(v, b, e) v.begin() + b, v.begin() + e
#define print(s) cout << s;
#define println(s) cout << s << endl;
#define printd(s, f) cout << fixed << setprecision(f) << s << endl;

vector<ll> out;
void output()
{
    for (auto i : out)
    {
        println(i);
    }
}

template<typename T> bool isPrime(T n)
{
	if (n == 2)
	{
		return true;
	}
	else if ((n == 1) || (n % 2 == 0))
	{
		return false;
	}

	for (T i = 3; i * i <= n; i += 2)
	{
		if (n % i == 0)
		{
			return false;
		}
	}

	return true;
}

int main()
{
    vector<ll> p;
    ull sum = 0;
    for (ll i = 2; ; i++)
    {
        if (isPrime(i))
        {
            sum += i;
            p.push_back(sum);

            if (p.size() >= 10000)
            {
                break;
            }
        }
    }

    ll n;
    while (cin >> n)
    {
        if (n == 0)
        {
            break;
        }

        out.push_back(p[n - 1]);
    }

    output();
}
accuracy: 1
time_ms: 10
memory_kb: 3256
final_rank: 3

code_snippet: #include <bits/stdc++.h>
#define NIL (-1)
#define LL long long
using namespace std;
const int64_t MOD = 1e9 + 7;
const int INF = INT_MAX;
const double PI = acos(-1.0);

bool check(int64_t n) {
	bool ret = 1;
	for (int64_t i = 2; i <= sqrt(n); i++) {
		if ((n / i) && (n % i == 0)) ret = 0;
	}
	return ret;
}

int main() {
	vector<int64_t> vec = { 2 };
	for (int64_t n = 3;; n += 2) {
		if (check(n)) vec.push_back(n);
		if (vec.size() == 10010) break;
	}
	//cout << vec.back() << endl;

	vector<int64_t> sn = vec;
	for (int i = 1; i < vec.size(); i++) {
		sn[i] += sn[i - 1];
	}
	//cout << sn.back() << endl;

	int64_t N;
	while (cin >> N) {
		if (!N) break;
		cout << sn[N - 1] << endl;
	}
	return 0;
}
accuracy: 1
time_ms: 90
memory_kb: 3288
final_rank: 6

code_snippet: #include <bits/stdc++.h>

using namespace std;

bool Check(int num)
{
  if(num < 2){ 
    return false;
  }
  else if(num == 2){ 
    return true;
  }
  else if(num % 2 == 0){ 
    return false;
  }

  double sq = sqrt(num);
  for(int i = 3;i <= sq;i += 2){
    if (num % i == 0){
      return false;
    }
  }

  return true;
}

int main()
{
  while(1){
    int N;
    cin>>N;

    if(N == 0){
      break;
    }

    int t = 1;
    int ans = 2;
    
    if(N != 1){
      for(int i = 3;;i = i + 2){
        bool ch = Check(i);
        if(ch == true){
          ans += i;
          ++t;
        }

        if(t == N){
          break;
        }
      }
    }

    cout<<ans<<endl;
  }

  return 0;
}
accuracy: 1
time_ms: 140
memory_kb: 3000
final_rank: 11

code_snippet: #include <iostream>
#include <vector>
#include <cmath>
using namespace std;

int main() {
  int n;
  vector<int> pri(1000000, 1);
  vector<int> p_sum;
  pri[0] = 0;
  pri[1] = 0;

  for(int i = 2; i < sqrt(1000000); i++) {
    for(int j = i*i; j < 1000000; j+=i) {
      pri[j] = 0;
    }
  }

  int cnt	= 0;
  p_sum.push_back(2);

  for(int i = 3; i < 1000000; i++) {
    if(pri[i] == 1) {
      p_sum.push_back(i+p_sum[cnt]);
      cnt++;
    }   
  }

  while(cin >> n, n) {
    cout << p_sum[n-1] <<	endl;
  }
  return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 7212
final_rank: 5

code_snippet: #include<iostream>
#include<vector>
using namespace std;

int main(){
  int map[5000000]={};
  for(int i=2; i<=5000000; ++i){
    for(int j=2; i*j<=5000000; ++j){
      map[i*j] = 1;
      //cout << i*j << endl;
    }
  }
  vector<int> iv;
  for(int i=2; i<500000; ++i){
    if(map[i]==0){iv.push_back(i);}
  }
  /* for(auto i: iv){
    cout << i << endl;
    } */
  int n;
  while(cin >> n,n){
    int ans = 0;
    for(int i=0; i<n; ++i){
      ans += iv[i];
    }
    cout << ans << endl;
  }
}
accuracy: 1
time_ms: 540
memory_kb: 22660
final_rank: 19

code_snippet: #include<bits/stdc++.h>

using namespace std;

int main(){

  vector<int> p;

  p.push_back(2);

	for(int i=3;i<=1000000;i+=2){
	  int k=0;
	  for(int j=3;j<=sqrt(i);j+=2)
		{
		  if(i%j==0)
			{
			  k=1;
			  break;
			}
		}
	  
	  if(k==0)
		p.push_back(i);
	}
	
  while(1){

	int n;

	cin >> n;

	if(n == 0)
	  break;

	int sum = 0;
	
	for(int i=0;i<n;++i)
	  sum += p[i];

	cout << sum << endl;
	
  }
	
}
accuracy: 1
time_ms: 180
memory_kb: 3256
final_rank: 14

code_snippet: #include<bits/stdc++.h>

using namespace std;

long long int ar[1000000],m[1000000],m2[1000000];

void _seive_ (long long int n)
{
    long long int i,j;
    for (i=2;i<=n;++i){

        for (j=(i*i);j<=n;j+=i){

            ar[j-1]=1;

        }
    }
    j=0;
    m2[1]=2;
    for (i=2;i<=n;++i){

        if(ar[i-1]==0){

            ++j;
            m[j]=i;
            if(j>1){

                m2[j]= m[j]+m2[j-1];

            }
        }
    }

    return ;
}

int main()
{
   long long int num;

   _seive_(1000000);
   while(scanf("%lld",&num)==1 && num!=0) {

        cout<<m2[num]<<endl;

   }

   return 0;

}
accuracy: 1
time_ms: 10
memory_kb: 12184
final_rank: 13

code_snippet: #include <iostream>
#include <string>
#include <algorithm>
#include <functional>
#include <vector>
#include <utility>
#include <cstring>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cassert>
using namespace std;
using ll = long long;
const int INF = 1<<30;
const int MOD = 1e9 + 7;
const int MAX_N = 1e8;
bool isPrime(ll x)
{
    if(x % 2 == 0) return false;
    for(ll i = 3; i * i <= x; i += 2) if(x % i == 0) return false;
    return true;
}
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    vector<ll> prime;
    prime.push_back(2);
    for(ll x = 3; prime.size() < 10010; x += 2) if(isPrime(x)) prime.push_back(x);
    vector<ll> sum(10010, 0);
    for(int i = 1; i < 10010; i++) sum[i] += sum[i - 1] + (ll)prime[i - 1];
    while(cin >> n, n)
    {
        cout << sum[n] << endl;
    }
    return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 3136
final_rank: 2

code_snippet: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;

// 𝑂(𝑁*log(log 𝑁))
vector<int> eratosthenes(int N)
{
    vector<int> res;
    vector<bool> prime(N + 1, 1);
    prime[0] = prime[1] = false;
    for (int i = 2; i * i <= N; ++i)
    {
        if (prime[i] == true)
        {
            for (int j = 2 * i; j <= N; j += i)
            {
                prime[j] = false;
            }
        }
    }
    for (int i = 0; i <= N; ++i)
    {
        if (prime[i] == true)
            res.push_back(i);
    }
    return res;
}

ll n;

int main()
{
    auto p = eratosthenes(100000000);
    while (cin >> n)
    {
        if (n == 0)
            return 0;
        ll ans = 0;
        for (int i = 0; i < n; i++)
        {
            ans += p[i];
        }
        cout << ans << endl;
    }
}
accuracy: 1
time_ms: 740
memory_kb: 47920
final_rank: 20

code_snippet: #include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
using ll = long long;

// 𝑂(𝑁*log(log 𝑁))
vector<int> eratosthenes(int N)
{
    vector<int> res;
    vector<bool> prime(N + 1, 1);
    prime[0] = prime[1] = false;
    for (int i = 2; i * i <= N; ++i)
    {
        if (prime[i] == true)
        {
            for (int j = 2 * i; j <= N; j += i)
            {
                prime[j] = false;
            }
        }
    }
    for (int i = 0; i <= N; ++i)
    {
        if (prime[i] == true)
            res.push_back(i);
    }
    return res;
}

ll n;

int main()
{
    auto p = eratosthenes(10000000);
    while (cin >> n)
    {
        if (n == 0)
            return 0;
        ll ans = 0;
        for (int i = 0; i < n; i++)
        {
            ans += p[i];
        }
        cout << ans << endl;
    }
}
accuracy: 1
time_ms: 40
memory_kb: 8016
final_rank: 10

code_snippet: #define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
using namespace std;
#define rep(i, n) for(int i=0; i<(n); ++i)
#define FOR(i, m, n) for(int i=(m); i<(n); ++i)
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mp make_pair
#define pb push_back
#define Cout(x) cout << (x) << endl
#define Cout2(x, y) cout << (x) << " " << (y) << endl
#define dump(x) cout << #x << " = " << (x) << endl;
#define forauto(i, a) for(auto i : a)cout << i << " "; puts("");
typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef vector<string> VS;
typedef vector<bool> VB;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
const int inf = 1e9;
const double pi = acos(-1.0);

//素数判定
bool isPrime(int n) {
	if (n == 2)return true;
	if (n < 2 || n % 2 == 0)return false;

	for (int i = 3; i*i <= n; i += 2) {
		if (n%i == 0)return false;
	}
	return true;
}

int solve(int n) {
	int ans = 0, num = 0;
	for (int i = 2; num != n; i++) {
		if (isPrime(i)) {
			ans += i;
			num++;
		}
	}
	return ans;
}

int main() {
	while (true) {
		int n; cin >> n;
		if (n == 0)break;

		Cout(solve(n));
	}
}
accuracy: 1
time_ms: 110
memory_kb: 2980
final_rank: 8

code_snippet: #include<bits/stdc++.h>
using namespace std;

#define lint long long
#define P pair<int, int>
#define LLP pair<long long, long long>
#define REP(i, x, n) for(int i = (x), i##_len = (int)(n) ; i < i##_len ; ++i)
#define rep(i, n) for(int i = 0, i##_len = (int)(n) ; i < i##_len ; ++i)
#define repr(i, n) for(int i = (int)(n) - 1 ; i >= 0 ; --i)
#define SORT(x) sort((x).begin(), (x).end())
#define SORT_INV(x) sort((x).rbegin(), (x).rend())

const int IINF = 1e9 + 10;
const long long LLINF = (long long)1e18 + 10;
const long long MOD = (long long)1e9 + 7;
const int dx4[] = {1, 0, -1, 0}, dy4[] = {0, 1, 0, -1};
const int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dy8[] = {0, -1, -1, -1, 0, 1, 1, 1};
const double EPS = 1e-8;

void eratosthenes(int n, vector<bool> &isPrime){
    isPrime.resize(n + 1, true);
    for(int i = 0 ; i < 2 ; ++i){
        isPrime[i] = false;
    }
    for(int i = 2 ; i * i <= n ; ++i){
        if(isPrime[i]){
            for(int j = i ; i * j <= n ; ++j){
                isPrime[i * j] = false;
            }
        }
    }
    return;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    while(cin >> n, n){

        vector<bool> isPrime;
        eratosthenes(1000000, isPrime);

        lint ans = 0;
        int cnt = 0;
        rep(i, 1000000){
            if(isPrime[i]){
                ans += i;
                ++cnt;
            }
            if(cnt == n){
                break;
            }
        }
        cout << ans << endl;

    }

    return 0;
}
accuracy: 1
time_ms: 90
memory_kb: 3292
final_rank: 7

code_snippet: #include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
const ll MOD = 1000000007;
const int IINF = INT_MAX;
const ll LLINF = LLONG_MAX;
const int MAX_N = int(2e5 + 5);
const double EPS = 1e-8;
const int di[] = {0, 1, 0, -1}, dj[] = {1, 0, -1, 0};
#define REP(i, n) for (int i = 0; i < n; i++)
#define REPR(i, n) for (int i = n; i >= 0; i--)
#define SORT(v) sort((v).begin(), (v).end())
#define ALL(v) (v).begin(), (v).end()

bool prime[int(1e7)+5];

int main() {
    int m = int(1e7);
    vector<ll> p;
    fill(prime,prime+m+1,true);
    prime[0] = false;
    prime[1] = false;
    for(int i=2;i*i<=m;i++){
        if(prime[i]){
            for(int j=i*i;j<=m;j+=i){
                prime[j] = false;
            }
        }
    }
    p.push_back(0);
    for(ll i=2;p.size()<10005;i++){
        if(prime[i]) p.push_back(i);
    }
    for(int i=0;i<p.size();i++){
        p[i+1] += p[i];
    }
    while(1){
        int n;
        cin >> n;
        if(n==0)break;
        cout << p[n] << endl;
    }
    return 0;
}
accuracy: 1
time_ms: 50
memory_kb: 12940
final_rank: 16

code_snippet: #include<iostream>
#include<vector>
#include<algorithm>
#include<utility>
#include<string>
#include<cmath>
#include<cstring>
#include<queue>
#include<map>
#include<climits>
#include<set>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
using namespace std;
typedef pair<int, int> pii;
typedef long long int ll;
typedef pair<ll,ll> pll;
int dx[4] = {1,0,0,-1};
int dy[4] = {0,1,-1,0};
#define MOD 1000000007
#define ARRAY_MAX 1000005

const int INF = 1e9+7;


/*素数のみの配列を返す*/
vector<ll> Eratosthenes(ll n,vector<ll>& arr){
 
    for(ll i = 0; i < n;i++){
        arr[i] = 1;
    }
 
    for(ll i = 2; i < sqrt(n); i++){
        if(arr[i]){
            for(ll j = 0; i * (j + 2) < n; j++){
                arr[i *(j + 2)] = 0;
            }
        }
    }
    vector<ll> prime;
    for(int i = 2;i < arr.size();i++){
        if(arr[i]){
            prime.push_back(i);
        }
    }
    return prime;
}

int main(){


    vector<ll> prime(ARRAY_MAX,0);
    prime = Eratosthenes(1e6,prime);
    
    for(int i = 0;i < prime.size()-1;i++){
        prime[i+1] += prime[i];
    }
    ll n;
    while(cin >> n,n){

        cout << prime[n-1] << endl;
    }








    return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 11468
final_rank: 12

code_snippet: #include<iostream>
#include<cmath>
using namespace std;

bool Judge_Prime_Number( int x )
{
    for( int i = 2; i <= sqrt(x); i++ )
    {
        if( x % i == 0 )
            return false;
    }
    return true;
}

int main()
{
    int n;

    while( cin >> n )                               //データセットであることを忘れていた。
    {
        if( n == 0 )
            break;

        int i = 0;

        int sum = 0, p = 2;
        while( i != n )
        {
            if( Judge_Prime_Number(p) == true )
            {
                sum += p;
                i++;
            }
            p++;
        }
       cout << sum << endl;
    }

    return 0;
}
accuracy: 1
time_ms: 290
memory_kb: 3032
final_rank: 18

code_snippet: #include <iostream>
#include <vector>
#include <algorithm>

#define INPUT_FROM_FILE (0) 
#if INPUT_FROM_FILE
#include <fstream>
#endif

class PrimeTest{
private:
	std::vector<bool> is_prime_;					//nが素数かどうかをis_prime[n]で判定
	std::vector<unsigned int> prime_numbers_;		//素数の集合

public:
	PrimeTest();

	~PrimeTest();

	const std::vector<unsigned int>& get_prime_numbers() const;

	bool is_prime(unsigned int n);

};

PrimeTest::PrimeTest(){
	is_prime_.push_back(false);	//0
	is_prime_.push_back(false);	//1
	is_prime_.push_back(true);	//2
	is_prime_.push_back(true);	//3

	prime_numbers_.push_back(2);
	prime_numbers_.push_back(3);
}
PrimeTest::~PrimeTest(){}

const std::vector<unsigned int>& PrimeTest::get_prime_numbers() const{
	return prime_numbers_;
}

bool PrimeTest::is_prime(unsigned int n){
	if(n >= is_prime_.size()){
		unsigned int i_s = is_prime_.size();
		is_prime_.resize(n + 1, false);

		//i_sからnまでの各数が素数かどうか判定
		for(unsigned int i = i_s; i <= n; i++){
			unsigned int max_val = int(sqrt((double)i));
			bool b = true;
			for(unsigned int j = 0; j < prime_numbers_.size(); j++){
				if(prime_numbers_[j] > max_val){ break;}
				if(i % prime_numbers_[j] == 0){
					b = false;
					break;
				}
			}
			if(b){
				prime_numbers_.push_back(i);
				is_prime_[i] = true;
			}
		}

	}
	return is_prime_[n];
}

int main(){
	int n;
	int result = 0;
	PrimeTest prime_test;

#if INPUT_FROM_FILE
	std::ifstream ifs("test.txt");
#endif

	for(;;){
#if INPUT_FROM_FILE
		ifs >> n;
#else
		std::cin >> n;
#endif
		if(n == 0){ break; }

		result = 2;
		n -= 1;
		for(int i = 3; n > 0; i += 2){
			if(prime_test.is_prime(i)){
				result += i;
				n--;
			}
		}
		
		std::cout << result << std::endl;
	}

	return 0;
}
accuracy: 1
time_ms: 10
memory_kb: 3116
final_rank: 1

code_snippet: #include<iostream>
using namespace std;
bool f(int a)
{
    for(int i=2;i*i<=a;i++)if(a%i<1)return 0;
    return 1;
}
int n;
main()
{
    while(cin>>n,n)
    {
        int ans=0;
        for(int i=2;n;i++)if(f(i))n--,ans+=i;
        cout<<ans<<endl;
    }
}
accuracy: 1
time_ms: 230
memory_kb: 3044
final_rank: 17