#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
struct node
{
char name[25],pwd[25];
bool ischange=false;//默认为没有被修改过
}T[1005];
int cou=0;
void modify(node &T)
{
for(int i=0;i<strlen(T.pwd);i++)
{
if(T.pwd[i]=='1')
{
T.pwd[i]='@';
T.ischange=true;
}
else if(T.pwd[i]=='0')
{
T.pwd[i]='%';
T.ischange=true;
}
else if(T.pwd[i]=='l')
{
T.pwd[i]='L';
T.ischange=true;
}
else if(T.pwd[i]=='O')
{
T.pwd[i]='o';
T.ischange=true;
}
}
if(T.ischange==true)
{
cou++;
}
}
int main()
{
// freopen("in.txt","r",stdin);
int N;
scanf("%d",&N);
for(int i=0;i<N;i++)
{
scanf("%s %s",T[i].name,T[i].pwd);
modify(T[i]);
}
if(cou==0)
{
if(N==1)
printf("There is 1 account and no account is modified\n");
else
printf("There are %d accounts and no account is modified",N);
}
else
{
printf("%d\n",cou);
for(int i=0;i<N;i++)
{
if(T[i].ischange==true)
printf("%s %s\n",T[i].name,T[i].pwd);
}
}
return 0;
}
1035. Password (20)
最新推荐文章于 2020-06-08 22:43:29 发布