Pagini recente » Cod sursa (job #2146708) | Cod sursa (job #534919) | Cod sursa (job #723843) | Cod sursa (job #582514) | Cod sursa (job #1711688)
#include <iostream>
#include <fstream>
#include <vector>
#define mod 666013
using namespace std;
vector <int> g[1000001];
int main()
{
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
int n,i,a,b,k=0,r,s,pp;
fin>>n;
for(i=1; i<=n; i++)
{
fin>>a>>b;
if(a==1)
{
r=b%mod;
g[r].push_back(b);
}
if(a==2)
{
r=b%mod;
s=g[r].size();
for(k=0; k<s; k++)
if(g[r][k]==b)
g[r][k]=-1;
}
if(a==3)
{
r=b%mod;
s=g[r].size();
pp=0;
for(k=0; k<s; k++)
if(g[r][k]==b)
pp=1;
fout<<pp<<"\n";
}
}
return 0;
}