Cod sursa(job #735584)
Utilizator | Data | 16 aprilie 2012 20:17:59 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
set <int> Treap;
int main()
{
int n,tip,x;
fin>>n;
for(;n;--n)
{
fin>>tip >>x;
if(tip==1)
Treap.insert(x);
else
if(tip==2)
Treap.erase(x);
else
if(tip==3)
fout<< (Treap.find(x)!=Treap.end())<<'\n';
}
return 0;
}