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.
翻译:大概意思就是说密码中的某些字符很难区分,所以遇到这些特定的字符要用一些可区分的字符替代;
这题用vector处理就行了,唯一需要注意的就是当n为1时没有需要修改的密码时 there后面要跟单数(有点坑!)
#include<iostream>
#include<algorithm>
#include<cstring>
#include<vector>
using namespace std;
struct node{
string name;
string password;
};
vector<node>v;
int main(){
node s;
int n;
cin>>n;
int flag;
for(int i=0;i<n;i++){
flag=1;
cin>>s.name>>s.password;
string ss=s.password;
for(int j=0;j<s.password.size();j++){
if(s.password[j]=='1'){
ss[j]='@';
flag=0;
}
else if(s.password[j]=='0'){
ss[j]='%';
flag=0;
}
else if(s.password[j]=='O'){
ss[j]='o';
flag=0;
}
else if(s.password[j]=='l'){
ss[j]='L';
flag=0;
}
}
s.password=ss;
if(flag==0)
v.push_back(s);
}
if(v.size()==0){
if(n!=1)
cout<<"There are "<<n<<" accounts and no account is modified"<<endl;
else{
cout<<"There is "<<n<<" account and no account is modified"<<endl;
}
}
else{
cout<<v.size()<<endl;
for(int i=0;i<v.size();i++){
cout<<v[i].name<<" "<<v[i].password<<endl;
}
}
system("pause");
return 0;
}
本文介绍了一种处理容易混淆的密码字符的方法,通过将1替换为@,0替换为%,l替换为L,O替换为o,以提高密码的可读性和区分度。文章提供了一个C++实现的例子,展示了如何读取账户名和密码,检查并修改那些包含容易混淆字符的密码。
486

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



