Pagini recente » Cod sursa (job #3039805) | Cod sursa (job #2439607) | Cod sursa (job #892493) | Cod sursa (job #2868019) | Cod sursa (job #1550077)
#include <fstream>
#define z 666013
using namespace std;
int n,a[1000000],b[1000000],r[z],e,t,c,x,i,p;
bool ok;
int main()
{
ifstream f("hashuri.in");
ofstream g("hashuri.out");
f >> n;
for(i=1;i<=n;i++){
f >> t >> x;
switch(t){
case 1:
e=x%z;
ok=1;
p=r[e];
while(p){
if(a[p]==x){
ok=0;
break;
}
p=b[p];
}
if(ok){
a[c]=x;
b[c]=r[e];
r[e]=c;
c++;
}
break;
case 2:
e=x%z;
p=r[e];
while(p){
if(a[p]==x){
a[p]=-1;
break;
}
p=b[p];
}
break;
default:
e=x%z;
p=r[e];
ok=1;
while(p){
if(a[p]==x){
ok=0;
g << 1 << endl;
break;
}
p=b[p];
}
if(ok) g << 0 << endl;
}
}
}