【PAT】A1035 Password【字符串处理】【水】

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

题目大意

按题目要求进行替换，如果没有需要替换的行按题目要求输出文字提示，否则输出替换行数和对应替换后的行。

思路

由于一行只有两个字段，没有必要使用结构体。使用一个int型数组modified来存放修改过的行号（从0开始），使用M来存储修改的行数（也即是modified数组中有效数据的个数）。

代码

#include <iostream>
#include <algorithm>
#define maxN 1000
#define maxChar 11
using namespace std;
int main() {
    char user[maxN][maxChar], password[maxN][maxChar];
    char origin[] = {'1', '0', 'l', 'O'};
    char replacement[] = {'@', '%', 'L', 'o'};
    int modified[maxN];
    int N, M = 0;
    
    
    scanf("%d", &N);
    for(int i = 0; i < N; i++){
        scanf("%s %s", user[i], password[i]);
        bool flag = false;
        for(int j = 0; password[i][j] != '\0'; j++){
            for(int k = 0; k < 4; k++){
                if(password[i][j] == origin[k]){
                    password[i][j] = replacement[k];
                    flag = true;
                }
            }
        }
        if(flag) modified[M++] = i;
    }
    if(M == 0){
        if(N == 1){
            printf("There is 1 account and no account is modified");
        }else{
            printf("There are %d accounts and no account is modified", N);

        }
    }else{
        printf("%d\n", M);
    }
    for(int i = 0, t; i < M; i++){
        t = modified[i];
        printf("%s %s\n", user[t], password[t]);
    }
    return 0;
}