Pagini recente » Cod sursa (job #1299788) | Cod sursa (job #1857618) | Cod sursa (job #1791502) | Monitorul de evaluare | Cod sursa (job #2563509)
#include <fstream>
#include <vector>
#define MOD 666013
using namespace std;
int n, test, x, i;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
vector <int> h[MOD];
int query(int r, int x){
for(int i=0;i<h[r].size();i++)
if(h[r][i]==x)
return 1;
return 0;
}
void adaug(int r, int x){
if (!query(r, x)) {
h[r].push_back(x);
}
}
void stergere(int r, int x) {
for (vector <int> :: iterator it=h[r].begin();it!=h[r].end();it++) {
if ((*it)==x) {
h[r].erase(it);
return;
}
}
}
int main () {
fin>>n;
for (i=1;i<=n;i++) {
fin>>test>>x;
int r=x%MOD;
if (test==1) {
adaug(r, x);
} else if (test==2) {
stergere(r, x);
} else
fout<<query(r, x)<<"\n";
}
return 0;
}