PAT(甲） 1035 Password (20 分)

最新推荐文章于 2020-03-29 18:07:23 发布

原创最新推荐文章于 2020-03-29 18:07:23 发布 · 101 阅读

0 ·

CC 4.0 BY-SA版权

PAT甲级专栏收录该内容

7 篇文章

订阅专栏

为准备PAT，需处理易混淆的随机密码。输入包含账户数量和账户信息，输出修改后的账户数量及信息。使用结构体vector存储考生信息，内设flag标志位，采用在线处理，边输入边处理，给出了相应的C++代码实现。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem is that there are always some confusing passwords since it is hard to distinguish 1 (one) from l (L in lowercase), or 0 (zero) from O (o in uppercase). One solution is to replace 1 (one) by @, 0 (zero) by %, l by L, and O by o. Now it is your job to write a program to check the accounts generated by the judge, and to help the juge modify the confusing passwords.

Input Specification:

Each input file contains one test case. Each case contains a positive integer N (≤1000), followed by N lines of accounts. Each account consists of a user name and a password, both are strings of no more than 10 characters with no space.

Output Specification:

For each test case, first print the number M of accounts that have been modified, then print in the following M lines the modified accounts info, that is, the user names and the corresponding modified passwords. The accounts must be printed in the same order as they are read in. If no account is modified, print in one line There are N accounts and no account is modified where N is the total number of accounts. However, if N is one, you must print There is 1 account and no account is modified instead.

Sample Input 1:

3
Team000002 Rlsp0dfa
Team000003 perfectpwd
Team000001 R1spOdfa

Sample Output 1:

2
Team000002 RLsp%dfa
Team000001 R@spodfa

Sample Input 2:

1
team110 abcdefg332

Sample Output 2:

There is 1 account and no account is modified

Sample Input 3:

2
team110 abcdefg222
team220 abcdefg333

Sample Output 3:

There are 2 accounts and no account is modified

使用结构体vector存储考生信息，内设flag标志位表示是否经过modify，从而判断进行何种输出操作。采用在线处理，边输入边进行相应处理。

#include<iostream>

#include<string>

#include<vector>

using namespace std;

struct node{

    string name, password;

    bool flag;

};

int main(){

    int n, cnt = 0;

    cin >> n;

    string s1, s2;

    node temp;

    vector<node> v;

    for(int i = 0; i < n; i++){

        cin >> s1 >> s2;

        bool tflag = false;

        for(int j = 0; j < s2.length(); j++){

            if(s2[j] == '1'){

                s2[j] = '@';

                tflag = true;

            } else if(s2[j] == '0'){

                s2[j] = '%';

                tflag = true;

            } else if(s2[j] == 'l'){

                s2[j] = 'L';

                tflag = true;

            } else if(s2[j] == 'O'){

                s2[j] = 'o';

                tflag = true;

            }

        }

        if(tflag == true)

            cnt++;

        temp = {s1, s2, tflag};

        v.push_back(temp);

    }

    if(cnt != 0){

        cout << cnt << endl;

        for(int i = 0; i < n; i++){

            if(v[i].flag == true){

                cout << v[i].name << " " << v[i].password << endl;

            }

        }

    }

    else if(cnt == 0){

        if(n == 1)

            cout << "There is 1 account and no account is modified" << endl;

        else if(n != 1){

            cout << "There are " << n << " accounts and no account is modified" << endl;

        }

    }

    return 0;

}