3-8re,所有的手造案例都是对的
查看原帖
3-8re,所有的手造案例都是对的
480338
睡到、、楼主2022/9/19 13:25

3-8re,所有的手造案例都是对的,四舍五入,文本也有<,有空格都考虑了


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

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int a = 0;
        int count = 0;
        int temp = 0;
        String[] arr1 = new String[10010];
        
        // 输入
        while (scanner.hasNextLine()) {
            arr1[a++] = scanner.nextLine();
            // System.out.println("arr1[" + (a - 1) + "]" + arr1[a - 1]);
            temp = arr1[a - 1].indexOf("<");
            while (temp != -1) {
                if (temp == 0)
                    arr1[a - 1] = arr1[a - 1].substring(1);
                else {
                    arr1[a - 1] = arr1[a - 1].substring(0, temp - 1)
                            + arr1[a - 1].substring(temp + 1);
                }
                temp = arr1[a - 1].indexOf("<");

            }
            if (arr1[a - 1].equals("EOF")) {
                count = a;
                break;
            }
        }
        a = 0;
        String[] arr2 = new String[count];
        while (scanner.hasNextLine()) {
            arr2[a++] = scanner.nextLine();
            temp = arr2[a - 1].indexOf("<");
            if (arr2[a - 1] == "") {
                a--;
            } else {
                while (temp != -1) {
                    if (temp == 0)
                        arr2[a - 1] = arr2[a - 1].substring(1);
                    else {
                        arr2[a - 1] = arr2[a - 1].substring(0, temp - 1)
                                + arr2[a - 1].substring(temp + 1);
                    }
                    temp = arr2[a - 1].indexOf("<");

                }
            }
            // System.out.println("arr2[" + (a - 1) + "]" + arr2[a - 1]);
            if (arr2[a - 1].equals("EOF")) {
                break;
            }
        }
        a = 0;
        int c = 0;
        int ev = scanner.nextInt();
        // System.out.println(ev);
        for (int i = 0; i < count - 1; i++) {
            for (int j = 0; j < arr1[i].length(); j++)
                if (arr1[i].charAt(j) == arr2[i].charAt(j)) {
                    c++;
                }
            // System.out.println("第" + i + "行" + arr1[i] + ": " + c);
        }
        System.out.println((int)(c / (ev / 60.0) + 0.5));
        scanner.close();
    }
}

大佬们看看吧

2022/9/19 13:25
加载中...