Pagini recente » Cod sursa (job #1333177) | Cod sursa (job #46925) | Cod sursa (job #2067952) | Cod sursa (job #2877001) | Cod sursa (job #2038303)
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
const int M=666013;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
vector<int>TA[M+5];
int main()
{
int n,op,x;
vector<int>::iterator it;
cin>>n;
for(int i=1;i<=n;i++){
cin>>op>>x;
if(op==1)
TA[x%M].push_back(x);
if(op==2){
it=find(TA[x%M].begin(),TA[x%M].end(),x);
if(it!=TA[x%M].end())
TA[x%M].erase(it);
}
if(op==3){
it=find(TA[x%M].begin(),TA[x%M].end(),x);
if(it!=TA[x%M].end())
cout<<1<<'\n';
else
cout<<0<<'\n';
}
}
return 0;
}