1035 Password (20分)

 

#include<cstdio>
#include<vector>
#include<string>
#include<iostream>
#include<queue>
#include<set>
#include<algorithm>
#define maxn 22
using namespace std;
struct node {
    string ac, pa;
};
vector<node> v;

bool check_change(node &a) {
    bool check = false;
    for (int i = 0; i < a.pa.size(); i++) {
        if (a.pa[i] == '1') {
            a.pa[i] = '@';
            check = true;
        }
        else if (a.pa[i] == 'l') {
            a.pa[i] = 'L';
            check = true;
        }
        else if (a.pa[i] == '0') {
            a.pa[i] = '%';
            check = true;
        }
        else if (a.pa[i] == 'O') {
            a.pa[i] = 'o';
            check = true;
        }
    }
    return check;
}

int main() {
    int N;
    node a;
    scanf("%d", &N);
    for (int i = 0; i < N; i++) {
        cin >> a.ac >> a.pa;
        if (check_change(a)) v.push_back(a);
    }
    if (v.size() == 0) {
        if (N == 0) printf("0\n");
        else 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 {
        printf("%d\n", v.size());
        for (int i = 0; i < v.size(); i++) {
            cout << v[i].ac << " " << v[i].pa << endl;
        }
    }
    return 0;
}