Pagini recente » Istoria paginii utilizator/licaana | Istoria paginii runda/dutzlangos/clasament | Cod sursa (job #2077009) | Cod sursa (job #460076) | Cod sursa (job #323631)
Cod sursa(job #323631)
#include <cstdio>
#include <vector>
#define MOD 666013
using namespace std;
vector <long> H[1000001];
long long N,NR,i;
int OP,semaforel;
inline int suta(int x)
{
return x%MOD;
}
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%lld",&N);
while(N--)
{
scanf("%d %lld",&OP,&NR);
if(OP==1) H[suta(NR)].push_back(NR);
else
if(OP==2)
{
for(i=0;i<H[suta(NR)].size();++i)
if(NR==H[suta(NR)][i]) H[suta(NR)][i]=-1;
}
else
if(OP==3)
{ semaforel=0;
for(i=0;i<H[suta(NR)].size();++i)
if(NR==H[suta(NR)][i]) semaforel=1;
printf("%d\n",semaforel);
}
}
return 0;
}