Pagini recente » Cod sursa (job #1970007) | Istoria paginii runda/simple_oni_sim | Cod sursa (job #296218) | Cod sursa (job #2892649) | Cod sursa (job #2976589)
#include<fstream>
#include<vector>
#include<algorithm>
#define mod 999973
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
vector<int> a[mod];
vector<int>::iterator it;
int x,n;
int main()
{cin>>n;
int i=1;
for(;i<=n;i++)
{
int op;
cin>>op>>x;
int j=x%mod;
if(op==1)
{
it=find(a[j].begin(),a[j].end(),x);
if(it!=a[j].end())
a[j].push_back(x);
}
if(op==2)
{for(int k=0;k<a[j].size();k++)
if(a[j][k]==x)
{a[j][k]=0;
break;
}
}
if(op==3)
{ it=find(a[j].begin(),a[j].end(),x);
if(it!=a[j].end())
cout<<"1";
else cout<<"0";
cout<<'\n';
}
}
}