Pagini recente » Cod sursa (job #2851721) | Cod sursa (job #2687649) | Cod sursa (job #1857130) | Cod sursa (job #2134847) | Cod sursa (job #951464)
Cod sursa(job #951464)
#include<cstdio>
#include<vector>
#define mod 666013
using namespace std;
int n,m,i,j,x,tip;
vector<int>v[mod];
void adauga()
{
for(j=0;j<v[x%mod].size();j++)
if(v[x%mod][j]==x) return;
v[x%mod].push_back(x);
}
void sterge()
{
for(j=0;j<v[x%mod].size();j++)if(v[x%mod][j]==x){v[x%mod].erase(v[x%mod].begin()+j);return ;}
}
void afisare()
{
for(j=0;j<v[x%mod].size();j++)
if(v[x%mod][j]==x){printf("1\n");return ;}
printf("0\n");
}
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
for(i=1;i<=n;i++){
scanf("%d %d",&tip,&x);
if(tip==1)adauga();
else if(tip==2)sterge();
else afisare();
}
return 0;
}