#include <iostream>

using namespace std;

const int rozmiartab = 32;

struct Node{
        char dane;
        Node *next;
        Node *prev;
};

int tab[rozmiartab];

void emptytab(){

    for(int i = 0; i<rozmiartab; i++){
        tab[i] = 0;
    }

};

int has(char wartosc){
    int q = wartosc.lenght();
    int N = rozmiartab;
    int h = 0;
    for(int i = 0; i < q; i++){
        h += wartosc[i] * (31^(q-(i+1)));
    }
    return h %= N;
};

void insert(char dane){
    struct Node* newNode = new Node;
    newNode -> next = NULL;

    int index = has(dane);

    if(tab[index]==0){
        tab[index] = newNode;
        //kolizja
    }else{
        struct Node* temp = tab[index];
        while(temp->next){
            temp = temp -> next;
        }
        temp -> next = newNode;
    }
}

void print(){
    for(int i = 0; i < rozmiartab; i++){
        cout<<(int)i<<". --- "<< tab[i]<<endl;
    }
};




int main() {

    insert('adam');

    print();

    return 0;
}