PAT 1035. 密码
原题链接
简单
作者:
YAX_AC
,
2024-11-21 11:47:23
,
所有人可见
,
阅读 2
#include<iostream>
using namespace std;
const int N = 1010;
string name[N],pwd[N];
string change(string str)
{
string res;
for(auto c:str)
{
if(c=='1') res+='@';
else if(c=='0') res+='%';
else if(c=='l') res+='L';
else if(c=='O') res+='o';
else res+=c;
}
return res;
}
int main()
{
int n;
cin>>n;
int m = 0;
for(int i = 0; i<n; i++)
{
string cur_name,cur_pwd;
cin>>cur_name>>cur_pwd;
string change_pwd = change(cur_pwd);
if(change_pwd != cur_pwd)
{
name[m] = cur_name;
pwd[m] = change_pwd;
m++;
}
}
if(!m)
{
if(n==1) puts("There is 1 account and no account is modified");
else printf("There are %d accounts and no account is modified",n);
}
else
{
cout<<m<<endl;
for(int i = 0; i<m; i++) cout<<name[i]<<' '<<pwd[i]<<endl;
}
return 0;
}