solutions/PAT/A1035.cpp at master · Ki-Seki/solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include <iostream>
#include <cstring>
#define MAXN 1005
using namespace std;

struct {
    char name[12], pwd[12];
    bool isOK;
} ans[MAXN];

int main()
{
    int n, m = 0, pos[MAXN];
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        scanf("%s %s", ans[i].name, ans[i].pwd);
        ans[i].isOK = true;
        int len = strlen(ans[i].pwd);
        for (int j = 0; j < len; j++)
        {
            if (ans[i].pwd[j] == '0')
            {
                ans[i].pwd[j] = '%';
                ans[i].isOK = false;
            }
            else if (ans[i].pwd[j] == '1')
            {
                ans[i].pwd[j] = '@';
                ans[i].isOK = false;
            }
            else if (ans[i].pwd[j] == 'l')
            {
                ans[i].pwd[j] = 'L';
                ans[i].isOK = false;
            }
            else if (ans[i].pwd[j] == 'O')
            {
                ans[i].pwd[j] = 'o';
                ans[i].isOK = false;
            }
        }
        if (!ans[i].isOK) pos[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; i < m; i++)
        {
            printf("%s %s\n", ans[pos[i]].name, ans[pos[i]].pwd);
        }
    }

    return 0;
}