1035 Password (20)（20 分）

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
using namespace std;
const int maxn = 1e3 + 10;
struct node {
    string name, p;
}temp;
vector<node>fix;
int main()
{
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++)
    {
        cin >> temp.name >> temp.p;
        bool f = false;
        for (int i = 0; i < temp.p.size(); i++)
        {
            if (temp.p[i] == '1')
            {
                temp.p[i] = '@';
                f = true;
            }
            else if (temp.p[i] == '0')
            {
                temp.p[i] = '%';
                f = true;
            }
            else if (temp.p[i] == 'l')
            {
                temp.p[i] = 'L';
                f = true;
            }
            else if (temp.p[i] == 'O')
            {
                temp.p[i] = 'o';
                f = true;
            }
        }
        if (f)fix.push_back(temp);
    }
    if (fix.size() == 0)
    {
        printf("There %s %d account%s and no account is modified", n > 1 ? "are" : "is", n, n > 1 ? "s" : "");
    }
    else
    {
        printf("%d\n", fix.size());
        for (int i = 0; i < fix.size(); i++)cout << fix[i].name << " " << fix[i].p << endl;
    }
    return 0;
}