栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 面试经验 > 面试问答

poj 3749 破译密码

面试问答 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

poj 3749 破译密码

#include <iostream>#include <string>#include <map>#include <cctype>using namespace std;map<char, char> m;int main(){    int i, len;    string str, ans;    ans.clear();    m['A'] = 'V', m['B'] = 'W', m['C'] = 'X', m['D'] = 'Y', m['E'] = 'Z',    m['F'] = 'A', m['G'] = 'B', m['H'] = 'C', m['I'] = 'D', m['J'] = 'E',    m['K'] = 'F', m['L'] = 'G', m['M'] = 'H', m['N'] = 'I', m['O'] = 'J',    m['P'] = 'K', m['Q'] = 'L', m['R'] = 'M', m['S'] = 'N', m['T'] = 'O',    m['U'] = 'P', m['V'] = 'Q', m['W'] = 'R', m['X'] = 'S', m['Y'] = 'T', m['Z'] = 'U';    while (getline(cin, str)){          if (str == "ENDOFINPUT")  break;          else if (str == "START")  continue;          else if (str == "END"){     cout << ans << endl;     ans.clear();          }          else{    len = str.length();    for (i = 0; i < len; i++){        if (isalpha(str[i])) ans.push_back(m[str[i]]);        else  ans += str[i];    }          }    }}
转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/378101.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号