Pagini recente » Cod sursa (job #570665) | Borderou de evaluare (job #2013119) | Cod sursa (job #2541077) | Cod sursa (job #397086) | Cod sursa (job #1324012)
# include <cstdio>
# include <vector>
# define MOD 666013
using namespace std;
int j,INSTR,n,i,x;
vector <int> H[MOD];
vector <int> :: iterator it;
vector <int> :: iterator findv(int x){
for (it=H[j].begin(); it!=H[j].end(); it++ )
if (*it==x) return it;
return it;
}
void f1() {
if ( H[j].end() == it) H[j].push_back(x);
}
void f2(){
if ( H[j].end() != it) H[j].erase(it);
}
void f3(){
if (it == H[j].end()) printf("0\n"); else printf("1\n");
}
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
for (i=1; i<=n; i++) {
scanf("%d",&INSTR);
scanf("%d",&x);
j=x%MOD;
it=findv(x);
if (INSTR == 1 ) f1();
if (INSTR == 2 ) f2();
if (INSTR == 3 ) f3();
}
return 0;
}