Cod sursa(job #1216024)
| Utilizator | Data | 3 august 2014 00:38:53 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.5 kb |
#include<fstream>
#include<set>
#define LL long long
using namespace std;
ifstream cin("hashuri.in");
ofstream cout("hashuri.out");
LL N,X;
set<LL> T;
int op;
int main() {
LL i;
cin>>N;
for(i=1;i<=N;i++) {
cin>>op>>X;
switch(op) {
case 1 : T.insert(X); break;
case 2 : T.erase(X); break;
case 3 : if (T.find(X)!=T.end()) cout<<1<<"\n";
else cout<<0<<"\n";
break;
}
}
return 0;
}
