Pagini recente » Cod sursa (job #672733) | Cod sursa (job #1321338) | Cod sursa (job #1807159) | Cod sursa (job #1649867) | Cod sursa (job #1146003)
#include <fstream>
#include <map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
map<long long,int> M;
int main()
{
int n,p,i;
long long k;
f>>n;
for(i=1;i<=n;i++)
{
f>>p>>k;
if(p==1 && M.find(k)==M.end()) M[k]=i;
else if(p==2) M.erase(k);
else if(M.find(k)->second) g<<"1\n";
else g<<"0\n";
}
f.close();
g.close();
return 0;
}