1035 Password (20 分)

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

题目大意：
给定一组用户的用户名和密码，要求将密码中的异常字符进行修改

算法分析：
用结构体数组存储用户信息，用map存储异常字符到正常字符的转换信息。输入时，遍历密码，找到异常字符并进行修改，并压入vector中

AC代码：

#include<bits/stdc++.h>
using namespace std;
map<char,char> mm={{'1','@'},{'0','%'},{'l','L'},{'O','o'}};//存储对应转换信息 
struct node{
	string username,password;
};
int main()
{
	int num;
	cin>>num;
	node s[num];
	vector<node> v;
	for(int i=0;i<num;i++){
		cin>>s[i].username>>s[i].password;
		int flag=0;
		for(int j=0;j<s[i].password.size();j++){
			if(mm.find(s[i].password[j])!=mm.end()){//password中发现异常字符时进行调整 
				s[i].password[j]=mm[s[i].password[j]];
				flag=1;
			}
		}
		if(flag==1)
		v.push_back(s[i]);
	}
	if(v.size()==0&&num==1)
	printf("There is 1 account and no account is modified");
	else if(v.size()==0)
	printf("There are %d accounts and no account is modified",num);
	else{
		printf("%d\n",v.size());
		for(int i=0;i<v.size();i++)
		cout<<v[i].username<<" "<<v[i].password<<"\n";
	}
}