Pagini recente » Cod sursa (job #2660694) | Cod sursa (job #535478) | Cod sursa (job #1408236) | Cod sursa (job #2946357) | Cod sursa (job #1391582)
#include <cstdio>
#include <vector>
#define MOD 1000023
using namespace std;
FILE *fin, *fout;
int n, sizen, p, x, pos;
vector <int> hash[MOD];
bool f;
int main()
{
fin = freopen("hashuri.in", "r", stdin);
fout = freopen("hahsuri.out", "w", stdout);
scanf("%d", &n);
for(int t = 0; t< n; t++)
{
scanf("%d%d", &p, &x);
if(p == 1)
{
pos = x%MOD;
sizen = hash[pos].size();
f = 0;
for(int i = 0; i< sizen; i++)
{
if(hash[pos][i] == x) f = 1;
}
if(f == 0) hash[pos].push_back(x);
}
if(p == 2)
{
pos = x%MOD;
sizen = hash[pos].size();
for(int i = 0; i< sizen; i++)
{
if(hash[pos][i] == x) hash[pos][i] = -1;
}
}
if(p == 3)
{
pos = x%MOD;
sizen = hash[pos].size();
f = 0;
for(int i = 0; i< sizen; i++)
{
if(hash[pos][i] == x) f = 1;
}
printf("%d\n", f);
}
}
fclose(fin);
fclose(fout);
return 0;
}