Pagini recente » Cod sursa (job #1376677) | Cod sursa (job #132306) | Cod sursa (job #637020) | Cod sursa (job #2321041) | Cod sursa (job #1442216)
#include <stdio.h>
#include <vector>
const int Mod = 7111;
using namespace std;
int N,op,x;
vector<int> T[Mod];
inline void ins(int x)
{
int value = x % Mod;
bool ok = false;
vector<int>::iterator i;
for (i = T[value].begin();i != T[value].end();i++)
if (*i == x)
{
ok = true;
break;
}
if (!ok) T[value].push_back(x);
}
inline void del(int x)
{
int value = x % Mod;
vector<int>::iterator i;
for (i = T[value].begin();i != T[value].end();i++)
if (*i == x)
{
T[value].erase(i);
break;
}
}
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&N);
for (int j = 1;j <= N;j++)
{
scanf("%d %d",&op,&x);
if (op == 1)
{
ins(x);
continue;
}
if (op == 2)
{
del(x);
continue;
}
int value = x % Mod;
vector<int>::iterator i;
bool ok = false;
for (i = T[value].begin();i != T[value].end();i++)
if (*i == x)
{
ok = true;
printf("%d\n",1);
break;
}
if (!ok) printf("%d\n",0);
}
return 0;
}