Cod sursa(job #1827754)
Utilizator | Data | 12 decembrie 2016 11:43:13 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <set>
#include <fstream>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
int n;
set<int>A;
int main(){
int x,op;
for(cin>>(n);n;--n){
cin>>op>>x;
if(op==1){
A.insert(x);
continue;
}
if(op==2){
A.erase(x);
continue;
}
cout<<'\n'<<(A.find(x)!=A.end());
}
return 0;
}