Pagini recente » Cod sursa (job #1050800) | Cod sursa (job #1573815) | Cod sursa (job #2781698) | Cod sursa (job #11797) | Cod sursa (job #2579912)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
const int N = 1000001, M = 666019;
int t, q, x;
vector <int> a[N];
void adauga(int x)
{
int categ = x % M;
a[categ].push_back(x);
}
int exista(int x)
{
int categ = x % M;
for(int i = 0; i < a[categ].size(); i++)
if(a[categ][i] == x)
return 1;
return 0;
}
void sterge(int x)
{
int categ = x % M;
for(int i = 0; i < a[categ].size(); i++)
if(a[categ][i] == x)
a[categ].erase(a[categ].begin() + i);
}
int main()
{
in >> t;
for(int i = 1; i <= t; i++)
{
in >> q >> x;
if(q == 1)
{
adauga(x);
}
else if(q == 2)
{
sterge(x);
}
else {
out << exista(x) << "\n";
}
}
return 0;
}