AcWing 671. DDD
原题链接
简单
作者:
zhEng_4
,
2023-01-11 17:05:17
,
所有人可见
,
阅读 110
利用数组
C++ 代码
#include<iostream>
#include<string>
using namespace std;
int main()
{
int ddd[] = {61,71,11,21,32,19,27,31};
string destination[] = {"Brasilia","Salvador","Sao Paulo","Rio de Janeiro","Juiz de Fora","Campinas","Vitoria","Belo Horizonte"};
int x;
cin >> x;
bool a = true;//设置标记
for(int i=0;i<8;i++)
{
if(x==ddd[i])
{
a = false;//若输入数字在表中,则将标记改为false
cout << destination[i] << endl;
break;
}
}
if(a) //若输入数字不在表中,则输出“DDD nao cadastrado”
cout << "DDD nao cadastrado" << endl;
return 0;
}