Taulukot

#include <iostream>
#include <vector>

bool prime(int n){
  for(int k=2;k*k<=n;++k)if(n%k==0)return false;
  return true;
}

std::vector<std::pair<int,int>>solve(int n){
  if(!n)return{};
  for(int k=n+1;;++k){
    if(!prime(k))continue;
    auto xs=solve(k-n-1);
    for(int i=k-n;i<=n;++i)xs.emplace_back(i,k-i);
    return xs;
  }
}

int main(){
  int n;std::cin>>n;
  auto xs=solve(n);
  for(auto p:xs)std::cout<<p.first<<' ';std::cout<<'\n';
  for(auto p:xs)std::cout<<p.second<<' ';std::cout<<'\n';
}

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