Pagini recente » Borderou de evaluare (job #1388049) | Cod sursa (job #1518389) | Cod sursa (job #2165369) | Cod sursa (job #1976081) | Cod sursa (job #748115)
Cod sursa(job #748115)
#include<list>
#include<stdio.h>
using namespace std;
FILE*f=fopen("hashuri.in","r");
FILE*g=fopen("hashuri.out","w");
list<int>L[600000];
list<int>::iterator it;
int ok,mod,nr,op,i,n;
int main(){
fscanf(f,"%d",&n);
for(i=1;i<=n;i++){
fscanf(f,"%d%d",&op,&nr);
mod=nr%599999;ok=1;
for(it=L[mod].begin();it!=L[mod].end();it++)
if((*it)==nr){
ok=0;
break;
}
switch(op){
case 1:
if(ok)
L[mod].push_back(nr);
break;
case 2:
if(!ok)
L[mod].erase(it);
break;
default:
if(!ok)
fprintf(g,"%d\n",1);
else
fprintf(g,"%d\n",0);
break;
}
}
return 0;
}