Pagini recente » Cod sursa (job #698560) | Cod sursa (job #2029756) | Cod sursa (job #2364451) | Cod sursa (job #1264997) | Cod sursa (job #2744516)
#include <bits/stdc++.h>
using namespace std;
vector <int> v[999983];
void inserare(int x)
{
int poz = x % 999983;
for (int i = 0; i < v[poz].size(); i++)
if (v[poz][i] == x)
return;
v[poz].push_back(x);
}
void stergere(int x)
{
int poz = x % 999983;
for (int i = 0; i < v[poz].size(); i++)
if (v[poz][i] == x)
{
v[poz].erase(v[poz].begin() + i);
return;
}
}
bool exista(int x)
{
int poz = x % 999983;
for (int i = 0; i < v[poz].size(); i++)
if (v[poz][i] == x)
return 1;
return 0;
}
int main()
{
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n, caz, x;
fin>>n;
for (int i = 0; i < n; i++)
{
fin>>caz>>x;
switch(caz)
{
case 1: {inserare(x); break;}
case 2: {stergere(x); break;}
case 3: {fout<<exista(x)<<endl; break;}
}
}
}