Submission #2462672

---

Source Code Expand

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

#ifdef DEBUG
#define NDEBUG
#include "cout11.h"
#endif
#undef NDEBUG
#include <cassert>

typedef long long ll;
typedef pair<int,int> ii;
typedef vector<int> vi;
#define rep(var,n)  for(int var=0;var<(n);++var)
#define ALL(c)  (c).begin(),(c).end()


#include <vector>
using namespace std;

vector<int> primes;
vector<int> smallest_prime_factor; // not used

int sieve(int nmax){
    primes.clear();
    smallest_prime_factor.assign(nmax+1, 0);

    for (int n=2; n<=nmax; ++n) {
        if (!smallest_prime_factor[n]) {
            primes.push_back(n);
            for (int kn=n; kn<=nmax; kn+=n) {
                if (!smallest_prime_factor[kn]) {  // ←このチェックをせずに上書きを続けると largest_prime_factor[] が出来上がる
                    smallest_prime_factor[kn] = n;
                }
            }
        }
    }
    return primes.size();
}


void solve(int N) {
    for(int p:primes){
        if (p % 5 == 1) {
            cout << p;
            --N;
            if (N == 0) {
                cout << endl;
                return;
            }
            cout << " ";
        }
    }
}

int main() {
    sieve(55555);

    int N; cin>>N;
    solve(N);
    return 0;
}

Submission Info

Judge Result