Pagini recente » Cod sursa (job #1763941) | Cod sursa (job #1344157) | Cod sursa (job #2837643) | Cod sursa (job #1567709) | Cod sursa (job #1215514)
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <vector>
#include <queue>
#define mod 666013
using namespace std;
int t, op, x, y, ok;
vector <int> v[666013];
vector <int>::iterator it;
int main()
{
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
scanf("%d", &t);
while(t)
{
t--;
scanf("%d%d", &op, &x);
y=x%mod;
for(it=v[y].begin();it!=v[y].end();it++)
if(*it==x) break;
if(it!=v[y].end()) ok=1;
else ok=0;
if(op==1&&ok==0) v[y].push_back(x);
if(op==2&&ok==1) v[y].erase(it);
if(op==3) printf("%d\n", ok);
}
return 0;
}