Pagini recente » Cod sursa (job #2318839) | Cod sursa (job #941971) | Cod sursa (job #2581438) | Cod sursa (job #3281578) | Cod sursa (job #1602441)
#include <iostream>
#include <fstream>
#include <vector>
#include <map>
#define mod 13831
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> v[mod];
int n;
map <int,int> m;
int main()
{ int i,t,x;
f>>n;
for(i=1;i<=n;i++)
{ f>>t>>x;
if (t==1) { if (m.find(x)==m.end()) m[x]=1; }
if (t==2) m.erase(x);
if (t==3) { if (m.find(x)!=m.end()) g<<"1\n"; else g<<"0\n"; }
}
return 0;
}