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 [email protected]

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", n);
45         else
46             printf("There are %d accounts and no account is modified\n", n);
47     }
48     else
49     {
50         printf("%d\n", count);
51         for(i = 0; i < n; i++)
52         {
53             if(flag[i])
54             {
55                 printf("%s %s\n", acu[i], pwd[i]);
56             }
57         }
58     }
59     return 0;
60 }
时间: 2024-10-09 17:45:56

1035. Password的相关文章

PAT 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) fro

pat 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) fro

1035 Password (20)

1 #include <stdio.h> 2 #include <string.h> 3 struct MyStruct 4 { 5 char ID[11]; 6 char Password[11]; 7 bool changed; 8 }; 9 int main() 10 { 11 int n,i,j; 12 MyStruct User[1001]; 13 while(scanf("%d",&n)!=EOF) 14 { 15 for(i=0;i<

PAT 甲级 1035 Password

https://pintia.cn/problem-sets/994805342720868352/problems/994805454989803520 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 di

PAT甲级——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)

PAT Advanced 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)

PAT甲题题解-1035. Password (20)-水

题意:给n个用户名和密码,把密码中的1改为@,0改为%,l改为L,O改为o. 让你输出需要修改密码的用户名个数,以及对应的用户名和密码,按输入的顺序.如果没有用户需要修改,则输出对应的语句,注意单复数... 没啥好说的,就for一遍密码,把需要改的改下,存入到ans中去. #include <iostream> #include <cstdio> #include <algorithm> #include <string.h> #include <cm

PAT:1035. Password (20) AC

#include<stdio.h> #include<string.h> typedef struct STU { char mID[15]; char mpass[15]; bool tag; }STU; STU arr[1010]; int main() { memset(arr,0,sizeof(arr)); int n,change=0; scanf("%d",&n); for(int i=0 ; i<n ; ++i) { scanf(&q

1035 Password (20 分)(字符串)

注意下单复数 #include<bits/stdc++.h> using namespace std; pair<string,string>pa; int main() { int n; scanf("%d",&n); vector<pair<string,string> >vec; for(int i=0;i<n;i++){ char a[20],b[20]; scanf("%s %s",a,b);