Pagini recente » Cod sursa (job #748038) | Cod sursa (job #2791435) | Cod sursa (job #1556555) | Cod sursa (job #192073) | Cod sursa (job #2038305)
#include<cstdio>
#include<vector>
#include<algorithm>
using namespace std;
const int M = 666013;
vector< int > v[M+5];
vector < int > :: iterator it;
int main()
{
int n , i , op , nr , j;
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
for(i = 1 ;i<= n ; i++){
scanf("%d%d",&op,&nr);
if(op == 1)
{
v[nr%M].push_back(nr);
}
if( op == 3)
{
it = find(v[nr%M].begin(), v[nr%M].end() , nr);
if(it!=v[nr%M].end()){
printf("1\n");
}
else
printf("0\n");
}
if(op == 2)
{
it = find(v[nr%M].begin(), v[nr%M].end() , nr);
if(it!=v[nr%M].end()){
v[nr%M].erase(it);
}
}
}
}