1035 Password

原创 2015年11月19日 20:14:30

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
#include<iostream>
#include<vector>
#include<string>
using namespace std;
struct user{
	string name,pwd;
};
int main(){
	for(int n;cin>>n;){
		vector<user>vec(n);
		vector<user>res;
		for(int i = 0;i < n;i++){
			cin>>vec[i].name>>vec[i].pwd;
		}
		for(int i = 0;i < n;i++){
			int flag = 0;
			for(int j =0; j < vec[i].pwd.length();j++){
				switch ((vec[i].pwd)[j])
				{
				case '1':
					(vec[i].pwd)[j] = '@';
					flag = 1;
					break;
				case '0':
					(vec[i].pwd)[j] = '%';
					flag = 1;
					break;
				case 'l':
					(vec[i].pwd)[j] = 'L';
					flag = 1;
					break;
				case 'O':
					(vec[i].pwd)[j] = 'o';
					flag = 1;
					break;
				default:
					break;
				}
			}
			if(flag){
				res.push_back(vec[i]);
			}
		}
		if(res.size()){
			cout<<res.size()<<endl;
			for(int i = 0; i < res.size();i++){
				cout<<res[i].name<<" "<<res[i].pwd<<endl;
			}
		}else{
			if(n == 1){
				cout<<"There is 1 account and no account is modified"<<endl;
			}else{
				cout<<"There are "<<n<<" accounts and no account is modified"<<endl;
			}
		}
	}
	return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

1035. Password

To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem ...

1035 Password

To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem ...

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

1035. Password (20)【字符串处理】——PAT (Advanced Level) Practise

题目信息1035. Password (20)时间限制400 ms 内存限制65536 kB 代码长度限制16000 BTo prepare for PAT, the judge sometime...

1035. Password (20)

时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作...

PAT 1035. Password (20)

1035. Password (20) 时间限制 400 ms 内存限制 65536 kB 代码长度限制 16000 B ...

1035. Password (20)

题目链接:http://www.patest.cn/contests/pat-a-practise/1035 题目: 1035. Password (20) 时间限制 400 ms ...

1035. Password (20)

考察对应字符转化以及信息记录 #include #include #include typedef struct user { char name[20]; char password[20]...

1035. Password (20)

题目: To prepare for PAT, the judge sometimes has to generate random passwords for the users. The pr...

PAT--1035. Password

To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem ...

1035. Password (20)

To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem ...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)