Cod sursa(job #1827824)
| Utilizator |  Mihai Ueban misu97 |
Data | 12 decembrie 2016 13:42:49 |
|---|---|---|---|
| Problema | Hashuri | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.31 kb |
#include <unordered_set>
#include <fstream>
using namespace std;
ifstream cin("hashuri.in"); ofstream cout("hashuri.out");
int n; unordered_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;}
