pat 1035 Password（20 分）

1035 Password（20 分）

To prepare for PAT, 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 replace1 (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 Specification:

Each input file contains one test case. 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.

Output Specification:

For each test 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 There are N accounts and no account is modified where N is the total number of accounts. However, if N is one, you must print There is 1 account and no account is modified instead.

Sample Input 1:

3
Team000002 Rlsp0dfa
Team000003 perfectpwd
Team000001 R1spOdfa

Sample Output 1:

2
Team000002 RLsp%dfa
Team000001 R@spodfa

Sample Input 2:

1
team110 abcdefg332

Sample Output 2:

There is 1 account and no account is modified

Sample Input 3:

2
team110 abcdefg222
team220 abcdefg333

Sample Output 3:

There are 2 accounts and no account is modified

 #include <iostream>
 #include <algorithm>
 #include <cstdio>
 #include <cstring>
 #include <map>
 #include <stack>
 #include <vector>
 #include <queue>
 #include <set>
 #define LL long long
 using namespace std;
 const int MAX = , MAXN = 1e3 + ;

 struct node
 {
     char s1[MAX], s2[MAX];
 }P[MAXN];
 char buf1[MAX], buf2[MAX];
 int n, cnt = ;
 map <char, char> mp;

 bool is_ans()
 {
     bool flag = false;
     int len = strlen(buf2);
     for (int i = ; i < len; ++ i)
     {
         if (mp.find(buf2[i]) != mp.end())
         {
             buf2[i] = mp[buf2[i]];
             flag = true;
         }
     }
     if (flag) return true;
     return false;
 }

 int main()
 {
 //    freopen("Date1.txt", "r", stdin);
     mp['l'] = 'L', mp['O'] = 'o', mp[''] = '@', mp[''] = '%';
     scanf("%d", &n);
     for (int i = ; i <= n; ++ i)
     {
         scanf("%s %s", &buf1, &buf2);
         if (is_ans())
         {
             strcpy(P[cnt].s1, buf1);
             strcpy(P[cnt ++].s2, buf2);
         }
     }
     if (cnt != )
     {
         printf("%d\n", cnt);
         for (int i = ; i < cnt; ++ i)
             printf("%s %s\n", P[i].s1, P[i].s2);
         return ;
     }
     if (n == )
         printf("There is 1 account and no account is modified\n");
     else
         printf("There are %d accounts and no account is modified\n", n);
     return ;
 }