Taulukot

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

#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <set>
#include <unordered_set>
#include <cmath>
#include <math.h>
#include <queue>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sstream>
#include <tuple>
 
using namespace std;
typedef long long LL;
 
#define FOR(i, a, b) for (int i = (a); i < (b); ++i)
 
/*
bool isPrime(int num) {
//cout << "asd" << endl;
	if (!(num/2)) return false; 
	for (int i = 1; i <= (int)ceil(sqrt(num)); i++) { 
		if (num % i == 0) return false;
	} 
    return true; 
}
*/
 
 
bool isPrime (int num)
{
    if (num <=1)
        return false;
    else if (num == 2)         
        return true;
    else if (num % 2 == 0)
        return false;
    else
    {
        bool prime = true;
        int divisor = 3;
        double num_d = static_cast<double>(num);
        int upperLimit = static_cast<int>(sqrt(num_d) +1);
        
        while (divisor <= upperLimit)
        {
            if (num % divisor == 0)
                prime = false;
            divisor +=2;
        }
        return prime;
    }
}
 
 
 
int main() {
	int n;
	cin >> n;
	vector<int> l1(n);
	vector<int> l2(n);
 
	int pos = 0;
 
	while (n > 0) {
		if (n == 1) {
			l1[pos] = 1;
			l2[pos] = 1;
			break;
		}
 
		int cand = n + 1;
		while (!isPrime(cand)) {
			cand++;
		}
//cout << cand << " "  << cand-n << " q " << n+1 << endl;
	
		for (int i = cand-n; i < n+1; ++i) {
			l1[pos] = i;
			l2[pos] = cand-i;
//cout << "QQQQQ " << pos << " "<< l1[pos] << " " << l2[pos] << endl;
			pos++;
		}
 
		n = cand-n-1;
	}
	
	for (int i = 0; i < l1.size(); ++i) {
		cout << l1[i] << " ";
	}
	cout << endl;
 
	for (int i = 0; i < l2.size(); ++i) {
		cout << l2[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