Pagini recente » Cod sursa (job #2058669) | Cod sursa (job #230261) | Cod sursa (job #249039) | Cod sursa (job #2697348) | Cod sursa (job #3141329)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
const int dim = 123457;
vector <int> v[dim];
int q , num , op;
void Adauga (int num)
{
int pos = num % dim;
v[pos].push_back(num);
}
void Sterge (int num)
{
int pos = num % dim;
for(int i = 0 ; i < v[pos].size() ; ++i)
if(v[pos][i] == num)
v[pos][i] = -1;
}
void Cauta (int num)
{
int pos = num % dim;
for(int i = 0 ; i < v[pos].size() ; ++i)
if(v[pos][i] == num)
{
fout << "1\n";
return;
}
fout << "0\n";
}
int main()
{
fin >> q;
while(q--)
{
fin >> op >> num;
if(op == 1)
Adauga(num);
else if(op == 2)
Sterge(num);
else
Cauta(num);
}
}