1035. Password (20)

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

原创最新推荐文章于 2024-05-21 17:00:05 发布 · 302 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#pat a级题目

pat a 专栏收录该内容

25 篇文章

订阅专栏

本文介绍了一个程序设计案例，用于检查并修正容易混淆的用户密码，如将1替换为@、0替换为%等，以提高密码的独特性和可读性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目：

原题目

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

注意：1个是 is count 多个是 are counts，代码如下

#include<iostream>
#include<stdio.h>
#include<string.h>
#include<string>
using namespace std;
struct sno{
	char name[100];
	char pass[100];
	int flag;
};

int main()
{
	sno ll[1004];
	int n;
	int count = 0;
	while (scanf("%d", &n) != EOF){
		for (int i = 0; i < n; i++)
		{
			scanf("%s%s", ll[i].name, ll[i].pass);
			ll[i].flag = 1;
			int s = strlen(ll[i].pass);
			for (int j = 0; j < s; j++)
			{
				if (ll[i].pass[j] == '0')
				{
					ll[i].pass[j] = '%';
					ll[i].flag = 0;
				}
				if (ll[i].pass[j] == '1')
				{
					ll[i].pass[j] = '@';
					ll[i].flag = 0;
				}
				if (ll[i].pass[j] == 'l')
				{
					ll[i].pass[j] = 'L';
					ll[i].flag = 0;
				}
				if (ll[i].pass[j] == 'O')
				{
					ll[i].pass[j] = 'o';
					ll[i].flag = 0;
				}
			}
			if (ll[i].flag == 0)
			{
				count++;
			}
		}

		int s = 0;
		for (int i = 0; i < n; i++)
		{
			if (ll[i].flag == 0)
			{
				if (s == 0)printf("%d\n", count);
				printf("%s %s\n", ll[i].name, ll[i].pass);
				s = 1;
			}
		}
		if (s == 0)
		{
			if (n <= 1)printf("There is %d account and no account is modified\n",n);
			else printf("There are %d accounts and no account is modified\n", n);
		}
	}
	system("pause");
	return 0;
}