Pagini recente » Cod sursa (job #2804432) | Cod sursa (job #2653358) | Cod sursa (job #2587409) | Cod sursa (job #2784634) | Cod sursa (job #2328516)
#include <bits/stdc++.h>
using namespace std;
#define mod 1000000007
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n,x,tip;
vector <int> v[1000010];
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>tip>>x;
int p=x%mod;
if(tip==1)
v[p].push_back(x);
else
if(tip==2)
{
for(int j=0;j<v[p].size();j++)
if(v[p][j]==x)
{
v[p].erase(v[p].begin()+j);
break;
}
}
else
{
int ok=0;
for(int j=0;j<v[p].size();j++)
if(v[p][j]==x)
{
ok=1;
fout<<1;
break;
}
if(!ok)
fout<<0;
fout<<'\n';
}
}
return 0;
}