【PAT】A1035. Password (20)

lilydedbb

于 2017-01-16 23:58:30 发布

阅读量320

点赞数 1

CC 4.0 BY-SA版权

分类专栏： PAT Advance

本文链接：https://blog.youkuaiyun.com/lilydedbb/article/details/54578816

PAT Advance 专栏收录该内容

25 篇文章

订阅专栏

本文介绍了一个简单的密码加密程序，该程序使用C语言实现，并通过特定规则替换密码中的字符以增加安全性。文章展示了如何读取用户的账号和原始密码，并对密码进行加密处理。如果密码被修改，则会显示修改后的密码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

A1035. Password (20)

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

struct team{
    char name[20], pwd[20];
    int ischange;
}teams[1000];

void pwdcrypt(struct team *t, int *counter){
    int len = (int)strlen(t->pwd);
    for(int i = 0; i < len; i++){
        switch (t->pwd[i]) {
            case '1':
                t->pwd[i] = '@';
                t->ischange = 1;
                break;
            case '0':
                t->pwd[i] = '%';
                t->ischange = 1;
                break;
            case 'l':
                t->pwd[i] = 'L';
                t->ischange = 1;
                break;
            case 'O':
                t->pwd[i] = 'o';
                t->ischange = 1;
                break;
            default:
                break;
        }
    }
    if(t->ischange == 1)
        *counter += 1;
}

int main(int argc, const char * argv[]) {

    int N;
    scanf("%d", &N);
    for(int i = 0; i < N; i++){
        scanf("%s %s", teams[i].name, teams[i].pwd);
        teams[i].ischange = 0;
    }

    int counter = 0;
    for(int i = 0; i < N; i++){
        pwdcrypt(&teams[i], &counter);
    }

    if(counter == 0){
        if(N == 1)
            printf("There is %d account and no account is modified", N);
        else
            printf("There are %d accounts and no account is modified", N);
    } else {
        printf("%d\n", counter);
        for(int i = 0; i < N; i++){
            if(teams[i].ischange == 1)
                printf("%s %s\n", teams[i].name, teams[i].pwd);
        }
    }

    return 0;
}