Cod sursa(job #1042849)
Utilizator | Data | 27 noiembrie 2013 18:58:40 | |
---|---|---|---|
Problema | Hashuri | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
#include <unordered_set>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int main()
{
unordered_set <int> a;
int t, x, y;
fin>>t;
while(t--)
{
fin>>y>>x;
if(y==1) a.insert(x);
else if(y==2) a.erase(x);
else fout<<(a.find(x)!=a.end())<<"\n";
}
}