Pagini recente » Cod sursa (job #393627) | Cod sursa (job #1079318) | Cod sursa (job #1821290) | Cod sursa (job #40607) | Cod sursa (job #1923311)
#include <fstream>
#include <map>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
#define mod 666003
map <int, int> H;
map <int, int> :: iterator it;
int main()
{
int n, i, v, x;
f >> n;
for(i = 1; i <= n; i++){
f >> v;
switch(v){
case 1:
f >> x;
H[x] = 1;
break;
case 2:
f >> x;
it = H.find(x);
if(it != H.end())
H.erase(it);
break;
case 3:
f >> x;
it = H.find(x);
if(it != H.end())
g << 1;
else
g << 0;
g << '\n';
break;
}
}
return 0;
}