栏目分类:
子分类:
返回
名师互学网用户登录
快速导航关闭
当前搜索
当前分类
子分类
实用工具
热门搜索
名师互学网 > IT > 软件开发 > 后端开发 > C/C++/C#

A1035 Password (20 分)PAT甲级 (Advanced Level) Practice(C++)满分题解【字符串相关】

C/C++/C# 更新时间: 发布时间: IT归档 最新发布 模块sitemap 名妆网 法律咨询 聚返吧 英语巴士网 伯小乐 网商动力

A1035 Password (20 分)PAT甲级 (Advanced Level) Practice(C++)满分题解【字符串相关】

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
#include
using namespace std;
vector modified_User;
int main()
{
	int n;
	cin>>n;
	for (int i = 0; i < n; i++)
	{
		string name, password;
		cin>>name>>password;
		//1 (one) by @, 0 (zero) by %, l by L, and O by o
		bool modified = false;
		for (int j = 0; j < password.length(); j++)
		{
			if (password[j] == '1') {
				password[j] = '@';
				modified = true;
			}
			else if (password[j] == '0') {
				password[j] = '%';
				modified = true;
			}
			else if (password[j] == 'l') {
				password[j] = 'L';
				modified = true;
			}
			else if (password[j] == 'O') {
				password[j] = 'o';
				modified = true;
			}
		}
		if (modified) {
			string record = name + " " + password;
			modified_User.push_back(record);
		}
	}
	int size = modified_User.size();
	if (size == 0) {
		if (n == 1)
			printf("There is 1 account and no account is modifiedn");
		else
			printf("There are %d accounts and no account is modifiedn", n);
	}
	else {
		printf("%dn", size);
		for (int i = 0; i < size; i++)
		{
			cout< 
运行结果如下: 

 

转载请注明:文章转载自 www.mshxw.com
本文地址:https://www.mshxw.com/it/833151.html
我们一直用心在做
关于我们 文章归档 网站地图 联系我们

版权所有 (c)2021-2022 MSHXW.COM

ICP备案号:晋ICP备2021003244-6号