Pagini recente » Cod sursa (job #1665600) | Clasament 6657 | Cod sursa (job #895254) | Cod sursa (job #1612294) | Cod sursa (job #2216685)
#include <fstream>
#include <vector>
#define MOD 999983
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector< vector<int> > a;
int n;
void add(int x)
{
int h = x % MOD;
a[h].push_back(x);
}
bool query(int x)
{
int h = x % MOD;
for ( int i = 0; i < a[h].size(); i ++)
if (a[h][i] == x)
return 1;
return 0;
}
void del(int x)
{
int h = x % MOD;
for ( int i = 0; i < a[h].size(); i ++ )
if(a[h][i] == x)
{
a[h].erase(a[h].begin()+i);
return;
}
}
int main()
{
f >> n;
a = vector< vector<int> >(MOD);
for ( int i = 1, x, cer; i <= n; i ++ )
{
f >> cer >> x;
if(cer == 1) add(x);
else
if(cer == 2) del(x);
else
g << query(x) << '\n';
}
return 0;
}