Pagini recente » Cod sursa (job #722605) | Cod sursa (job #1395594) | Cod sursa (job #2400509) | Cod sursa (job #717501) | Cod sursa (job #1509116)
using namespace std;
#include <fstream>
#include <map>
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int x, q, n, c;
map <int, int> harta;
int main(){
f>>n;
for (int i=1;i<=n;++i){
f>>q>>x;
if (q == 1 && harta.find(x)==harta.end()) harta[x]= ++c;
if (q == 2) harta.erase(x);
if (q == 3) if (harta.find(x) != harta.end()) g<<1<<'\n';
else g<<0<<'\n';
}
g.close();
return 0;
}