Pagini recente » Borderou de evaluare (job #2780639) | Borderou de evaluare (job #1788599) | Borderou de evaluare (job #1038724) | Cod sursa (job #623339) | Cod sursa (job #735073)
Cod sursa(job #735073)
#include <cstdio>
#include <map>
using namespace std;
map<int,int>M;
int m,n;
int main(){
int c,x;
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&m);
for(int i=1;i<=m;i++){
scanf("%d %d",&c,&x);
switch(c){
case 1: M[x]=++n; break;
case 2: M.erase(x); break;
case 3: printf("%d\n",M.find(x)!=M.end()); }
}
}