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
题意:就是将密码根据上面四种情况进行判断,如果有上面四种情况就改,并按读入数据的顺序打印出修改的密码。
解题思路:直接用vector存储name+" "+password的字符串。每次读入数据,就进行判断,如果有修改就将name+" "+password的字符串存入vector中,这样就保证了读入数据的顺序,然后再根据题目要求打印出相应的答案。
#include<bits/stdc++.h>
using namespace std;
int main(void)
{
int n,t;
scanf("%d",&n);
t=n;
vector<string>v;
while(t--)
{
string name,pw;
cin>>name>>pw;
int len=pw.length();
bool flag=false;
for(int i=0;i<len;i++)
{
switch(pw[i])
{
case '1': pw[i]='@',flag=true;break;
case '0': pw[i]='%',flag=true;break;
case 'l': pw[i]='L',flag=true;break;
case 'O': pw[i]='o',flag=true;break;
}
}
if(flag)
{
string a=name+" "+pw;
v.push_back(a);
}
}
int ans=v.size();
if(ans==0)
{
if(n==1) printf("There is 1 account and no account is modified");
else printf("There are %d accounts and no account is modified",n);
}
else
{
cout<<ans<<endl;
for(int i=0;i<ans;i++)
cout<<v[i]<<endl;
}
}