Pagini recente » Cod sursa (job #1592290) | Cod sursa (job #30985) | Cod sursa (job #891509) | Cod sursa (job #1581927) | Cod sursa (job #2577595)
#include <fstream>
#include <map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
map <int,int> M;
map <int,int> :: iterator it;
int N;
int main()
{
f>>N;
while(N){
int op,x;
f>>op>>x;
it=M.find(x);
if(op==1){
M.insert(pair <int,int>(x,1));
}else{
if(op==2){
if(it!=M.end()){
M.erase(it);
}
}else{
if(it==M.end()){
g<<0<<'\n';
}else{
g<<1<<'\n';
}
}
}
N--;
}
f.close();
g.close();
return 0;
}