AcWing 671. DDD
原题链接
简单
作者:
k._8
,
2024-01-24 15:00:16
,
所有人可见
,
阅读 61
字典算法
使用字典 $O(logn)$
#include <iostream>
#include <map>
using namespace std;
int main() {
map<int, string> ddds = {
{61, "Brasilia"},
{71, "Salvador"},
{11, "Sao Paulo"},
{21, "Rio de Janeiro"},
{32, "Juiz de Fora"},
{19, "Campinas"},
{27, "Vitoria"},
{31, "Belo Horizonte"}
};
int n;
cin >> n;
auto it = ddds.find(n);
if (it != ddds.end()) {
cout << it->second << endl;
} else {
cout << "DDD nao cadastrado" << endl;
}
return 0;
}