Cod sursa(job #1509617)
Utilizator | Data | 24 octombrie 2015 09:29:21 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include<fstream>
#include<set>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,op,nr;
set<int>a;
int main()
{
f>>n;
while(n)
{
n--;
f>>op>>nr;
if(op==1)
a.insert(nr);
else if(op==2)
a.erase(nr);
else
{
if(a.find(nr)!=a.end())
g<<1<<"\n";
else
g<<0<<"\n";
}
}
return 0;
}