【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.For each test case, print in one line the average waiting time of all the customers, in minutes and accurate up to 1 decimal place.
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
思路
题目要求
其实就是把里面一些特别的字符改成相应的其他字符。
题目分析
- 需要注意的是用例2和用例3有单复数的区别;
参考代码如下
#include <iostream>
using namespace std;
struct change{
string name;
string password;
}user[1001];
int main() {
int n;
scanf("%d",&n);
int num=0;
for(int i=0;i<n;i++){
string a,b;
cin>>a>>b;
int flag=0;
for(int j=0;j<b.length();j++){
if(b[j]=='1'){
b[j]='@';flag=1;
}
else if(b[j]=='0'){
b[j]='%';flag=1;
}
else if(b[j]=='l'){
b[j]='L';flag=1;
}
else if(b[j]=='O'){
b[j]='o';flag=1;
}
}
if(flag){
user[num].name=a;
user[num].password=b;
num++;
}
}
if(num)
printf("%d\n",num);
for(int i=0;i<num-1;i++){
cout<<user[i].name<<" "<<user[i].password<<endl;
}
if(num)
cout<<user[num-1].name<<" "<<user[num-1].password;
else if(n==1)
cout<<"There is "<<n<<" account and no account is modified";
else
cout<<"There are "<<n<<" accounts and no account is modified";
}
附
- 网上的参考代码很多;
- 以上仅是用来记录我个人的想法和答题方式;
- 仅为入门选手,如有错误或者更好的方法欢迎指正与探讨;