Cod sursa(job #1051618)
| Utilizator | Data | 10 decembrie 2013 12:38:16 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<fstream>
#include<unordered_map>
using namespace std;
ifstream f ("elmaj.in");
ofstream g("elmaj.out");
unordered_map <int,int> map;
int n,i,x,t;
int main ()
{
f >> n;
for (i = 1; i <= n; i++)
{
f >> t >> x;
if (t == 1 && map[x] == 0)
map[x] = 1;
if (t == 2 && map[x] == 1)
map[x] = 0;
if (t == 3 && map[x] == 1)
g << 1 << "\n";
else g << 0 << "\n";
}
f.close();
g.close();
return 0;
}
