Password (20)

Password (20)

时间限制 1000 ms 内存限制 65536 KB 代码长度限制 100 KB 判断程序 Standard (来自 小小)
题目描述
To prepare for PAT, the judge sometimes has to generate random passwords for the users. The problem is that there are always some confusing passwords since it is hard to distinguish 1 (one) from l (L in lowercase), or 0 (zero) from O (o in uppercase). One solution is to replace 1 (one) by @, 0 (zero) by %, l by L, and O by o. Now it is your job to write a program to check the accounts generated by the judge, and to help the juge modify the confusing passwords.

输入描述:
Each input file contains one test case. Each case contains a positive integer N (<= 1000), followed by N lines of accounts. Each account consists of a user name and a password, both are strings of no more than 10 characters with no space.

输出描述:
For each test case, first print the number M of accounts that have been modified, then print in the following M lines the modified accounts info, that is, the user names and the corresponding modified passwords. The accounts must be printed in the same order as they are read in. If no account is modified, print in one line “There are N accounts and no account is modified” where N is the total number of accounts. However, if N is one, you must print “There is 1 account and no account is modified” instead.

输入例子:
3
Team000002 Rlsp0dfa
Team000003 perfectpwd
Team000001 R1spOdfa

输出例子:
2
Team000002 RLsp%dfa
Team000001 R@spodfa

题解：字符串的替换，用vector来记录下标，注意num不同条件下的判断。

#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
#define vi vector<int>
#define pii pair<int,int>
#define x first
#define y second
#define all(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define SZ(x) x.size()
#define rep(i,a,b) for(int i=a;i<b;i++)
#define per(i,a,b) for(int i=b-1;i>=a;i--)
#define pi acos(-1)
#define mod 1000000007
#define inf 1000000007
#define ll long long
#define DBG(x) cerr<<(#x)<<"="<<x<<"\n";
#define N 200010
template <class U,class T> void Max(U &x, T y){if(x<y)x=y;}
template <class U,class T> void Min(U &x, T y){if(x>y)x=y;}
template <class T> void add(int &a,T b){a=(a+b)%mod;}
const int maxn=100001;
struct pd{
    string name;
    string pwd;
}p[maxn];
int main()
{

   int n,f1=0,num=0;
   vi v;
   cin>>n;
   rep(i,0,n)
   {
       f1=0;
       cin>>p[i].name>>p[i].pwd;
       rep(j,0,p[i].pwd.size())
       {
           if(p[i].pwd[j]=='1') {p[i].pwd[j]='@';f1=1;}
           if(p[i].pwd[j]=='0') {p[i].pwd[j]='%';f1=1;}
           if(p[i].pwd[j]=='l') {p[i].pwd[j]='L';f1=1;}
           if(p[i].pwd[j]=='O') {p[i].pwd[j]='o';f1=1;}
       }
       if(f1==1) {
            num++;
            v.push_back(i);
       }
   }
   if(num!=0)
   {
        cout<<num<<endl;
        for(vi::iterator it=v.begin();it!=v.end();it++)
        {
            cout<<p[*it].name<<" "<<p[*it].pwd<<endl;
        }
   }
   else if(num==0&&n>1)
   {
       cout<<"There are "<<n<<" accounts and no account is modified"<<endl;
   }
   else
   {
       cout<<"There is 1 account and no account is modified"<<endl;
   }
   return 0;
}