ZOJ-2514

最新推荐文章于 2019-06-23 21:05:26 发布

心之痕

最新推荐文章于 2019-06-23 21:05:26 发布

阅读量420

点赞数

分类专栏： ZOJ 文章标签： ZOJ

本文链接：https://blog.csdn.net/xhldtc/article/details/18149613

版权

ZOJ 专栏收录该内容

546 篇文章 3 订阅

订阅专栏

#include<stdio.h>
#include<string.h>

int main()
{
    int n;
    while (scanf("%d", &n), n)
    {
        char name[1000][11];
        char pwd[1000][11];
        int flag[1000];
        memset(flag, 0, 1000 * sizeof(int));
        int i, j, count = 0;
        for (i = 0; i < n; i++)
        {
            scanf("%s %s", name[i], pwd[i]);
            int process = 0;
            for (j = 0; pwd[i][j] != '\0'; j++)
            {
                if (pwd[i][j] == '1' || pwd[i][j] == 'l' || pwd[i][j] == 'O'
                        || pwd[i][j] == '0')
                {
                    flag[i] = 1;
                    if (!process)
                    {
                        count++;
                        process = 1;
                    }
                    if (pwd[i][j] == '1')
                        pwd[i][j] = '@';
                    if (pwd[i][j] == 'l')
                        pwd[i][j] = 'L';
                    if (pwd[i][j] == '0')
                        pwd[i][j] = '%';
                    if (pwd[i][j] == 'O')
                        pwd[i][j] = 'o';
                }
            }
        }
        if (count)
        {
            printf("%d\n", count);
            for (i = 0; i < n; i++)
                if (flag[i] == 1)
                    printf("%s %s\n", name[i], pwd[i]);
        }
        else
            printf("No account is modified.\n");
    }
    return 0;
}