Pagini recente » Cod sursa (job #2213678) | Cod sursa (job #2473252) | Cod sursa (job #993780) | Cod sursa (job #831797) | Cod sursa (job #607774)
Cod sursa(job #607774)
#include<stdio.h>
#include<vector>
#define MOD 904999
using namespace std;
vector<int> H[MOD];
inline bool found(int value)
{
int go = value % MOD;
vector<int> :: iterator it;
for(it = H[go].begin(); it != H[go].end() ; it ++)
if(*it == value)
return 1;
return 0;
}
inline void add(int value)
{
int go = value % MOD;
vector<int> :: iterator it;
for(it = H[go].begin(); it != H[go].end() ; it ++)
if (*it == -1)
{
*it = value;
return ;
}
H[go].push_back(value);
}
inline void del(int value)
{
int go = value % MOD;
vector<int> :: iterator it;
for(it = H[go].begin(); it != H[go].end() ; it ++)
if (*it == value)
{
*it = -1;
return ;
}
}
int main()
{
int N,tip,number;
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&N);
while(N--)
{
scanf("%d%d",&tip,&number);
if(tip == 1)
if(!found(number))
add(number);
if(tip == 2)
del(number);
if(tip == 3)
printf("%d\n",found(number));
}
return 0;
}