PAT甲级1035

solution

#include <iostream>
using namespace std;
const int N = 1010;
string a[N], b[N];
int main()
{
    int n;
    scanf("%d\n", &n);
    string temp1, temp2;
    int count = 0;
    int idx = 1;
    for (int i = 1; i <= n; i++)
    {
        int flag = 0;
        cin >> temp1 >> temp2;
        for (int j = 0; temp2[j]; j++)
        {
            if (temp2[j] == '1' || temp2[j] == 'l' || temp2[j] == '0' || temp2[j] == 'O')
            {
                if (!flag)
                {
                    count++;
                }
                flag++;
                if (temp2[j] == '1')
                    temp2[j] = '@';
                else if (temp2[j] == '0')
                    temp2[j] = '%';
                else if (temp2[j] == 'l')
                    temp2[j] = 'L';
                else if (temp2[j] == 'O')
                    temp2[j] = 'o';
            }
        }
        if (flag)
        {
            a[idx] = temp1;
            b[idx++] = temp2;
        }
    }
    if (count == 0)
    {
        if (n == 1)
            printf("There is %d account and no account is modified", n);
        else
            printf("There are %d accounts and no account is modified", n);
        return 0;
    }
    cout << count << endl;
    for (int i = 1; i < idx; i++)
    {
        cout << a[i] << " " << b[i] << endl;
    }
}