Taulukot

#include <bits/stdc++.h>
using namespace std;
#define N 100001
int b[N];
int main()
{
	bitset<N * 2> bs;
	for (int i = 2; i < N * 2; ++i) {
		if (bs[i]) continue;
		for (int j = i + i; j < N * 2; j += i) {
			bs[j] = 1;
		}
	}
	bs[1] = 1;
	int n;
	cin >> n;
	int c = n;
	int l = n + 1;
	for (int i = n; i; --i) {
		if (!bs[i + c]) {
			for (int j = i; j < l; ++j) {
				b[j] = c--;
			}
			l = i;
		}
	}
	for (int i = 1; i <= n; ++i) cout << i << " ";
	cout << "\n";
	for (int i = 1; i <= n; ++i) cout << b[i] << " ";
}

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