Pagini recente » Cod sursa (job #2892210) | Cod sursa (job #1989348) | Cod sursa (job #2265346) | Cod sursa (job #2958627) | Cod sursa (job #2397817)
#include <fstream>
#include <vector>
int mod = 500003;
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector <int> v[500004];
int n,o,x;
int main()
{
fin>>n;
for(int i=1;i<=n;i++)
{
fin>>o>>x;
int k=x%mod;
if(o==1)
v[x%mod].push_back(x);
else if(o==2)
{
for(int j=0;j<v[k].size();j++)
if(v[k][j]==x)
{
v[k].erase(v[k].begin()+j);
break;
}
}
else if(o==3)
{
bool ok=1;
for(int j=0;j<v[k].size();j++)
if(v[k][j]==x)
{
fout<<"1\n";
ok=0;
break;
}
if(ok==1)
fout<<"0\n";
}
}
return 0;
}