PAT 1035 水题

最新推荐文章于 2022-08-18 16:15:10 发布

yws_2973199368

最新推荐文章于 2022-08-18 16:15:10 发布

阅读量118

点赞数

分类专栏：算法刷题

本文链接：https://blog.csdn.net/qq_43513855/article/details/117034189

版权

算法刷题专栏收录该内容

132 篇文章 0 订阅

订阅专栏

PAT 1035 水题

水

代码：

#include <iostream>
#include <map>
#include <string>
#include <vector>
using namespace std;

int N;
map<string,string> m;
vector<string> v;
int main(){
    cin>>N;
    for(int i = 0;i < N;i++){
        string name;
        cin>>name;
        string password;
        getchar();
        char c;
        bool flg = false;
        while((c = getchar())!='\n'){
            if(c == '0') {c = '%'; flg = true;}
            if(c == '1') {c = '@'; flg = true;}
            if(c == 'l') {c = 'L'; flg = true;}
            if(c == 'O') {c = 'o'; flg = true;}
            password.append(string(1,c));
        }
        if(flg) {m[name] = password;v.push_back(name);}
    }
    if(m.size() != 0){
        cout<<m.size()<<endl;
        for(auto ite : v){
            cout<<ite<<" "<<m[ite]<<endl;
        }
    }else{
        if(N == 1){
            cout<<"There is 1 account and no account is modified"<<endl;
        }else{
            cout<<"There are "<<N<<" accounts and no account is modified"<<endl;
        }
    }
}