Pagini recente » Cod sursa (job #2169176) | Cod sursa (job #2402453) | Cod sursa (job #2465656) | Cod sursa (job #1742053) | Cod sursa (job #1573887)
#include <iostream>
#include <fstream>
#include <vector>
#define P 666013
using namespace std;
vector<int> H[P];
vector<int>::iterator Cauta(int x){
int k;
vector<int>::iterator it;
k = x % P;
for (it = H[k].begin(); it != H[k].end(); ++it)
if (*it == x)
return it;
return H[k].end();
}
void inser(int x){
int k;
k = x % P;
if (Cauta(x) == H[x].end())
H[k].push_back(x);
}
void ster(int x){
int k;
vector<int>::iterator it;
k = x % P;
it = Cauta(x);
if (it != H[k].end())
H[k].erase(it);
}
int main(){
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n;
f >> n;
for (int i = 0; i < n; ++i){
int x, y;
f >> x >> y;
if (x == 1)
inser(y);
if (x == 2)
ster(y);
if (x == 3){
int k = y % P;
if (Cauta(y) == H[k].end())
g << "0\n";
else
g << "1\n";
}
}
f.close();
g.close();
return 0;
}