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 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 |
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
题目大意
给你 N 个人的账号根密码,要对该每个人的密码进行以下操作
数字 1 -> @ 数字 0 -> % 小写的 l -> L 大写的 O -> o
如果该人有一个密码中有一个字符为 '1' '0' 'l' 'O',就嘚帮其换了,并记入替换的列表
结果根据是否存在需要替换的密码分别输出即可
思路
见代码
C/C++
#include<bits/stdc++.h>
using namespace std;
string OP(string password);
int main()
{
string id,password;
int N;
vector<pair<string,string>> result;
cin >> N;
for(int z=0;z<N;z++){
cin >> id >> password;
password = OP(password);
if(!password.empty()) result.emplace_back(id,password);
}
if(password.empty()){
if(N==1) puts("There is 1 account and no account is modified");
else printf("There are %d accounts and no account is modified",N);
}else{
cout << result.size() << endl;
for(const auto& x:result) cout << x.first << ' ' << x.second << endl;
}
return 0;
}
string OP(string password)
{
bool flag = true;
for(char& x:password){
if(x=='1') x='@',flag = false;
if(x=='0') x='%',flag = false;
if(x=='l') x='L',flag = false;
if(x=='O') x='o',flag = false;
}
if(flag) return "";
return password;
}