Pagini recente » Cod sursa (job #860653) | Cod sursa (job #2984257) | Cod sursa (job #708296) | Cod sursa (job #1496426)
#include <cstdio>
#define magic 9341
using namespace std;
long ma[magic][2500],n,i,type,par,ha,pos;
long cauta (long par, long ha)
{
long i,pos=0;
for (i=1; i<=ma[ha][0]; i++)
if (ma[ha][i]==par)
pos=i;
return pos;
}
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%ld",&n);
for (i=1; i<=n; i++)
{
scanf("%ld%ld",&type,&par);
ha=par%magic;
pos=cauta(par,ha);
if (type==1)
if (pos==0)
{
ma[ha][0]++;
ma[ha][ma[ha][0]]=par;
}
if (type==2)
if (pos>0)
{
ma[ha][pos]= ma[ha][ma[ha][0]];
ma[ha][0]--;
}
if (type==3)
{
if (pos>0)
{printf("1\n");}
else
{printf("0\n");}
}
}
return 0;
}