Pagini recente » Cod sursa (job #1514651) | Cod sursa (job #1255470) | Cod sursa (job #2039253) | Profil EugenStoica | Cod sursa (job #2065440)
#include <iostream>
#include <fstream>
#include <vector>
#define max 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n, o, x;
vector <int> H[max];
void adaug (int x)
{
int ind = x%max;
for (int i = 0; i < H[ind].size(); i++)
if (H[ind][i] == x)
return;
H[ind].push_back(x);
}
void scot (int x)
{
int ind = x%max;
for (vector <int> :: iterator it = H[ind].begin(); it != H[ind].end(); it++)
if (*it == x)
{
H[ind].erase(it);
return;
}
}
bool este (int x)
{
int ind = x%max;
for (int i = 0; i < H[ind].size(); i++)
if (H[ind][i] == x)
return 1;
return 0;
}
int main () {
fin >> n;
for (int i = 1; i <= n; i++)
{
fin >> o >> x;
if (o == 1) adaug(x);
if (o == 2) scot(x);
if (o == 3) fout << este(x) << "\n";
}
}