zoukankan      html  css  js  c++  java
  • 1035. Password

    1035. Password (20)

    时间限制
    400 ms
    内存限制
    65536 kB
    代码长度限制
    16000 B
    判题程序
    Standard
    作者
    CHEN, Yue

    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
     1 #include<stdio.h>
     2 #include<math.h>
     3 #include<stdlib.h>
     4 #include<string.h>
     5 
     6 int main()
     7 {
     8     int n, i, j, count = 0, flag[1010] = {};
     9     char acu[1010][15], pwd[1010][15];
    10     scanf("%d", &n);
    11     for(i = 0; i < n; i++)
    12     {
    13         scanf("%s %s", acu[i], pwd[i]);
    14         int len = strlen(pwd[i]);
    15         for(j = 0; j < len; j++)
    16         {
    17             if(pwd[i][j] == '1')
    18             {
    19                 flag[i] = 1;
    20                 pwd[i][j] = '@';
    21             }
    22             else if(pwd[i][j] == '0')
    23             {
    24                 flag[i] = 1;
    25                 pwd[i][j] = '%';
    26             }
    27             else if(pwd[i][j] == 'l')
    28             {
    29                 flag[i] = 1;
    30                 pwd[i][j] = 'L';
    31             }
    32             else if(pwd[i][j] == 'O')
    33             {
    34                 flag[i] = 1;
    35                 pwd[i][j] = 'o';
    36             }
    37         }
    38         if(flag[i])
    39             count++;
    40     }
    41     if(count == 0)
    42     {
    43         if(n == 1)
    44             printf("There is %d account and no account is modified
    ", n);
    45         else
    46             printf("There are %d accounts and no account is modified
    ", n);
    47     }
    48     else
    49     {
    50         printf("%d
    ", count);
    51         for(i = 0; i < n; i++)
    52         {
    53             if(flag[i])
    54             {
    55                 printf("%s %s
    ", acu[i], pwd[i]);
    56             }
    57         }
    58     }
    59     return 0;
    60 }
  • 相关阅读:
    [语言基础] 我只想导入目标包中的一个模块,没想到目标包的其他非模块代码也被执行了。。
    [vscode] os.getcwd(),调试和命令行运行的结果不一致
    234. 回文链表
    不生成新数组的迭代器方法:forEach()&every()&some()&reduce()&reduceRight()
    合并数组并对数组排序
    为数组排序:sort()&reverse()
    从数组中间位置添加元素:unshift()方法的有一种运用
    从数组中删除元素:pop()&unshift()方法
    为数组添加元素:push()&unshift()方法
    由已有数组创建新数组:concat()&splice()方法
  • 原文地址:https://www.cnblogs.com/yomman/p/4275417.html
Copyright © 2011-2022 走看看