Pagini recente » Cod sursa (job #1287480) | Statistici Edward Ursinschi (Ediurs) | Cod sursa (job #496663) | Cod sursa (job #374643) | Cod sursa (job #1551674)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,op,x;
const int MOD = 6601313;
vector<int> G[MOD + 1];
vector<int>::iterator serc(int x)
{
vector<int>::iterator it;
int care = x % MOD;
for(it = G[care].begin(); it != G[care].end(); ++it)
if(*it == x)
return it;
return G[care].end();
}
int main()
{
f >> n;
for(int i = 1; i <= n; ++i)
{
f >> op >> x;
if(op == 1)
{
if(serc(x) == G[x % MOD].end())
G[x % MOD].push_back(x);
}
if(op == 2)
{
vector<int>::iterator it = serc(x);
if(it != G[x % MOD].end())
G[x % MOD].erase(it);
}
if(op == 3) g << (serc(x) != G[x % MOD].end()) << "\n";
}
return 0;
}