Cod sursa(job #3208015)
Utilizator | Stefan stefanscd | Data | 27 februarie 2024 13:40:05 |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
#include <unordered_set>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_set <int> s;
int n,task,x;
int main() {
fin>>n;
while(n--){
fin>>task>>x;
if(task==1){
s.insert(x);
}
else if(task==2){
s.erase(x);
}
else if(task==3){
if(s.find(x)==s.end())
fout<<0<<'\n';
else
fout<<1<<'\n';
}
}
return 0;
}