zoukankan      html  css  js  c++  java
  • 1035 Password (20 分)

    1035 Password (20 分)

    To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem is that there are always some confusing passwords since it is hard to distinguish 1 (one) from l (L in lowercase), or 0 (zero) from O (o in uppercase). One solution is to replace 1 (one) by @, 0 (zero) by %, l by L, and O by o. Now it is your job to write a program to check the accounts generated by the judge, and to help the juge modify the confusing passwords.

    Input Specification:

    Each input file contains one test case. Each case contains a positive integer N (1000), followed by N lines of accounts. Each account consists of a user name and a password, both are strings of no more than 10 characters with no space.

    Output Specification:

    For each test case, first print the number M of accounts that have been modified, then print in the following M lines the modified accounts info, that is, the user names and the corresponding modified passwords. The accounts must be printed in the same order as they are read in. If no account is modified, print in one line There are N accounts and no account is modified where N is the total number of accounts. However, if N is one, you must print There is 1 account and no account is modified instead.

    Sample Input 1:

    3
    Team000002 Rlsp0dfa
    Team000003 perfectpwd
    Team000001 R1spOdfa
    

    Sample Output 1:

    2
    Team000002 RLsp%dfa
    Team000001 R@spodfa
    

    Sample Input 2:

    1
    team110 abcdefg332
    

    Sample Output 2:

    There is 1 account and no account is modified
    

    Sample Input 3:

    2
    team110 abcdefg222
    team220 abcdefg333
    

    Sample Output 3:

    There are 2 accounts and no account is modified

    #include<iostream>
    #include<vector>
    #include<algorithm>
    #include<queue>
    #include<string>
    #include<map>
    #include<set>
    #include<stack>
    #include<string.h>
    #include<cstdio>
    #include<cmath>
    using namespace std;
    bool flag=false;
    
    struct Node
    {
        char account[11];
        char password[11];
    };
    
    
    
    void modify(Node &node)
    {
        int len=strlen(node.password);
        for(int i=0;i<len;i++)
        {
            char temp=node.password[i];
            if(temp=='1')
            {
                node.password[i]='@';
                flag=true;
            }
            else if(temp=='0')
            {
                node.password[i]='%';
                flag=true;
            }
            else if(temp=='l')
            {
                node.password[i]='L';
                flag=true;
            }
            else if(temp=='O')
            {
                node.password[i]='o';
                flag=true;
            }
        }
    }
    
    
    
    
    
    int main()
    {
        int n;
        queue<int>qu;
        scanf("%d",&n);
        Node node[n];
        for(int i=0;i<n;i++)
        {
            flag=false;
            scanf("%s %s",node[i].account,node[i].password);
            modify(node[i]);
            if(flag)
                qu.push(i);
            //cout<<node[i].account<<" "<<node[i].password<<endl;
        }
        if(!qu.empty())
        {
            printf("%d
    ",qu.size());
            while(!qu.empty())
            {
                int temp=qu.front();
                qu.pop();
                printf("%s %s
    ",node[temp].account,node[temp].password);
            }
        }
        else
        {
            if(n==1)
                printf("There is 1 account and no account is modified
    ");
            else
                printf("There are %d accounts and no account is modified
    ",n);
        }
        return 0;
    }
  • 相关阅读:
    github中建立pages
    批处理指令_windows定时关机脚本
    批处理指令_同步数据脚本
    python_笔记
    python_操作outlook
    按键精灵_一些踩过的坑
    linux_一些踩过的坑
    python_快速排序
    python_jira库的一些常用操作
    jira_一些踩过的坑
  • 原文地址:https://www.cnblogs.com/zhanghaijie/p/10327194.html
Copyright © 2011-2022 走看看