PAT-A1035. Password (20)(模拟)

22 篇文章 0 订阅


#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
using namespace std;

#define MAX 1000+10
struct Info
{
    char username[15];
    char password[15];
    int change;
} info[MAX];

int main()
{
    //freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    int N = 0, cnt = 0;
    cin >> N;
    for (int i = 0; i < N; i++)
    {
        cin >> info[i].username >> info[i].password;
        info[i].change = 0;
    }

    for (int i = 0; i < N; i++)
    {
        int f = 0;
        for (int j = 0; j < strlen(info[i].password); j++)
        {
            if (info[i].password[j] == '1')
            {
                info[i].password[j] = '@';
                f = 1;
            }
            else if (info[i].password[j] == '0')
            {
                info[i].password[j] = '%';
                f = 1;
            }
            else if (info[i].password[j] == 'l')
            {
                info[i].password[j] = 'L';
                f = 1;
            }
            else if (info[i].password[j] == 'O')
            {
                info[i].password[j] = 'o';
                f = 1;
            }
        }
        if (1 == f)
        {
            info[i].change =1;
            cnt++;
        }
    }

    if (0 == cnt && 1 == N)
        cout << "There is 1 account and no account is modified";
    else if (0 == cnt)
        cout << "There are " << N << " accounts and no account is modified";
    else
    {
        cout << cnt << endl;
        for (int i = 0; i < N; i++)
        {
            if (info[i].change == 1)
                cout << info[i].username << " " << info[i].password << endl;
        }
    }

    return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值