1035. Password (20)

最新推荐文章于 2020-06-08 22:43:29 发布

ZhangVeni

最新推荐文章于 2020-06-08 22:43:29 发布

阅读量452

点赞数 1

分类专栏： PAT-A

本文链接：https://blog.csdn.net/ZhangVeni/article/details/56279406

版权

PAT-A 专栏收录该内容

23 篇文章 0 订阅

订阅专栏

#include<cstdio>
#include<cstring>
struct Info{
    char name[11];
    char psw[11];
    bool isChanged;
}node[1001];
int main()
{
    int n,m=0,tem;
    scanf("%d",&n);
    tem = n;
    while (n--)
    {
        scanf("%s%s", node[n].name, node[n].psw);
        for (int i = 0; i < strlen(node[n].psw); i++)
        {
            if (node[n].psw[i] == '1' || node[n].psw[i] == '0' || node[n].psw[i] == 'l' || node[n].psw[i] == 'O')
            {
                if (node[n].psw[i] == '1')
                    node[n].psw[i] = '@';
                else
                if (node[n].psw[i] == '0')
                    node[n].psw[i] = '%';
                else
                if (node[n].psw[i] == 'l')
                    node[n].psw[i] = 'L';
                else
                if (node[n].psw[i] == 'O')
                    node[n].psw[i] = 'o';
                node[n].isChanged = true;
            }
        }
    }
    for (int i = 0; i < tem;i++)
    if (node[i].isChanged)
        m++;
    if (m == 0)
    {
        if (tem>1)
            printf("There are %d accounts and no account is modified", tem);
        else
            printf("There is 1 account and no account is modified");
    }
    else
        printf("%d\n", m);
    for (int i = tem; i >= 0; i--)
    {
        if (node[i].isChanged)
        {
            printf("%s %s", node[i].name, node[i].psw);
                printf("\n");
        }
    }
    return 0;
}