Pagini recente » Cod sursa (job #294083) | Cod sursa (job #1444122) | Cod sursa (job #2960211) | Cod sursa (job #1331305) | Cod sursa (job #982566)
Cod sursa(job #982566)
#include <cstdio>
#include <vector>
using namespace std;
long n;
long tip, val;
vector<long> v[666013];
const long koin = 666013;
int main() {
long i, j;
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
scanf("%ld\n", &n);
for(i = 1; i <= n; i++) {
scanf("%ld %ld", &tip, &val);
if(tip == 1)
v[val % koin].push_back(val);
else if(tip == 3) {
for(j = 0; j < v[val % koin].size(); j++)
if(v[val % koin][j] == val) {
printf("1\n");
break;
}
if(j == v[val % koin].size())
printf("0\n");
} else if(tip == 2) {
for(j = 0; j < v[val % koin].size(); j++)
if(v[val % koin][j] == val) {
v[val % koin].erase(v[val % koin].begin() + j);
break;
}
}
}
return 0;
}