PAT甲级1035 Password 题解

先输入n,在输入n个编号和密码，将密码中的1->@，0->%，l->L，O->o，

若没有修改，则输出，There are N accounts and no account is modified

                        若N为1，则输出There is 1 account and no account is modified。

使用String类型进行存储。

代码如下：

#include<bits/stdc++.h>
using namespace std;
int n,ans=0;
int main(){
    cin>>n;
    int flag=0,a=0;
    string s1[1000],s2[1000],s3[1000],s4[1000];
    for(int i=0;i<n;i++){
        cin>>s1[i]>>s2[i];
    }
    for(int i=0;i<n;i++){
        int num = s2[i].size();
        for(int j=0;j<num;j++){
            if((s2[i][j]=='1')||(s2[i][j]=='0')||(s2[i][j]=='l')||(s2[i][j]=='O')){
                flag=1;
            }
            if(s2[i][j]=='1')
                s2[i][j]='@';
            if(s2[i][j]=='0')
                s2[i][j]='%';
            if(s2[i][j]=='l')
                s2[i][j]='L';
            if(s2[i][j]=='O')
                s2[i][j]='o';
        }
        if(flag==1){
            s3[ans]=s2[i];
            s4[ans]=s1[i];
            ans++;
        }
        flag=0;
    }
    
    if(ans==0) { 
		// 1 account and no account is modified
		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);
		}
    }else{
        cout<<ans<<endl;
        for(int i=0;i<ans;i++){
            cout<<s4[i]<<" "<<s3[i]<<endl;
        }
    }
        return 0;
}