Cod sursa(job #1518800)
Utilizator | Data | 6 noiembrie 2015 14:34:10 | |
---|---|---|---|
Problema | Hashuri | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
unordered_map<int,bool>ap;
int main()
{
int i,op,x,n;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
f>>n;
for(i=1; i<=n; i++)
{
f>>op>>x;
if(op==1)
ap[x]=1;
if (op==2)
ap[x]=0;
if(op==3)
g<<ap[x]<<endl;
}
return 0;
}