PAT甲级真题 1035 Password (20分) C++实现

题目

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

思路

用结构体数组保存用户信息，包含用户名、密码、是否被修改过三项；

读入密码时，遍历字符串修改相应字符，若修改过，则做上标记；

顺序遍历结构体数组，遇到标记修改过密码的，将其输出；没修改过的，按要求输出信息即可。

代码

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

struct User{
    string name;
    string pw;
    bool modified;
};
int main(){
    int n;
    cin >> n;
    vector<User> u(n);
    int count = 0;
    for (int i=0; i<n; i++){
        cin >> u[i].name >> u[i].pw;
        bool modified = false;
        for (int j=0; j<u[i].pw.size(); j++){
            if (u[i].pw[j]=='1'){
                u[i].pw[j] = '@';
                modified = true;
            }
            else if (u[i].pw[j]=='0'){
                u[i].pw[j] = '%';
                modified = true;
            }
            else if (u[i].pw[j]=='l'){
                u[i].pw[j] = 'L';
                modified = true;
            }
            else if (u[i].pw[j]=='O'){
                u[i].pw[j] = 'o';
                modified = true;
            }
        }
        if (modified){
            u[i].modified = true;
            count++;
        }
    }
    if (count==0){
        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;
        }
    }
    else{
        cout << count << endl;
        for (int i=0; i<n; i++){
            if (u[i].modified){
                cout << u[i].name << " " << u[i].pw << endl;
            }
        }
    }
    return 0;
}