Cod sursa(job #1923311)
| Utilizator | Data | 10 martie 2017 22:19:32 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.76 kb |
#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;
}
