Anti Hash test for unordered map

#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
using namespace std;

const int DEG = 218971; // C++17
int cur = 0;

int nxt() {
    cur += DEG;
    if (cur > 999999999)
        cur = (cur % DEG) + 1;
    return cur;
}

int comp(int a, int b) {
    return a % DEG == b % DEG ? a / DEG > b / DEG : a % DEG > b % DEG;
}

int main() {
    ios_base::sync_with_stdio(false);
    int n = 2e5;
    mt19937 gen(511);
    int skip = uniform_int_distribution<>(1, 1000000)(gen);
    while (skip--)
        nxt();
    vector<int> v;
    cout << n << "\n";
    for (int i = 0; v.size() < n && i < n; ++i) {
        int cur = nxt();
        v.push_back(cur);
        swap(v[i], v[uniform_int_distribution<>(0, i)(gen)]);
    }
    for (int i = 0; i < n; ++i) {
      // if (i) cout << ' ';
      cout << 1;
      if (i != n-1)cout << ' ';
    }
    cout << '\n';
    for (int i = 0; i < n; ++i) {
      assert(v[i]+1 <= 1e9);
        cout << (i ? " " : "") << v[i]+1;
      }
    cout << endl;
}