Cod sursa(job #1783271)
Utilizator | Data | 18 octombrie 2016 21:54:20 | |
---|---|---|---|
Problema | Hashuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <unordered_set>
using namespace std;
fstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_set<int> us;
int main()
{
int i, type, x, n;
fin>>n;
for(i = 1; i <= n; ++i){
fin>>type>>x;
if(type == 1){
us.insert(x);
}
else if(type == 2){
us.erase(x);
}
else{
fout<<us.count(x)<<'\n';
}
}
return 0;
}