Pagini recente » Cod sursa (job #518739) | Cod sursa (job #3180455) | Cod sursa (job #3209023) | Cod sursa (job #1852773)
#include <fstream>
#include <vector>
#define mod 666013
using namespace std;
ifstream f ("hashuri.in");
ofstream g ("hashuri.out");
vector <int> h[mod];
vector <int> :: iterator it;
int i, n, op, x, ind;
vector <int> :: iterator cauta(int x)
{
for(it= h[ind].begin(); it!=h[ind].end(); it++)
if (*it==x) return it;
return it;
}
void add (int x)
{
if(it==h[ind].begin()) h[ind].push_back(x);
}
void sterge (int x)
{
if(it!=h[ind].end()) h[ind].erase(it);
}
void scrie (int x)
{
if(it==h[ind].end()) g<<0<<'\n';
else g<<1<<'\n';
}
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>op>>x;
ind =x%mod;
it=cauta(x);
if(op==1) add(x);
if(op==2) sterge(x);
if(op==3) scrie(x);
}
return 0;
}