Submission #6436683

---

Source Code Expand

//N>=11でWA?
#include <bits/stdc++.h>
#define REV(v) reverse(v.begin(), v.end());
#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, start, stop) for (int i = start; i < stop; i++)
#define FORR(i, start, stop) for (int i = start; i > stop; i--)
#define SORT(v, n) sort(v, v + n);
#define SORTR(v, n) sort(v, v + n,greater<int>());
#define VSORT(v) sort(v.begin(), v.end());
#define VSORTR(v) sort(v.begin(), v.end(),greater<int>());
#define REMOVE(v,n) remove(vector<int> v,v+v.size(),int n)
#define ll long long
#define ull unsigned long long
#define pb(a) push_back(a)
#define INF 999999999
#define V(v,i,j) vector(v.begin() + i, v.begin() + j)
#define INSERT(va,vb) va.insert(va.end(), vb.begin(), vb.end())
using namespace std;
typedef vector<int> vint;
typedef pair<int, int> P;
typedef pair<ll, ll> LP;
typedef pair<int, P> PP;
typedef pair<ll, LP> LPP;
int dy[] = {0, 0, 1, -1};
int dx[] = {1, -1, 0, 0};
const int MOD = 1000000007;
void chmin(int &a, int b) { if (a > b) a = b; }

//vector< vector<int> > v (size1, vector<int>(size2) );

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

    int N;
    cin>>N;

    //エラトステネスの篩 N以下 N log(log N)
    vector<bool> p(55556);
    vector<ll> P;
    ll cnt = 0;
    FOR(i,0,55556){
        p[i]=true;
    }
    FOR(i,2,55556){
        if(p[i]==true){
            cnt++;
            P.pb(i);
            FOR(j,2,55556/i+1){
                p[i*j]=false;
            }
        }  
    }
    
    ll c=0;
    vector<ll> ans={2,3,5,7,11};
    cout<<2<<' '<<3<<' '<<5<<' '<<7<<' '<<11;
    bool flag;

    FOR(i,5,5637){
        if(ans.size()==N) break;
        else{
            flag=true;
            FOR(a,0,ans.size()){
                FOR(b,0,ans.size()){
                    if(a==b) break;
                    FOR(c,0,ans.size()){
                        if(b==c || a==c)  break;
                        FOR(d,0,ans.size()){
                            if(c==d || b==d || a==d) break;
                            if(p[ans[a]+ans[b]+ans[c]+ans[d]+P[i]]) flag=false;
                        }
                    }
                }
            }
            
        }
        if(flag){
            ans.pb(P[i]);
            cout<<' '<<P[i];
        }
        
    }
    cout<<endl;
    
    //cout<<cnt<<endl;

}

Submission Info

Judge Result