Cod sursa(job #734883)
Utilizator | Data | 15 aprilie 2012 09:22:27 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include<fstream>
#include <tr1/unordered_set>
using namespace std::tr1;
using namespace std;
unordered_set<int> hs;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
int n,tip,x;
int main()
{ in>>n;
for(int i=1;i<=n;i++)
{
in>>tip>>x;
switch(tip)
{
case 1:{
hs.insert(x);
break;
}
case 2:{
hs.erase(x);
break;
}
case 3:{
out<<hs.count(x)<<"\n";
break;
}
}
}
}