PAT-1035 Password

PAT-1035 Password (20分)

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

题意：

为了准备 PAT，系统不得不为用户生成随机密码。但是有时一些数字和字母之间总是难以区分，比如 1（数字一）和 l（L 的小写），0（数字零）和 O（o 的大写）。一种解决办法是将 1（数字一）替换为 @，将 0（数字零）替换为 %，将 l（L 的小写）替换为 L，将 O（o 的大写）替换为 o。现在，你的任务就是帮助系统检查这些用户的密码，并对难以区分的部分加以修改。

解题思路：

读入一个数据，判断一个数据，判断这个密码是不是需要修改，如果需要的话，将这个修改后的密码以及用户名记录下来，并且记录有多少个同学的密码改了。

程序代码：

#include<iostream>
using namespace std;

const int N = 1010;
string name[N], pwd[N];

string change(string pwd)
{
    string res;
    for(auto x:pwd)
    {
        if (x == '1') res += '@';
        else if (x == 'l') res += 'L';
        else if (x == '0') res += '%';
        else if (x == 'O') res += 'o';
        else res += x;
    }
    return res;
}

int main()
{
    int n;
    cin>>n;
    int m = 0;
    for (int i=0;i<n;i++)
    {
        string p_name, p_pwd;
        cin>>p_name>>p_pwd;
        //判断是否修改密码
        string change_pwd = change(p_pwd);
        if (change_pwd != p_pwd)//如果密码被修改了
        {
            name[m] = p_name;
            pwd[m] = change_pwd;
            m++;
        }
    }
    if (!m)//如果密码没被修改过
    {
        if (n == 1) printf("There is 1 account and no account is modified\n");
        else printf("There are %d accounts and no account is modified\n",n);
    }
    else //密码被修改过，输出名字及密码
    {
        cout<<m<<endl;
        for (int i=0;i<m;i++)
            cout<<name[i]<<' '<<pwd[i]<<endl;
    }
    return 0;
}