1035. Password

#include <stdio.h>

int main()
{
	int n,i,j,flag,modified=0,m[2000];
	char Password[2000][11];
	scanf("%d",&n);
	for (i = 0; i < 2 * n; i++) {
		scanf("%s", Password[i]);
		m[i] = 0;
	}
	for (i = 1; i < 2 * n; i += 2) {
		flag = 0;
		for (j = 0; Password[i][j] != '\0'; j++)
			switch (Password[i][j]) {
			case '1':
				Password[i][j] = '@'; flag = 1; break;
			case '0':
				Password[i][j] = '%'; flag = 1; break;
			case 'l':
				Password[i][j] = 'L'; flag = 1; break;
			case 'O':
				Password[i][j] = 'o'; flag = 1; break;
			}
		if (flag) {
			modified++;
			m[i] = 1;
		}
	}
	if (modified) {
		printf("%d\n", modified);
		for (i = 1; i < 2 * n; i += 2) 
			if(m[i]){
				printf("%s ",Password[i-1]);
				printf("%s\n", Password[i]);
			}
	}
	else if (n == 1)
		printf("There is 1 account and no account is modified");
	else printf("There are %d accounts and no account is modified",n);
	return 0;
}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值