B1035 Password(水题)

B1035 Password (20分)

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string.h>
#include <cmath>
#include <math.h>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <stack>
using namespace std;
const int MAX=1001;
const int INF=0x3f3f3f3f;
map<string,string>nametopass,nametonew;
vector<string>vt;
int main()
{
    int n,tol=0;
    string s1,s2,s3;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
        cin>>s1>>s2;
        s3=s2;
        vt.push_back(s1);
        nametopass[s1]=s2;
        for(int i=0;i<s2.size();i++)
        {
            if(s2[i]=='1')
                s2[i]='@';
            else if(s2[i]=='0')
                s2[i]='%';
            else if(s2[i]=='l')
                s2[i]='L';
            else if(s2[i]=='O')
                s2[i]='o';
        }
        nametonew[s1]=s2;
        if(s2!=s3)
            tol++;
    }
    if(tol!=0)
    {
        cout<<tol<<endl;
    for(int i=0;i<vt.size();i++)
    {
        if(nametonew[vt[i]]==nametopass[vt[i]])
            continue;
        else
            cout<<vt[i]<<" "<<nametonew[vt[i]]<<endl;
    }
    }
    else
    {
        if(n==1)
            printf("There is 1 account and no account is modified");
        else
            printf("There are %d accounts and no account is modified",n);

    }

    return 0;
}