Pagini recente » Cod sursa (job #2189122) | Cod sursa (job #2424994) | Cod sursa (job #2924119) | Cod sursa (job #2734676) | Cod sursa (job #1226573)
#include <cstdio>
#include <vector>
using namespace std;
const int mod=666013;
vector <int> v[mod];
int n,a,x,i,j,k;
int main()
{
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
for(scanf("%d",&n);n;n--)
{
scanf("%d%d",&a,&x);
i=x%mod;
k=0;
for(j=0;j<v[i].size();j++) if(v[i][j]==x){k=1;break;}
if(a==1)
{
if(k==0) v[i].push_back(x);
}
else if(a==2)
{
if(k)
{
v[i][j]=v[i][v[i].size()-1];
v[i].pop_back();
}
}
else printf("%d\n",k);
}
return 0;
}