Pagini recente » Cod sursa (job #3272636) | Cod sursa (job #62916) | Cod sursa (job #216585) | Cod sursa (job #1901446) | Cod sursa (job #1021989)
#include <fstream>
#include <vector>
using namespace std;
const int mod=666013;
int n,cmd,x,l;
vector<int>v[mod];
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector<int>::iterator find()
{
for(int i=0;i<v[l].size();i++)
if(v[l][i]==x)
return v[l].begin()+i;
return v[l].end();
}
void ins()
{
if(find()==v[l].end())
v[l].push_back(x);
}
void del()
{
vector<int>::iterator it=find();
if(it!=v[l].end())
v[l].erase(it);
}
int main()
{
fin>>n;
while(n--)
{
fin>>cmd>>x;
l=x%mod;
switch(cmd)
{
case 1:
ins();
break;
case 2:
del();
break;
default:
fout<<(find()!=v[l].end())<<"\n";
}
}
return 0;
}