1035 Password

解题代码

#include<cstdio>
#include<cstring>
struct password {
	char name[11];
	char word[11];
	bool flag;
}p[1000];
int main()
{
	int num, cnt = 0;
	scanf("%d", &num);
	for (int i = 0; i < num; i++) {
		p[i].flag = false;
		scanf("%s%s", p[i].name, p[i].word);
		int len = strlen(p[i].word);
		for (int j = 0; j < len; j++) {
			switch (p[i].word[j])
			{
			case '1':p[i].word[j] = '@'; if (!(p[i].flag)) p[i].flag = true; break;
			case 'l':p[i].word[j] = 'L'; if (!(p[i].flag)) p[i].flag = true; break;
			case '0':p[i].word[j] = '%'; if (!(p[i].flag)) p[i].flag = true; break;
			case 'O':p[i].word[j] = 'o'; if (!(p[i].flag)) p[i].flag = true; break;
			default: break;
			}
		}
		if (p[i].flag) cnt++;
	}
	if (!cnt) {
		if (num == 1) printf("There is 1 account and no account is modified");
		else printf("There are %d accounts and no account is modified", num);
	}
	else {
		printf("%d\n", cnt);
		bool tag = true;
		for (int i = 0; i < num; i++) {
			if (p[i].flag) {
				if (tag) tag = false;
				else printf("\n");
				printf("%s %s", p[i].name, p[i].word);
			}
		}
	}
	return 0;
}

测试结果

问题整理

1.字符串处理。
2.printf中注意不同条件下输出内容的细节差异。