PAT (Advanced Level) 1035. Password (20)

简单题。

#include<iostream>
#include<cstring>
#include<cmath>
#include<algorithm>
#include<cstdio>
#include<map>
#include<queue>
#include<vector>
using namespace std;

int n;
struct X
{
    string a;
    string b;
    bool flag;
} s[1000+10];

int main()
{
    scanf("%d",&n);int fail=0;
    for(int i=1; i<=n; i++)
    {
        cin>>s[i].a>>s[i].b;
        s[i].flag=0;

        for(int j=0; j<s[i].b.length(); j++)
        {
            if(s[i].b[j]=='1') s[i].flag=1,s[i].b[j]='@';
            if(s[i].b[j]=='0') s[i].flag=1,s[i].b[j]='%';
            if(s[i].b[j]=='l') s[i].flag=1,s[i].b[j]='L';
            if(s[i].b[j]=='O') s[i].flag=1,s[i].b[j]='o';
            
        }
        fail=fail+s[i].flag;
    }
    if(fail==0)
    {
        if(n==1||n==0) 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",fail);
        for(int i=1; i<=n; i++)
        {
            if(s[i].flag==0) continue;
            cout<<s[i].a<<" "<<s[i].b<<endl;
        }
    }
    return 0;
}

 

转载于:https://www.cnblogs.com/zufezzt/p/5519253.html