Cod sursa(job #282944)
| Utilizator | Data | 18 martie 2009 16:06:14 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.37 kb |
#include<fstream>
#include<map>
using namespace std;
map<int, int>m;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n,op,x,k,i;
int main()
{ fin>>n;
for(i=1;i<=n;i++)
{ fin>>op>>x;
if(op==1&&m.find(x)==m.end()) m[x]=++k;
if(op==2) m.erase(x);
if(op==3)
if(m.find(x)!=m.end()) fout<<"1\n";
else fout<<"0\n";
}
return 0;
}