PAT 1078

因爲輸入反了所以WA了好多次... 真的太困了貼完睡覺。

二次探查法都忘記是什麼了，原來還有不能被插入的情況.. 等到真的要去找工作的時候再認真念一念書吧～

 

#include <vector>
#include <iostream>
#include <cmath>

using namespace std;

bool is_prime(int num){
    if (num == 1)
        return false;
    if (num == 2)
        return true;

    int sqr = sqrt(num);

    if (num % 2 == 0)
        return false;

    for (int i = 3; i <= sqr; i += 2){
        if (num % i == 0)
            return false;
    }

    return true;
}

int main(){
    int n, table_size;

    cin >> table_size >>  n;

    while (!is_prime(table_size))
        table_size++;

    vector<bool> hash_table(table_size, false);
    vector<int> rec_res(n, -1);

    for (int i = 0; i < n; i++){
        int num;
        cin >> num;

        for (int j = 0; j < table_size; j++){
            int idx = (num + j * j) % table_size;

            if (!hash_table[idx]){
                hash_table[idx] = true;
                rec_res[i] = idx;

                break;
            }
        }
    }

    for (int i = 0; i < rec_res.size() - 1; i++){
        if (rec_res[i] != -1)
            cout << rec_res[i] << " ";
        else
            cout << "-" << " ";
    }

    if (rec_res[rec_res.size() - 1] != -1)
        cout << rec_res[rec_res.size() - 1] << endl;
    else
        cout << "-" << endl;
}