Pagini recente » Cod sursa (job #1970614) | Cod sursa (job #209011) | Borderou de evaluare (job #2040106) | Cod sursa (job #686610) | Cod sursa (job #2501247)
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
#define mod 666013
vector <int> h[mod];
int n,t,x;
inline vector<int> :: iterator _find(int x)
{
int p=x%mod;
vector <int> :: iterator it;
for(it=h[p].begin();it!=h[p].end();it++)
if(*it==x)
return it;
return h[p].end();
}
inline void add(int x)
{
int p=x%mod;
if(_find(x)==h[p].end())
h[p].push_back(x);
}
inline void dell(int x)
{
int p=x%mod;
vector <int> :: iterator it=_find(x);
if(it!=h[p].end())
h[p].erase(it);
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>t;
cin>>x;
if(t==1)
{
add(x);
}
if(t==2)
{
dell(x);
}
if(t==3)
{
int p=x%mod;
cout<<(_find(x)!=h[p].end()? 1 : 0)<<endl;
}
}
return 0;
}