Pagini recente » Cod sursa (job #283775) | Cod sursa (job #382398) | Cod sursa (job #397313) | Cod sursa (job #2201185) | Cod sursa (job #782548)
Cod sursa(job #782548)
#include <stdio.h>
#include <set>
#define MAX 306013
using namespace std;
FILE *fi, *fo;
int n;
int i,op,x,h;
set <int> H[MAX];
set <int> :: iterator it;
int main()
{
fi=fopen("hashuri.in","r");
fo=fopen("hashuri.out","w");
fscanf(fi,"%d",&n);
for (i=1;i<=n;i++)
{
fscanf(fi,"%d%d",&op,&x);
if (op==1)
{
h=x%MAX;
H[h].insert(x);
}
if (op==2)
{
h=x%MAX;
H[h].erase(x);
}
if (op==3)
{
h=x%MAX;
it=H[h].find(x);
if (it==H[h].end())
fprintf(fo,"0\n");
else
fprintf(fo,"1\n");
}
}
fclose(fi);
fclose(fo);
return 0;
}