Pagini recente » Cod sursa (job #206241) | Cod sursa (job #765824) | Cod sursa (job #2932436) | Cod sursa (job #2516183) | Cod sursa (job #2271961)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
const int MOD = 666013;
int main()
{
int n;
in >> n;
vector<vector<int> > v(MOD + 1, vector<int>());
for (int i = 1; i <= n; i++)
{
int tip, x;
in >> tip >> x;
int grupa = x % MOD;
if (tip == 1)
{
bool OK = false;
for (int j = 0; j < v[grupa].size(); i++)
if (v[grupa][j] == x)
{
OK = true;
break;
}
if (OK == false)
v[grupa].push_back(x);
}
if (tip == 2)
{
for (int j = 0; j < v[grupa].size(); i++)
if (v[grupa][j] == x)
{
swap(v[grupa][j], v[grupa][v[grupa].size() - 1]);
v[grupa].pop_back();
break;
}
}
if (tip == 3)
{
bool OK = false;
for (int j = 0; j < v[grupa].size(); i++)
if (v[grupa][j] == x)
{
OK = true;
out << 1 << '\n';
break;
}
if (OK == false)
out << 0 << '\n';
}
}
return 0;
}