Pagini recente » Cod sursa (job #308010) | Cod sursa (job #1766451) | Cod sursa (job #2798969) | Cod sursa (job #1236550) | Cod sursa (job #1582707)
#include <fstream>
#define maxim 1000081
using namespace std;
int N, oper , x;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
typedef struct nod{
int info;
nod* next;
}* lnod;
lnod H[maxim];
void add(lnod &a, int info){
lnod b = new nod;
b->info = info;
b->next = a;
a = b;
}
bool este(int info){
for(lnod l = H[info % maxim]; l!=NULL; l = l->next)
if(l->info == info) return 1;
return 0;
}
int main(){
cin >> N;
for(int i = 1; i <= N; i++){
cin >> oper >> x;
if(oper == 1){
if(este(x) == 0)
add(H[x % maxim] , x);
}
if(oper == 2){
if(este(x) == 1)
for(lnod l = H[x % maxim]; l!=NULL; l = l->next)
if(l->info == x){
l->info = - 1;
}
}
if(oper == 3){
cout << este(x) <<"\n";
}
}
return 0;
}