Cod sursa(job #1097674)
Utilizator | Andrei Mazareanu mazaandrei | Data | 3 februarie 2014 19:50:45 |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
#include<set>
using namespace std;
set <int> s;
int n,t,x;
ifstream in("hashuri.in"); ofstream out("hashuri.out");
int main(){
in>>n;
for(int i=1;i<=n;++i){
in>>t>>x; //Versiunea 1: set!
switch(t){
case 1:{s.insert(x);break;};
case 2:{s.erase(x); break;};
case 3:{out<<s.count(x)<<'\n';break;};
};
}
out.close();
return 0;
}