Cod sursa(job #403521)
| Utilizator | Data | 25 februarie 2010 01:16:09 | |
|---|---|---|---|
| Problema | Hashuri | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cstdio>
#include <tr1/unordered_map>
using namespace std;
int main()
{
tr1::unordered_map<int, int> H;
int n, p, q;
freopen ("hashuri.in", "r", stdin);
freopen ("hashuri.out", "w", stdout);
scanf ("%d\n", &n);
while (n--)
{
scanf ("%d %d\n", &p, &q);
if (p == 1)
H[q] = 1;
if (p == 2)
H[q] = 0;
if (p == 3)
printf ("%d\n", H[q]);
}
return 0;
}
