Pagini recente » Cod sursa (job #2195941) | Cod sursa (job #3283826) | Cod sursa (job #607683) | Cod sursa (job #265581) | Cod sursa (job #2229538)
#include <fstream>
#include <vector>
#define MOD 999983
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
vector< vector<int> > v;
void hash_insert( int x )
{
int modulo = x % MOD;
v[modulo].push_back(x);
}
void hash_erase( int x )
{
int modulo = x % MOD;
for (int i = 0 ; i < v[modulo].size(); i++){
if (v[modulo][i] == x ){
v[modulo].erase(v[modulo].begin()+i);
return;
}
}
}
bool hash_find(int x)
{
int modulo = x % MOD;
for (int i = 0 ; i < v[modulo].size(); i++)
if (v[modulo][i] == x )
return true;
return false;
}
int main()
{
int n,op,x;
in >> n;
v = vector< vector<int> >(MOD);
for (int i = 1; i <= n; i++ )
{
in >> op >> x;
if (op == 1)
hash_insert(x);
else
if (op == 2)
hash_erase(x);
else
out << hash_find(x) << "\n";
}
return 0;
}