PAT甲级 1035
题目 Password
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.
解析
输入用户名,密码。如果密码里含有1、0、l、O,必须要用@、%、L、o替代。
如果有需要更改的用户输出用户名、修改过后密码。如果没有且N为1输出There is 1 account and no account is modified,大于1则输出There are N accounts and no account is modified。
代码
#include<bits/stdc++.h>
#define INF 1<<29
using namespace std;
struct user {
string name;
string pass;
};
vector<user> users;
void pat1035() {
int n;
cin >> n;
for (int i = 0; i < n; ++i) {
string name, pass;
cin >> name >> pass;
bool flag = false;
for (int j = 0; j < pass.size(); ++j) {
if (pass[j] == '1') {
pass[j] = '@';
flag = true;
} else if (pass[j] == '0') {
pass[j] = '%';
flag = true;
} else if (pass[j] == 'l') {
pass[j] = 'L';
flag = true;
} else if (pass[j] == 'O') {
pass[j] = 'o';
flag = true;
}
}
if (flag) {
user u = {
name, pass
};
users.push_back(u);
}
}
if (users.size() == 0) {
if(n!=1) {
printf("There are %d accounts and no account is modified", n);
}else{
printf("There is 1 account and no account is modified");
}
} else {
cout << users.size() << endl;
for (int i = 0; i < users.size(); ++i) {
cout << users[i].name << " " << users[i].pass << endl;
}
}
}
int main() {
pat1035();
return 0;
}