#include<iostream>
#include<queue>
#include<malloc.h>
#include<cstdio>
#include<vector>
using namespace std;
int flag=0;
int main()
{
int n;
char x[1000][11],y[1000][11];
char a[1000]={0};
cin>>n;
int j=0;
int p=0;
for(int i=0; i<n; i++){
scanf("%s %s",x[i],y[i]);
while(y[i][j]!='\0'){
if(y[i][j]=='0') y[i][j]='%',flag=1,a[i]=1;
if(y[i][j]=='1') y[i][j]='@',flag=1,a[i]=1;
if(y[i][j]=='O') y[i][j]='o',flag=1,a[i]=1;
if(y[i][j]=='l') y[i][j]='L',flag=1,a[i]=1;
j++;
}
if(a[i]==1) p++;
j=0;
}
if(n==1&&flag==0){
cout<<"There is 1 account and no account is modified";
return 0;
}
if(flag==0){
cout<<"There are "<<n<<" accounts and no account is modified";
return 0;
}
cout<<p<<endl;
for(int i=0; i<n; i++){
if(a[i]==1){
int m=0,k=0;
while(x[i][m]!='\0'){
cout<<x[i][m];
m++;
}
cout<<' ';
while(y[i][k]!='\0'){
cout<<y[i][k];
k++;
}
if(i!=n-1) cout<<endl;
}
}
return 0;
}
PAT甲级1035 Password
最新推荐文章于 2022-09-22 19:41:38 发布