Pagini recente » Cod sursa (job #1564729) | Monitorul de evaluare | Cod sursa (job #2798879) | Cod sursa (job #1271873) | Cod sursa (job #3131143)
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
void adaug(unordered_map <int, int> &hash, int nr){
hash[nr] = 1;
}
void sterg(unordered_map <int, int> &hash, int nr){
hash.erase(nr);
}
int main()
{
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int nr, a, b;
unordered_map<int, int> hash;
fin>>nr;
for(int i = 0; i < nr; i++){
fin>>a>>b;
switch(a){
case 1:
if(hash.count(b) == 0)
adaug(hash, b);
break;
case 2:
if(hash.count(b) == 1)
sterg(hash, b);
break;
case 3:
fout<<hash.count(b)<<"\n";
break;
}
}
fin.close();
fout.close();
return 0;
}