Cod sursa(job #1088826)
| Utilizator | Data | 20 ianuarie 2014 21:04:35 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,op,x;
set <int> A;
int main()
{
f >> n;
for(int i=1; i<=n; i++)
{
f >> op >> x;
if(op == 1)
{
A.insert(x);
continue;
}
else if(op == 2)
{
A.erase(x);
continue;
}
else if(op == 3)
g << (A.find(x) != A.end()) << '\n';
}
g.close();
return 0;
}
