Pagini recente » Cod sursa (job #1991029) | Cod sursa (job #987033) | Cod sursa (job #1261243) | Cod sursa (job #1514115) | Cod sursa (job #971507)
Cod sursa(job #971507)
#include <cstdio>
#include <vector>
#define Mod 666013
using namespace std;
vector <int> H[Mod];
vector <int> :: iterator it;
int i, n, op, x, ind;
vector <int> :: iterator find_v(int x)
{
for(it= H[ind].begin(); it!=H[ind].end(); it++)
if (*it==x) return it;
return it;
}
int main()
{
freopen ("hashuri.in","r", stdin);
freopen("hashuri.out","w", stdout);
scanf("%d\n", &n);
for (int i=1; i<=n; i++)
{
scanf("%d %d\n", &op, &x);
ind = x % Mod;
it = find_v(x);
if(op==1) if (it == H[ind].end()) H[ind].push_back(x);
if(op==2) if (it!=H[ind].end()) H[ind].erase(it);
if(op==3) if(it==H[ind].end()) printf("0\n");
else printf("1\n");
}
return 0;
}