Cod sursa(job #1067184)
Utilizator | Data | 26 decembrie 2013 15:06:40 | |
---|---|---|---|
Problema | Hashuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <cstdio>
#include <set>
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
int main()
{
set<int> a;
int x,op,n;
cin>>n;
for(int i=n-1; i>=0; i--)
{
cin>>op>>x;
if(op==1)
{
a.insert(x);
continue;
}
if(op==2)
{
a.erase(x);
continue;
}
printf("%d\n", a.find(x) != a.end());
}
return 0;
}