Taulukot

input/code.cpp: In function 'int main()':
input/code.cpp:66:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(int j = 0; j < prime.size(); j++){
                    ^

#include <bits/stdc++.h>

#define i64 long long
#define u64 unsigned long long
#define i32 int
#define u32 unsigned int

#define pii pair<int, int>
#define pll pair<long long, long long>

#define defmod 1000000007
using namespace std;
bool sieve[1010101] = {0};
vector<int> prime;
void eratosthenes(int n)
{
  
  sieve[0] = 1; sieve[1] = 1;
  int m = (int) sqrt((double) n);

  for(int i = 0; i <= m; i++) {
    if(!sieve[i]) {
    	//prime.push_back(i);
      for (int j = i*i; j <= n; j += i)
        sieve[j] = 1;
    }
  }
  
}

int main(){
	srand (time(NULL));
	cin.sync_with_stdio(0);
	cin.tie(0);
	eratosthenes(200010);
	for(int i = 2; i <= 200000; i++){
		if(sieve[i] == 0)
			prime.push_back(i);
	}
	int n; cin >> n;
	while(true){
	vector<int> a1, b1;

	unordered_set<int> a;
	for(int i = 1; i < n; i++)
		a.insert(i+1);
	random_shuffle(prime.begin(), prime.end());
	//cout << prime.size() << " primeja" << endl;
	int lell = 1;
	bool d[101010] = {0};
	if(n%2 == 1){
		a1.push_back(1);
		b1.push_back(1);
	}
	else{
		a.insert(1);
		lell = 0;
	}

	bool ebin = false;
	for(int i = n; i > lell; i--){
		if(d[i])
			continue;
		bool g = false;
		//cout << "lb " << *lower_bound(prime.begin(), prime.end(), i) << endl;
		for(int j = 0; j < prime.size(); j++){
			if(a.count(prime[j]-i)){
				//cout << i  << "+" << prime[j]-i << " = " << prime[j] << endl;
				a1.push_back(i);
				b1.push_back(prime[j]-i);
				if(i != prime[j]-i){
					a1.push_back(prime[j]-i);
					b1.push_back(i);
				}
				a.erase(prime[j]-i);
				a.erase(i);
				//cout << i << " ja " << prime[j]-i << endl;
				g = true;
				d[prime[j]-i] = true;

				break;
			}
		}
		if(!g){
			ebin = true;
			break;
		}
	}
	if(ebin)
		continue;
	
	for(int i = 0; i < n; i++)
		cout << a1[i] << " ";
	cout << endl;
	for(int i = 0; i < n; i++)
		cout << b1[i] << " ";
	cout << endl;
	break;
}
	return 0;
	
}

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