Cod sursa(job #1097676)
Utilizator | Andrei Mazareanu mazaandrei | Data | 3 februarie 2014 19:56:15 |
---|---|---|---|
Problema | Hashuri | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include<fstream>
#include<map>
using namespace std;
map <int,bool> m;
int n,t,x;
ifstream in("hashuri.in"); ofstream out("hashuri.out");
int main(){
in>>n;
for(int i=1;i<=n;++i){
in>>t>>x; //Versiunea 1: maaaaaap!
switch(t){
case 1:{m[x]=1; break;};
case 2:{m[x]=0; break;};
case 3:{out<<m[x]<<'\n';break;};
};
}
out.close();
return 0;
}