Pagini recente » Cod sursa (job #2920809) | Cod sursa (job #1838549) | Cod sursa (job #9563) | Cod sursa (job #1428979) | Cod sursa (job #549851)
Cod sursa(job #549851)
#include <iostream>
#include <vector>
#define MOD 666013
using namespace std;
int n;
vector<int> a[MOD];
int main(){
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
int i,j,temp1,temp2;
bool jo;
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d %d",&temp1,&temp2);
if(temp1==1){
jo=false;
for(j=0;(j<a[temp2%MOD].size())&&(!jo);j++)
if(a[temp2%MOD][j]==temp2)jo=true;
if(!jo)a[temp2%MOD].push_back(temp2);
}else
if(temp1==2){
for(j=0;j<a[temp2%MOD].size();j++)
if(a[temp2%MOD][j]==temp2){
a[temp2%MOD].erase(a[temp2%MOD].begin()+(j-1));
break;
}
}else{
jo=false;
for(j=0;(j<a[temp2%MOD].size())&&(!jo);j++)
if(a[temp2%MOD][j]==temp2)jo=true;
if(jo){printf("1\n");}else{printf("0\n");}
}
}
return 0;}