Pagini recente » Istoria paginii runda/cexph | Cod sursa (job #1961671) | Cod sursa (job #2230949) | Cod sursa (job #2614925) | Cod sursa (job #640548)
Cod sursa(job #640548)
#include <stdio.h>
#include <vector>
#define P 200
using namespace std;
long n, i, t, v;
vector <long> V[P + 10];
int main() {
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
scanf("%ld", &n);
for (i = 1; i <= n; ++i) {
scanf("%ld %ld", &t, &v);
if (t == 1) {
long aux = v % P;
long S = V[aux].size();
long ok = 0;
for (long j = 0; j < S; ++j)
if (V[aux][j] == v) {
ok = 1;
break;
}
if (!ok) V[aux].push_back(v);
}
if (t == 2) {
long aux = v % P;
long S = V[aux].size();
for (long j = 0; j < S; ++j)
if (V[aux][j] == v) {
V[aux][j] = -1;
break;
}
}
if (t == 3) {
long aux = v % P;
long S = V[aux].size();
long ok = 0;
for (long j = 0; j < S; ++j)
if (V[aux][j] == v) {
printf("1\n");
ok = 1;
break;
}
if (ok == 0) printf("0\n");
}
}
return 0;
}