PAT1035

最新推荐文章于 2016-03-04 22:44:34 发布

once_charming

最新推荐文章于 2016-03-04 22:44:34 发布

阅读量210

点赞数

分类专栏： PAT 文章标签： pat

本文链接：https://blog.csdn.net/baidu_33893880/article/details/50659848

版权

PAT 专栏收录该内容

19 篇文章 0 订阅

订阅专栏

题目链接：
http://www.patest.cn/contests/pat-a-practise/1035
水题，代码如下：


import java.util.ArrayList;
import java.util.Scanner;

public class Main {
    static String[] name;
    static String[] pass;
    static int N;
    static ArrayList<Integer> ar;
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        N=sc.nextInt();
        name=new String[N];
        pass=new String[N];
        for(int i=0;i<=N-1;i++){
            name[i]=sc.next();
            pass[i]=sc.next();
        }
        ar=new ArrayList<Integer>();
        modified();
        if(ar.size()==0) {
            if(N==1) System.out.print("There is 1 account and no account is modified");
            else System.out.print("There are "+N+" accounts and no account is modified");
        }
        else{
            System.out.println(ar.size());
            for(int i=0;i<ar.size();i++){
                int t=ar.get(i);
                System.out.print(name[t]+" "+pass[t]);
                if(i!=ar.size()-1) System.out.println();
            }
        }


    }
    public static void modified(){
        for(int i=0;i<N;i++){
            int flag=0;
            char[] ss=pass[i].toCharArray();
            for(int j=0;j<ss.length;j++){
                if(ss[j]=='1'){
                    ss[j]='@';
                    flag=1;
                }
                else if(ss[j]=='0'){
                    ss[j]='%';
                    flag=1;
                }
                else if(ss[j]=='l'){
                    ss[j]='L';
                    flag=1;
                }
                else if(ss[j]=='O'){
                    ss[j]='o';
                    flag=1;
                }

            }
            if(flag==1) {
                ar.add(i);
                String s="";
                for(int m=0;m<ss.length;m++)
                    s+=ss[m];
                pass[i]=s;

            }
        }
    }

}