Pagini recente » Cod sursa (job #1405243) | Cod sursa (job #2691686) | Cod sursa (job #607240) | Cod sursa (job #2329015) | Cod sursa (job #2397327)
#include <fstream>
#include <vector>
#define mod 250000
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> v[mod];
int i,j,a,x,r,ok,n;
int caut(int x){
int r=x%mod;
for(j=0;j<v[r].size();j++)
if(v[r][j]==x)
return j;
return -1;
}
int main()
{ f>>n;
for(i=1;i<=n;i++){
f>>a>>x;
r=x%mod;
if(a==1){
j=caut(x);
if(j==-1)
v[r].push_back(x);
}
else if(a==2){
j=caut(x);
if(j!=-1)
v[r].erase(v[r].begin()+j);
}
else{
j=caut(x);
if(j==-1)
g<<0<<'\n';
else
g<<1<<'\n';
}
}
return 0;
}