Pagini recente » Cod sursa (job #1974861) | Cod sursa (job #2712014) | Cod sursa (job #2887404) | Cod sursa (job #1927281) | Cod sursa (job #2891275)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector<long long >h[666073];
int cauta(long long x)
{
int ok = 0;
for (auto i = h[x%666073].begin();i != h[x%666073].end();++i)
if(*i == x)
ok = 1;
if(ok == 1)
return 1;
else
return 0;
}
void adauga(long long x)
{
if(cauta(x) == 1)
return;
else
h[x%666073].push_back(x);
}
void sterge(long long x)
{
if(cauta(x) == 1)
h[x%666073].pop_back();
else
return;
}
int main() {
long long n,op,x;
f>>n;
while (f>>op>>x)
{
switch (op) {
case 1:
adauga(x);
break;
case 2:
sterge(x);
break;
case 3:
g<<cauta(x)<<'\n';
break;
default:
break;
}
}
f.close();g.close();
return 0;
}