Pagini recente » Borderou de evaluare (job #3142562) | Borderou de evaluare (job #1602494) | Cod sursa (job #394028) | Borderou de evaluare (job #2123860) | Cod sursa (job #1097152)
#include <stdio.h>
#include <map>
using namespace std;
int N,NR;
map<int,int> M;
int main()
{
freopen("hashuri.in" ,"r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d ", &N);
int O,V,i;
for(i=1;i<=N;i++){
scanf("%d %d ", &O, &V );
if( O == 1 && M.find( V ) == M.end() ){ M[V]= ++NR; continue; }
if( O == 2 ){ M.erase(V); continue; }
if( O == 3 ) printf("%d\n", M.find( V ) != M.end() );
}
return 0;
}