Cod sursa(job #2604683)
Utilizator | Data | 23 aprilie 2020 11:45:48 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
int main() {
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n, op, x;
set<int> m;
fin>>n;
while(n--){
fin>>op>>x;
if(op==1)
m.insert(x);
if(op==2)
m.erase(x);
if(op==3){
if(m.find(x)==m.end())
fout<<0;
else
fout<<1;
fout<<'\n';
}
}
return 0;
}