Taulukot

#include<iostream>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<cmath>
#include<utility>
 
using namespace std;
 
__uint128_t power_mod128(__uint128_t a, uint64_t k, uint64_t m) {
  if(k == 0) return 1;
  __uint128_t res=power_mod128(a, k/2, m);
  if(k%2 == 0) return res*res%m;
  return res*a%m*res%m;
}
 
bool is_witness(uint64_t a, uint64_t evenpart, uint64_t oddpart, uint64_t p) {
  __uint128_t u = power_mod128(a, oddpart, p);
  if(u == 1) return false;
  for(uint64_t j=1;j<evenpart;j*=2) {
    if(u == p-1) return false;
    u*=u; u%=p;
  }
  return true;
}
 
bool miller_rabin64(uint64_t p) {
  uint64_t odd=p-1;
  uint64_t even=1;
  while(odd%2 == 0) { even*=2; odd/=2; }
  const int64_t bases[7] = {2, 325, 9375, 28178, 450775, 9780504, 1795265022};
  for(uint64_t i=0;i<7;i++) {
    uint64_t a = bases[i]%p;
    if(a == 0) return true;
    if(is_witness(a, even, odd, p)) return false;
  }
  return true;
}
 
int main(void) {
  int64_t n;
  cin >> n;
  vector<int64_t> a,b;
  while(n > 0) {
    int64_t p=n+1;
    for(;p<2*n;p++) {
      if(miller_rabin64(p)) break;
    }
    for(int64_t k=n;k>=p-n;k--) {
      a.push_back(k);
      b.push_back(p-k);
    }
    n=p-n-1;
  }
  for(auto x: a) {
    cout << x << " ";
  }
  cout << "\n";
  for(auto y: b) {
    cout << y << " ";
  }
  cout << "\n";
  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