
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>
using namespace std;
struct {
string user;
string password;
}login[1005];
int main() {
int N, M=0;
cin >> N;
int temp = N;
while (N--) {
string user, password;
bool flag = false;
cin >> user >> password;
for (int i = 0; i < password.length(); i++) {
if (password[i] == '1') {
password[i] = '@';
flag = true;
}
else if (password[i] == '0') {
password[i] = '%';
flag = true;
}
else if (password[i] == 'l') {
password[i] = 'L';
flag = true;
}
else if (password[i] == 'O') {
password[i] = 'o';
flag = true;
}
}
if (flag == true) {
login[M].user = user;
login[M].password = password;
M++;
}
}
if (M == 0&&temp!=1) cout << "There are " << temp << " accounts and no account is modified";
else if(M==0&&temp==1) cout << "There is " << 1 << " account and no account is modified";
else cout << M << endl;
for (int j = 0; j < M; j++) cout << login[j].user << " " << login[j].password << endl;
return 0;
}
本文介绍了一个用于检查并修改易混淆密码的程序实现。该程序针对PAT竞赛中可能产生的难以区分的密码(如1与l、0与O)进行替换,以提高密码的可读性和准确性。文章提供了一个完整的C++代码示例,展示了如何读取输入数据、检查密码并进行必要的字符替换。
461

被折叠的 条评论
为什么被折叠?



