Pagini recente » Cod sursa (job #8675) | Cod sursa (job #2146644) | Cod sursa (job #2213582) | Cod sursa (job #1592957) | Cod sursa (job #1852733)
#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 find_v(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);
}
int scrie (int x)
{
if(it==H[ind].end()) return 0;
else return 1;
}
int main()
{
f>>n;
for(i=1; i<=n; i++)
{
f>>op>>x;
ind =x%mod;
it=find_v(x);
if(op==1) add(x);
if(op==2) sterge(x);
if(op==3) g<<scrie(x)<<'\n';
}
return 0;
}