1035 Password

Posted 2021-08-16 CSU迦叶

很适合用结构体数组的一道题

#include<cstdio>
#include<cmath>
#include<cstring>
#include<algorithm>
using namespace std;

struct info{
	char usr[11]="";
	char pwd[11]="";
	bool changed = false;
}infos[1010];

int main(){
	
	int n,lenPwd;
	int hasChanged = 0;
	
	scanf("%d",&n);
	
	for(int i=0;i<n;i++){
		scanf("%s %s",&infos[i].usr,&infos[i].pwd);
		lenPwd = strlen(infos[i].pwd);
		for(int j=0;j<lenPwd;j++){
			if(infos[i].pwd[j] == '1'){
				infos[i].pwd[j]='@';
				infos[i].changed = true;
			}
			if(infos[i].pwd[j] == '0'){
				infos[i].pwd[j]='%';
				infos[i].changed = true;
			}
			if(infos[i].pwd[j] == 'l'){
				infos[i].pwd[j]='L';
				infos[i].changed = true;
			}
			if(infos[i].pwd[j] == 'O'){
				infos[i].pwd[j]='o';
				infos[i].changed = true;
			}
		}
		if(infos[i].changed)hasChanged ++;
	}
	
	if(hasChanged){
		printf("%d\\n",hasChanged);
	}else{
		if(n == 1)printf("There is 1 account and no account is modified\\n");
		if(n != 1)printf("There are %d accounts and no account is modified",n);
	}
	
	for(int i=0;i<n;i++){
		if(infos[i].changed)printf("%s %s\\n",infos[i].usr,infos[i].pwd);
	
	}
	
	
	
	return 0;
}