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
思路:遍历输入的所有账号和密码,找出不符合要求的密码并修改,将修改后密码对应的账号存入一个string类型的数组中,并用map关联账号对应的密码,这样当输出账号时也可输出对应的密码。
AC代码
#include <iostream>
#include <string>
#include <map>
#include <vector>
using namespace std;
int main()
{
string s,ss;
int n,cnt=0;
bool flag;
cin>>n;
vector<string>a;
map<string,string>m;
int temp=n;
while(temp--)
{
cin>>s>>ss;
flag=false;
int j=0;
while(j<ss.size())
{
if(ss[j]=='1'||ss[j]=='0'||ss[j]=='l'||ss[j]=='O')
{
flag=true;
if(ss[j]=='1')
ss[j]='@';
else if(ss[j]=='0')
ss[j]='%';
else if(ss[j]=='l')
ss[j]='L';
else ss[j]='o';
}
j++;
}
if(flag)
{
a.push_back(s);
m[s]=ss;
cnt++;
}
}
if(cnt==0&&n==1)
cout<<"There is 1 account and no account is modified";
else if(cnt==0&&n!=1)
printf("There are %d accounts and no account is modified",n);
else
{
cout<<cnt<<endl;
for(int i=0;i<cnt;i++)
cout<<a[i]<<" "<<m[a[i]]<<endl;
}
return 0;
}