фундамент

#include <iostream>
#include <vector>
#include <cstdlib> // для функций rand() и srand()
#include <list>
#include <iterator>
using namespace std;

const int c = 3; // O(n) ~ 3n
const int p = 2000000033;


struct Node
{
    int a;
    int b;
    vector<int>* second_table = NULL;
    vector<int> keys;
    int count_keys = 0;
};

class FixedSet
{
    vector <struct Node> nodes; //вектор ячеек первой хэш табл
    int count_numbers;

public:
    FixedSet();
    void Initialize(const vector<int>& numbers);
    bool Contains(int number) const;
    void print();

};

FixedSet::FixedSet()
{
    this->count_numbers = 0;
    this->nodes;
}

void FixedSet::Initialize(const vector<int>& numbers)
{
    for (int i = 0; i < numbers.size(); ++i)
    {
        Node tmp;
        tmp.keys.push_back(numbers[i]);
        this->nodes.push_back(tmp);
    }
}

void FixedSet::print()
{
    cout << "\n print: \n";
    for (int i = 0; i < nodes.size(); ++i)
    {
        cout << "i= " << i << " : ";
        for (int j=0; j < nodes[i].keys.size(); ++j)
            cout << nodes[i].keys[j] << endl;
    }
    cout << endl;
}

int main()
{
    cout<<"Hello World";
    FixedSet f;

    vector<int> numbers = {1,2,3};
    f.Initialize(numbers);
    f.print();



    return 0;
}