Cod sursa(job #743893)
Utilizator | Data | 6 mai 2012 18:37:55 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
#include <map>
using namespace std;
int N,n,i,op,x;
map<int,int> Map;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int main()
{
f>>N;
while(N--) {
f>>op>>x;
switch(op) {
case 1:
if(Map.find(x) == Map.end()) {
Map[x] = ++n;
}
break;
case 2:
Map.erase(x);
break;
case 3:
if(Map.find(x) != Map.end()) {
g<<1;
} else g<<0;
g<<'\n';
break;
}
}
}