shunfurh 于 2017.09.08 22:53 提问

To prepare for programming contests or coding examinations, 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
There are multiple test cases. 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. A test case with N = 0 denotes the end of input. This test case is not to be processed.

Output
For each 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 "No account is modified."

Sample Input:
2
Team000001 R1spOdfa
Team000002 Rlsp0dfa
1
team110 abcdefg332
0
Sample Output:
2
Team000001 R@spodfa
Team000002 RLsp%dfa
No account is modified.

1个回答

caozhy      2017.09.24 08:32

//题目比较简单，就按题目的要求，如果密码有得修改的就修改，如果没有就输出！ #include "iostream" #include "string" #include "map" #include "vector" using namespace std; struct Info { string name; string password; }; int main() { int