Pagini recente » Cod sursa (job #2689216) | Cod sursa (job #3201453) | Cod sursa (job #2345915) | Cod sursa (job #2749162) | Cod sursa (job #3281961)
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> v[666030];
const int mod=666013;
void adauga (int x)
{
int gr=x%mod;
bool ok=1;
for (int i=0; i<v[gr].size(); i++)
{
if (v[gr][i]==x)
{
ok=0;
break;
}
}
if (ok)
v[gr].push_back(x);
}
void sterge (int x)
{
int gr=x%mod;
for (int i=0; i<v[gr].size(); i++)
{
if (v[gr][i]==x)
{
v[gr].erase(v[gr].begin()+i);
return;
}
}
}
void cauta (int x)
{
int gr=x%mod;
bool ok=0;
for (int i=0; i<v[gr].size(); i++)
{
if (v[gr][i]==x)
{
ok=1;
break;
}
}
g << ok << '\n';
}
int main ()
{
int n;
f >> n;
while (n--)
{
int tip, x;
f >> tip >>x;
if (tip==1) adauga (x);
if (tip==2) sterge(x);
if (tip==3) cauta(x);
}
}