Pagini recente » Cod sursa (job #2491150) | Cod sursa (job #523956) | Cod sursa (job #2862498) | Cod sursa (job #1641150) | Cod sursa (job #1862329)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
const int mod= 66013;
vector <int> g[1000001];
int main()
{
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
int i,n,q,x,j,pp,r,s;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>q>>x;
if(q==1)
{
r=x%mod;
g[r].push_back(x);
}
if(q==2)
{
r=x%mod;
s=g[r].size();
for(j=0;j<s;j++)
if(g[r][j]==x)
g[r][j]=-1;
}
if(q==3)
{
r=x%mod;
s=g[r].size();
pp=0;
for(j=0;j<s;j++)
if(g[r][j]==x)
pp=1;
fout<<pp<<"\n";
}
}
return 0;
}