PAT 1035. Password (20)

最新推荐文章于 2022-05-13 13:39:10 发布

Genius_J

最新推荐文章于 2022-05-13 13:39:10 发布

阅读量282

点赞数

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

本文链接：https://blog.csdn.net/Genius_J/article/details/49963831

版权

PAT 专栏收录该内容

110 篇文章 0 订阅

订阅专栏

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
#define maxsize 10001
#define  MIN -10001
struct  login{
char acount[11];
char password[11];
int change;
}str[1001];
int main()
{
    int n;
   scanf("%d",&n);
   for(int i=0;i<n;i++)
   scanf("%s%s",str[i].acount,str[i].password);
     for(int i=0;i<n;i++)
     {
         str[i].change=0;
        for(int j=0;j<strlen(str[i].password);j++)
        switch(str[i].password[j])
        {
        case '1':
            str[i].password[j]='@';
            str[i].change=1;
        break;
        case '0':   str[i].password[j]='%';
               str[i].change=1;
        break;
        case 'l':   str[i].password[j]='L';
                 str[i].change=1;
        break;
        case 'O':   str[i].password[j]='o';
                str[i].change=1;
        break;
        }
     }
        int m=0;
        for(int i=0;i<n;i++)
         if(str[i].change==1)
            m++;
        if(n==1&&m==0)
            printf("There is 1 account and no account is modified\n");
        else if(m==0)
            printf("There are %d accounts and no account is modified\n",n);
        else
        {
            printf("%d\n",m);
        for(int i=0;i<n;i++)
        if(str[i].change)
            printf("%s %s\n",str[i].acount,str[i].password);
        }
    return 0;
}