Pagini recente » Cod sursa (job #913915) | Cod sursa (job #1087861) | Cod sursa (job #1779417) | Cod sursa (job #426701) | Cod sursa (job #2624908)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
vector<int> H[70000];
void Add(int x)
{
H[x % 70000].push_back(x);
}
void Delete(int x)
{
int m = x % 70000;
for (int i = 0; i < H[m].size(); i++)
if(H[m][i] == x)
H[m].erase(H[m].begin()+i);
}
int Search(int x)
{
int m = x % 70000;
for (int i = 0; i <H[m].size(); i++)
if(H[m][i] == x)
return 1;
return 0;
}
int main()
{
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n, op, x;
f>>n;
for(; n; n--)
{
f >> op >> x;
if(op == 1)
Add(x);
else if(op == 2)
Delete(x);
else
g << Search(x) << '\n';
}
return 0;
}