Pagini recente » Cod sursa (job #792052) | Cod sursa (job #1903202) | Cod sursa (job #1149938) | Cod sursa (job #2348339) | Cod sursa (job #1451381)
#include<iostream>
#include<bits/stdc++.h>
using namespace std;
#define mod 666013
int N,M,x;
int op;
bool found=0;
vector< vector<int> >hashuri;
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
cin>>N;
hashuri.resize(1000001);
while(N--)
{
cin>>op;
cin>>x;
if(op==1)
{
hashuri[(x)%mod].push_back(x);
}
if(op==3)
{
found=0;
for(int i=0;i<hashuri[x%mod].size();i++)
if(hashuri[x%mod][i]==x){
cout<<"1\n";
found=1;
break;
}
if(!found)
cout<<"0\n";
}
if(op==2)
{
for(int i=0;i<hashuri[x%mod].size();i++)
if(hashuri[x%mod][i]==x){
swap(hashuri[x%mod][i],hashuri[x%mod][hashuri[x%mod].size()-1]);
hashuri[x%mod].pop_back();
}
}
}
return 0;
}