Cod sursa(job #735073)
| Utilizator | Data | 15 aprilie 2012 17:27:37 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#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()); }
}
}
