Pagini recente » Cod sursa (job #3241091) | Cod sursa (job #779440) | Cod sursa (job #3240469) | Cod sursa (job #2835964) | Cod sursa (job #2708076)
#include <bits/stdc++.h>
#define P 66603
using namespace std;
vector<vector<int> > m(P);
vector<int>::iterator exists(int v)
{
int poz=v%P;
for(vector<int>::iterator res=m[poz].begin();res<m[poz].end();res++)
if (*res==v) return res;
return m[poz].end();
}
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
int n,a,b;
cin>>n;
for(int i=0;i<n;i++)
{
cin>>a>>b;
vector<int>::iterator j=exists(b);
switch(a)
{
case 1:
if(j==m[b%P].end())
m[b%P].push_back(b);
break;
case 2:
if(j!=m[b%P].end())
m[b%P].erase(j);
break;
case 3:
if(j!=m[b%P].end())
cout<<1<<'\n';
else
cout<<0<<'\n';
}
}
return 0;
}