Pagini recente » Cod sursa (job #3180489) | Cod sursa (job #2149210) | Cod sursa (job #2805191) | Cod sursa (job #2348275) | Cod sursa (job #2812602)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
const int mod = 7e5 + 1;
vector <int> h[mod+5];
int get(int rest, int x) {
for(int i = 0; i < h[rest].size(); ++i)
if(h[rest][i] == x)
return 1;
return -1;
}
int main()
{
int n; fin >> n;
for(int i = 1; i <= n; ++i) {
int op, x; fin >> op >> x;
int rest = x % mod;
if(op == 1) {
if(get(rest, x) == -1)
h[rest].push_back(x);
} else if(op == 2) {
int i = get(rest, x);
if(i >= 0) h[rest].erase(h[rest].begin()+i-1);
} else {
int i = get(x % mod, x);
if(i != -1) fout << "1\n";
else fout << "0\n";
}
}
return 0;
}