Cod sursa(job #1060932)
| Utilizator | Data | 18 decembrie 2013 21:54:32 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
#include <set>
using namespace std;
ifstream cin("hashuri.in") ;
ofstream cout("hashuri.out") ;
set <int> A ;
int N ;
int main()
{
int op , X ;
cin >> N ;
for(int i = 1; i <= N; ++ i)
{
cin >> op >> X ;
if(op == 1)
{
A.insert(X) ;
continue ;
}
if(op == 2)
{
A.erase(X) ;
continue ;
}
if(op == 3)
{
if(A.find(X) ==true)
cout << 1;
else cout << 0 ;
}
}
cin.close() ;
cout.close() ;
return 0;
}
