Cod sursa(job #2468665)
| Utilizator | Data | 5 octombrie 2019 19:12:15 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#include <map>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
map <int,int> m;
int nr;
int main()
{
int n,x,y;
in>>n;
for(int i=1;i<=n;i++){
in>>x>>y;
switch(x){
case 1:
if(m.find(y)==m.end())
m[y]=++nr;
break;
case 2:
m.erase(y);
break;
case 3:
out<<(m.find(y)!=m.end())<<"\n";
break;
}
}
return 0;
}
