hihocoder66

http://hihocoder.com/contest/offers66/problems

题目1 : 最小距离字符串

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        char[]cs1=sc.next().toCharArray(),cs2=sc.next().toCharArray(),cs3=sc.next().toCharArray();
        int res=0;
        for(int i=0;i<cs1.length;i++) {
            if(cs1[i]!=cs2[i] && cs1[i]!=cs3[i] && cs2[i]!=cs3[i]) res+=2;
            else if(cs1[i]==cs2[i] && cs1[i]==cs3[i]);
            else res+=1;
        }
        System.out.println(res);
    }
}

题目2 : 打牌

import java.util.Arrays;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n=sc.nextInt();
        int[][]a=new int[n][3];
        for(int i=0;i<n;i++)a[i]=new int[]{sc.nextInt(),sc.nextInt(),sc.nextInt()};
        for(int[]t:a) Arrays.sort(t);
        
        int max0=-1, max1=-1;
        for(int[]t:a) {
            max0=Math.max(max0,t[0]);
            max1=Math.max(max1,t[1]);
        }
        
        int res=0;
        for(int[]t:a)
            if(t[1]>max0 && t[2]>max1) res++;
        System.out.println(res);
    }
}

题目4 : 密码转化

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n=sc.nextInt();
        String s1=sc.next(), s2=sc.next();
        char[]cs1=s1.toCharArray(),cs2=s2.toCharArray();
        
        int res=0, i=0;
        while(i<n) {
            int j=i;
            while(j<n && cs1[j]==cs2[j]) j++;
            if(j==n) break;
            while(j<n && cs1[j]!=cs2[j]) j++;
            res++;
            i=j;
        }
        System.out.println(res);
    }
}