Pagini recente » Cod sursa (job #1032385) | Borderou de evaluare (job #1994001) | Diferente pentru problema/magic intre reviziile 20 si 19 | Borderou de evaluare (job #1033687) | Cod sursa (job #2445348)
#include <bits/stdc++.h>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
map <int,int> v;
int n,nr;
int main(){
int i, type, x;
f >> n;
while(n--){
f >> type >> x;
if(type == 1){
if(v.find(x) == v.end())
v[x] = ++nr;
}else
if(type == 2)
v.erase(x);
else
g << (v.find(x) != v.end()) << "\n";
}
return 0;
}