Cod sursa(job #1164843)
Utilizator | Data | 2 aprilie 2014 12:34:37 | |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unordered_map <int, bool> H;
int main()
{
int n, a, b;
fin>>n;
while(n--)
{
fin>>a>>b;
if(a==1)
H[b]=1;
if(a==2)
H[b]=0;
if(a==3)
fout<<H[b]<<"\n";
}
}