Pagini recente » Cod sursa (job #1081781) | Cod sursa (job #1046833) | Cod sursa (job #590272) | Cod sursa (job #1406275) | Cod sursa (job #1862554)
#include <bits/stdc++.h>
using namespace std;
#define ios ios_base::sync_with_stdio(false);cin.tie(0);
#define setnow clock_t tStart=clock();
#define time (double)(clock() - tStart)/CLOCKS_PER_SEC;
typedef long long ll;
typedef long long int lli;
typedef pair < int, int> dbl;
const int maxInt = 1e9*2;
const lli maxLong = 1e18*2;
//
#define mod 1000000
int n;
vector <int> vct[1000001];
int main(){
freopen("hashuri.in", "r", stdin);
freopen("hashuri.out", "w", stdout);
scanf("%d", &n);
for(int i = 0; i < n; i++){
int tp, x;
scanf("%d %d",&tp,&x);
if(tp == 1){
int k = x % mod;
vct[k].push_back(x);
}
if(tp == 2){
int k = x % mod;
for(int j = 0; j < vct[k].size(); j++)
if(vct[k][j] == x){
vct[k][j] = -1;
break;
}
}
if(tp == 3){
int k = x % mod;
bool notFound = 1;
for(int j = 0; j < vct[k].size(); j++)
if(vct[k][j] == x){
printf("%d\n", 1);
notFound = 0;
break;
}
if(notFound)
printf("%d\n", 0);
}
}
}