PAT甲级——Password

最新推荐文章于 2024-05-21 17:00:05 发布

Xiao2018428

最新推荐文章于 2024-05-21 17:00:05 发布

阅读量143

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/Xiao2018428/article/details/103345100

版权

PAT 专栏收录该内容

115 篇文章 0 订阅

订阅专栏

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

思路：

比较简单的字符替换问题，没有太多的难度，最后输出的时候要根据n的不同注意“account”的单复数问题。

代码：

#include <iostream>
#include<cstring>
using namespace std;

struct  node
{
	char name[20];
	char password[20];
	bool ischange;
}T[1005];

void crypt(node&t, int& cnt)
{
	int len = strlen(t.password);
	for (int i = 0; i < len; i++)
	{
		if (t.password[i] == '1')
		{
			t.password[i] = '@';
			t.ischange = true;
		}
		else if (t.password[i] == '0')
		{
			t.password[i] = '%';
			t.ischange = true;
		}
		else if (t.password[i] == '1')
		{
			t.password[i] = 'L';
			t.ischange = true;
		}
		else if (t.password[i] == 'O')
		{
			t.password[i] = 'o';
			t.ischange = true;
		}

	}
	if (t.ischange)
		cnt++;
}


	

int main()
{
	int n, cnt = 0;
	scanf_s("%d", &n);
	for(int i = 0; i < n; i++)
	{
		scanf_s("%s %s", T[i].name, T[i].password);
		T[i].ischange = false;
	}
	for (int i = 0; i < n; i++)
	{
		crypt(T[i], cnt);
	}
	if (cnt == 0) {
		if (n == 1)
		{
			printf_s("There is %d account and no account is modified", n);
		}
		else {
			printf_s("There are %d account and no account is modified", n);
		}
	}
	else {
		printf_s("%d\n", cnt);
		for (int i = 0; i < n; i++)
		{
			if (T[i].ischange == true)
			{
				printf_s("%s %s\n", T[i].name, T[i].password);
			}
		}
	}
	return 0;
}