Cod sursa(job #2738949)
| Utilizator | Data | 6 aprilie 2021 16:36:44 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <iostream>
#include <fstream>
#include <set>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int main() {
int n, x, op;
set<int> s;
fin >> n;
for(int i=0; i<n; ++i)
{
fin >> op >> x;
if(op == 1)
s.insert(x);
else if(op == 2)
s.erase(x);
else
{
if(s.find(x)!=s.end())
fout << 1 << "\n";
else
fout << 0 << "\n";
}
}
return 0;
}
