Taulukot

#include <iostream>
#include <set>
#include <vector>
#include <cmath>
 
using namespace std;
typedef long long LL;
 
// Returns an array isPrime of length n+1 such that isPrime[x] = 1 if x is prime and 0 else
char* eratosthenes(int n){
 
    int m = (int) sqrt(n) + 1;
 
    char* isPrime = (char*)malloc((n+1)*sizeof(char));
    for(int i = 0; i <= n; i++) 
        isPrime[i] = (i <= 1) ? 0 : 1;
 
    for(int i = 2; i <= m; i++)
        if(isPrime[i])
            for (int j = 2*i; j <= n; j += i)
                isPrime[j] = 0; 
 
    return isPrime;
}
 
int main(){
    cin.tie(0);
    ios_base::sync_with_stdio(0);
    int n; cin >> n;
    char* is_prime = eratosthenes(2*n+100);
    vector<int> ans(n+1,-1);
    
    int x = n;
    for(int i = n; i >= 1; i--){
        if(is_prime[i + x]){
            int j = i;
            while(j <= n && ans[j] == -1){
                ans[j] = x;
                x--;
                j++;
            }
        }
    }
    
    for(int i = 1; i <= n; i++){
        cout << i << " ";   
    } cout << endl;
    
    for(int i = 1; i <= n; i++){
        cout << ans[i] << " ";
    } cout << endl;
    
    
    
}

Test 1

Group: 1

Verdict: ACCEPTED

Test 2

Group: 1

Verdict: ACCEPTED

Test 3

Group: 1

Verdict: ACCEPTED

Test 4

Group: 1

Verdict: ACCEPTED

Test 5

Group: 1

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: ACCEPTED

Test 7

Group: 2

Verdict: ACCEPTED

Test 8

Group: 2

Verdict: ACCEPTED

Test 9

Group: 2

Verdict: ACCEPTED

Test 10

Group: 2

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED

Test 14

Group: 3

Verdict: ACCEPTED

Test 15

Group: 3

Verdict: ACCEPTED