Pagini recente » Cod sursa (job #1664265) | Cod sursa (job #2222483) | Cod sursa (job #2767487) | Cod sursa (job #1132595) | Cod sursa (job #2472936)
#include <bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int NMAX = 666013;
int n;
vector <int> v[NMAX];
void add(int x){
v[x % NMAX].push_back(x);
}
int is(int x){
int i = x % NMAX;
for(int j = 0 ; j < v[i].size() ; j++)
if(v[i][j] == x)
return j;
return -1;
}
void Delete(int x, int j){
int i = x % NMAX;
v[i].erase(v[i].begin() + j);
}
int main(){
int x,y,it;
f >> n;
while(n--){
f >> x >> y;
if(x == 3){
if(is(y) == -1)
g << 0 << "\n";
else
g << 1 << "\n";
}else
if(x == 1){
if(is(y) == -1)
add(y);
}else{
it = is(y);
if(it == -1)
continue;
Delete(y, it);
}
}
return 0;
}