Pagini recente » Cod sursa (job #1887474) | Cod sursa (job #1039796) | Cod sursa (job #1606756) | Cod sursa (job #788427) | Cod sursa (job #2780561)
#include<cstdio>
#include<queue>
#include<unordered_set>
using namespace std;
FILE*in=fopen("hashuri.in","r");
FILE*out=fopen("hashuri.out","w");
const int mod=100153;
unordered_set<int> s[mod];
int n,i,op,a;
int main()
{
fscanf(in,"%d",&n);
for(i=1;i<=n;i++)
{
fscanf(in,"%d%d",&op,&a);
int r=a%mod;
if(op==1)
{
s[r].insert(a);
}
else if(op==2)
{
s[r].erase(a);
}
else
{
if(s[r].find(a)!=s[r].end())
{
fprintf(out,"1\n");
}
else
{
fprintf(out,"0\n");
}
}
}
}