1035 Password

1035 Password

题目大意

替换字母，将输入的字符串中指定字母替换，并输出已经修改的字母

算法思想

• 小坑当输入的n为1时，但是不需要修改，则输出there is，n大于1时，输出there are

代码

#include<iostream>
#include<vector>
using namespace std;
struct account {
	string id, passwords;
};
bool mod(string &s) {//判断是否修改
	bool flag = false;
	for (int i = 0; i < s.size(); i++) {
		if (s[i] == '1' || s[i] == '0' || s[i] == 'l' || s[i] == 'O') {
			flag = true;
			if (s[i] == '1')
				s[i] = '@';
			else if (s[i] == '0')
				s[i] = '%';
			else if (s[i] == 'l')
				s[i] = 'L';
			else if (s[i] == 'O')
				s[i] = 'o';
		}
	}
	return flag;
}
int main() {
	int n;
	cin >> n;
	vector<account>in;
	account d;
	for (int i = 0; i < n; i++) {
		cin >> d.id >> d.passwords;
		if (mod(d.passwords))//输入直接判断是否需要修改
			in.push_back(d);//Push修改的元素
	}
	if (in.size() == 0) {//判断修改的有多少位
		if (n == 1)
			cout << "There is " << n << " account and no account is modified";
		else
			cout << "There are " << n << " accounts and no account is modified";
	}
	else {
		cout << in.size() << endl;
		for (int i = 0; i < in.size(); i++) {
			cout << in[i].id << " " << in[i].passwords << endl;
		}
	}
	return 0;
}