Cod sursa(job #759469)
| Utilizator | Data | 18 iunie 2012 11:55:17 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <cstdio>
#include <algorithm>
#include <set>
using namespace std;
set<int>s;
int main(){
int m,c,x;
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&m);
while(m--)
{
scanf("%d %d",&c,&x);
switch(c)
{
case 1: s.insert(x); break;
case 2: s.erase(x); break;
case 3: printf("%d\n",s.find(x)!=s.end()); break;
}
}
return 0;
}
