Pagini recente » Cod sursa (job #1122350) | Cod sursa (job #822452) | Cod sursa (job #1849528) | Cod sursa (job #3167114) | Cod sursa (job #1702109)
#include <bits/stdc++.h>
#define nmax 1000006
using namespace std;
int n, op, x;
vector <int> v;
int main() {
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
cin>>n;
for(int i=1; i<=n; i++) {
cin>>op>>x;
if(op == 1) {
// trebuie adaugat
bool gasit = false;
for(int j=0; j<v.size(); j++)
if(v[j] == x)
gasit = true;
if(!gasit)
v.push_back(x);
}
else if(op == 2) {
// trebuie sters
for(int j=0; j<v.size(); j++)
if(v[j] == x) {
v[j] = v[v.size()-1];
v.pop_back();
}
}
else {
// trebuie raspuns la intrebare
bool gasit = false;
for(int j=0; j<v.size(); j++)
if(v[j] == x)
gasit = true;
if(gasit)
cout<<"1\n";
else
cout<<"0\n";
}
}
return 0;
}