Pagini recente » Cod sursa (job #1212749) | Cod sursa (job #1073850) | Cod sursa (job #2892134) | Cod sursa (job #381348) | Cod sursa (job #2911753)
#include <iostream>
#include <fstream>
#include <cstdlib>
using namespace std;
int v[1000000];
int cnt = 0;
bool traverse(int x){
int i;
for(i = 0; i<cnt; i++)
if(x == v[i]) return true;
return false;
}
void deleteItem(int x){
int i, j;
for(i = 0; i<cnt; i++)
if(x == v[i])
for(j = i; j<cnt-1; j++)
v[j] = v[j+1];
cnt--;
}
int main(){
ifstream fin;
ofstream fout;
fin.open("hashuri.in");
fout.open("hashuri.out");
int N, x, y, i;
fin >> N;
for(i = 0; i<N; i++){
fin >> x >> y;
if(x == 1){
if(traverse(y) == false){
v[cnt] = y;
cnt++;
}
}
else if(x == 2){
if(traverse(y)){
deleteItem(y);
}
}
else{
if(traverse(y))
fout << 1 <<"\n";
else
fout << 0 << "\n";
}
}
fin.close();
return 0;
}