（甲）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 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 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

 题意：

给你一个数字N，代表有N个测试数据，每一个测试数据都包含一个用户名和一个密码，但是在密码中经常把数字1和小写的L，数字0和大写的o弄混淆，所以想要你写一个代码，把给出的密码进行修改：数字0 用%代替，数字1用@代替，小写的l用大写的L代替，大写的O用小写的o代替。输出的时候，如果有修改的代码，就输出修改的密码的个数，后面一次输出修改过的密码的用户名和修改过后的密码。没有修改一个，就输出这N个密码没有要修改的。

思路：

用一个book数组记录修改过密码的编号，方便后面输出。当然了，要注意输出的格式，有修改的密码就输出修改的个数，再依次输出用户名和修改过后的密码。没有修改的密码的输出有两种情况：1.给出的数据只有一个，按照英语的语法输出：There is 1 account and no account is modified。2.数据个数不是一个，那么就要用复数形式输出：There are N accounts and no account is modified。否则，第二个测试点错误！！！！

代码如下：

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;

int n;
char a[1010][11],b[1010][11];
int book[1010];
int flag;
int kk;

int main()
{
    while(~scanf("%d",&n))
    {
        memset(book,0,sizeof book);//标记密码是否修改过；
        int sum=0;
        for(int i=0; i<n; i++)
        {
            scanf("%s %s",a[i],b[i]);
            int lb=strlen(b[i]);
            flag=0;
            for(int j=0; j<lb; j++)
            {
                if(b[i][j]=='1')
                {
                    flag=1;
                    b[i][j]='@';
                }
                else if(b[i][j]=='0')
                {
                    flag=1;
                    b[i][j]='%';
                }
                else if(b[i][j]=='l')
                {
                    flag=1;
                    b[i][j]='L';
                }
                else if(b[i][j]=='O')
                {
                    flag=1;
                    b[i][j]='o';
                }
            }
            if(flag==1)
            {
                sum++;
                book[i]=1;
            }
        }
        if(sum==0)//一定要注意输出的格式；
        {
            if(n<2)
                printf("There is %d account and no account is modified\n",n);
            else
                printf("There are %d accounts and no account is modified\n",n);
        }
        else
        {
            printf("%d\n",sum);
            for(int i=0; i<n; i++)
            {
                if(book[i]==1)
                    printf("%s %s\n",a[i],b[i]);
            }
        }
    }
    return 0;
}