PATA1035题解

最新推荐文章于 2021-01-06 12:27:04 发布

Phoenix_wei

最新推荐文章于 2021-01-06 12:27:04 发布

阅读量199

点赞数

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

本文链接：https://blog.csdn.net/phoenix_wei/article/details/79305638

版权

PAT 专栏收录该内容

131 篇文章 2 订阅

订阅专栏

//
//  main.cpp
//  PATA1035
//
//  Created by Phoenix on 2018/2/10.
//  Copyright © 2018年 Phoenix. All rights reserved.
//

#include <iostream>
#include <cstdio>
#include <cstring>

int main(int argc, const char * argv[]) {
    int n, k = 0;
    scanf("%d", &n);
    char id[n][15], pass[n][15];
    for(int i = 0; i < n; i++) {
        char name[15], password[15];
        scanf("%s %s", name, password);
        int flag = true;
        for(int j = 0; j < strlen(password); j++) {
            if(password[j] == '1'){
                password[j] = '@';
                flag = false;
            }
            if(password[j] == 'l') {
                password[j] = 'L';
                flag = false;
            }
            if(password[j] == '0') {
                password[j] = '%';
                flag = false;
            }
            if(password[j] == 'O') {
                password[j] = 'o';
                flag = false;
            }
        }
        if(flag == false) {
            strcpy(id[k], name);
            strcpy(pass[k], password);
            k++;
        }
    }
    if(k == 0){
        if(n == 1) {
            printf("There is 1 account and no account is modified\n");
        } else if(n > 1) {
            printf("There are %d accounts and no account is modified\n", n);
        }
    } else {
        printf("%d\n", k);
        for(int i = 0; i < k; i++) {
            printf("%s %s\n", id[i], pass[i]);
        }
    }
    return 0;
}