Pagini recente » Cod sursa (job #1588456) | Cod sursa (job #1557822) | Cod sursa (job #1559033) | Monitorul de evaluare | Cod sursa (job #2416321)
#include <bits/stdc++.h>
#define mod 700001
using namespace std;
ifstream f ( "hashuri.in" ); ofstream g ( "hashuri.out" );
vector < int > H[mod];
vector < int > :: iterator tip3(int x)
{ int index=x%mod;
for(vector < int > :: iterator it=H[index].begin();it!=H[index].end();++it)
if(*it==x) return it;
return H[index].end();
}
void tip1(int x)
{ int index=x%mod;
if(tip3(x)==H[index].end()) H[index].push_back(x);
}
void tip2(int x)
{ int index=x%mod;
vector < int > :: iterator it=tip3(x);
if(it!=H[index].end()) H[index].erase(it);
}
int main()
{ int n,tip,x;
f>>n;
while(n--)
{ f>>tip>>x;
if(tip==1) tip1(x);
if(tip==2) tip2(x);
if(tip==3) g<<(tip3(x)!=H[x%mod].end())<<'\n';
}
return 0;
}