Cod sursa(job #1822923)
Utilizator | Data | 5 decembrie 2016 19:14:02 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
set<int> s;
int n, c, x;
int main()
{
f>>n;
for(;n;n--)
{
f>>c>>x;
if(c==1)
s.insert(x);
else
if(c==2)
s.erase(x);
else
g<<(s.find(x)!=s.end())<<'\n';
}
return 0;
}