Cod sursa(job #1997773)
Utilizator | Data | 5 iulie 2017 12:11:33 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.27 kb |
#include <bits/stdc++.h>
using namespace std;ifstream f("hashuri.in");ofstream g("hashuri.out");int n;unordered_set<int>A;int main(){int x,op;for(f>>n;n;--n){f>>op>>x;if(op==1){A.insert(x);continue;}if(op==2){A.erase(x);continue;}g<<(A.find(x)!=A.end())<<'\n';}return 0;}