Pagini recente » Cod sursa (job #2174385) | Cod sursa (job #1696115) | Cod sursa (job #703117) | Cod sursa (job #3182144) | Cod sursa (job #1253431)
#include <cstdio>
#include <vector>
#include <algorithm>
#define MOD 666013
using namespace std;
int t;
vector<int> v[MOD];
int main()
{
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
scanf("%d", &t);
for (;t--;){
int op, x, mod;
vector<int>::iterator pos;
scanf("%d %d", &op, &x);
mod = x%MOD;
pos = find(v[mod].begin(), v[mod].end(), x);
switch (op){
case 1:
if (pos==v[mod].end())
v[mod].push_back(x);
break;
case 2:
if (pos!=v[mod].end()){
*pos = v[mod].back();
v[mod].pop_back();
}
break;
case 3:
printf("%d\n", pos!=v[mod].end() ? 1 : 0);
break;
}
}
return 0;
}