50230. Hash Table

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <stdint.h>

// #define max(a,b) ((a)>(b)?(a):(b))
// #define min(a,b) ((a)<(b)?(a):(b))

int f(int k, int s){
    return (77 * k + 2222) % s;
}

int main(){
    int s, c; scanf("%d %d", &s, &c);
    int table[100005][12];
    memset(table, -1, sizeof(table));

    int val;
    while(scanf("%d", &val) != EOF){
        int key = f(val, s);

        int first_slot = -1, exact_idx = -1;
        for(int i = 0; i < c; i++){
            if(first_slot == -1 && table[key][i] == -1){
                first_slot = i;
            }
            if(table[key][i] == val){
                exact_idx = i;
            }
        }

        if(exact_idx == -1){
            table[key][first_slot] = val;
        }
        else{
            printf("%d %d\n", val, key);
            table[key][exact_idx] = -1;
        }
    }
}