Cod sursa(job #1518784)
Utilizator | Data | 6 noiembrie 2015 14:13:28 | |
---|---|---|---|
Problema | Hashuri | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <iostream>
#include<fstream>
#include<map>
using namespace std;
unorder_map<int,bool>ap;
int main()
{
long N,i;
int x,op;
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;
else if(op==2)ap[x]=0;
else if(op==3)g<<ap[x]<<endl;
}
}