AcWing 671. DDD
原题链接
简单
作者:
Overmind
,
2021-01-28 00:30:21
,
所有人可见
,
阅读 257
#include <iostream>
#include <cstring>
using namespace std;
class city{
public:
city(int n=0,string na="0"):num(n),name(na){}
friend ostream & operator << (ostream &,city &);
int num;
private:
string name;
};
ostream & operator <<(ostream & output,city &a){
output<<a.name;
return output;
}
int main(){
city a[8]={
city(61,"Brasilia"),
city(71,"Salvador"),
city(11,"Sao Paulo"),
city(21,"Rio de Janeiro"),
city(32,"Juiz de Fora"),
city(19,"Campinas"),
city(27,"Vitoria"),
city(31,"Belo Horizonte")
};
int x,index = -1;
cin>>x;
for(int i = 0;i<8;i++){
if(x == a[i].num) {
index = i;
break;
}
}
if(index == -1) cout<<"DDD nao cadastrado"<<endl;
else cout<<a[index]<<endl;
return 0;
}