PAT (Advanced Level) Practise 1035 Password (20)

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:

3Team000002 Rlsp0dfaTeam000003 perfectpwdTeam000001 R1spOdfa

Sample Output 1:

2Team000002 RLsp%dfaTeam000001 R@spodfa

Sample Input 2:

1team110 abcdefg332

Sample Output 2:

There is 1 account and no account is modified

Sample Input 3:

2team110 abcdefg222team220 abcdefg333

Sample Output 3:

There are 2 accounts and no account is modified

统计有多少个密码需要替换，没有输出总数，注意复数和单数的英文不一样

#include<cstdio>#include<cstring>#include<string>#include<queue>#include<stack>#include<cmath>#include<algorithm>#include<functional>using namespace std;typedef long long LL;const int maxn = 1e3 + 10;int n, m, flag[maxn];char s[maxn][20], p[maxn][20];bool change(char &c){if (c == '1') { c = '@'; return true; }if (c == 'l') { c = 'L'; return true; }if (c == '0') { c = '%'; return true; }if (c == 'O') { c = 'o'; return true; }return false;}int main(){scanf("%d", &n);for (int i = 0; i < n; i++){scanf("%s%s", s[i], p[i]);for (int j = 0; p[i][j]; j++){if (change(p[i][j])) flag[i] = 1;}m += flag[i];}if (m){printf("%d\n", m);for (int i = 0; i < n; i++) if (flag[i]) printf("%s %s\n", s[i], p[i]);}else printf("There %s %d account%s and no account is modified\n", n>1 ? "are" : "is",n, n>1 ? "s" : "");return 0;}