第十五届蓝桥杯大赛软件赛省赛 Java 研究生组 参考答案

真题来源

蓝桥杯大赛历届真题_蓝桥杯 - 蓝桥云课

试题A 劲舞团

package question15th;
import java.io.*;
import java.lang.*;

/**
 * 劲舞团
 */
public class Demo1 {
    public static void main(String[] args) throws Exception{
        BufferedReader reader = new BufferedReader(new FileReader("src/question15th/log.txt"));
        String line;
        int res=0;
        int validNum = 0;
        long lastTime = Long.MIN_VALUE;
        while((line = reader.readLine()) != null){
            String[] arrays = line.split(",");
            long nowTime = Long.parseLong(arrays[2]);
            if(arrays[0].equals(arrays[1])){
                if(nowTime-lastTime<=1000){
                    validNum+=1;
                }else{
                    validNum=1;
                }
            }else{
                validNum=0;
            }
            lastTime= nowTime;
            res=Math.max(validNum,res);
        }
        System.out.println(res);
    }
}

测试用例

A,A,1000
S,S,1500
D,D,2500
F,F,4000
A,S,6000
S,D,8000
D,F,10000
F,A,15000
A,A,16000
S,S,17000
D,D,18000
F,F,19000
A,A,25000
S,S,26000
D,D,28000
F,F,29000
A,S,35000
S,D,36000
D,F,37000
F,A,40000
A,D,45000
S,S,46000
D,D,47000
F,F,48000
A,A,55000
S,S,56000
D,D,57000
F,F,60000
A,A,65000
S,D,67000
D,S,70000
F,F,75000

试题B 召唤数学精灵

package question15th;

/**
 * 召唤数学精灵
 * 本题无法直接得出正确答案，可以通过不断尝试找出规律。
 * 要学习思路。
 */
public class Demo2 {
    public static void main(String[] args) {
        System.out.println(fun(2));
        System.out.println(fun(20));
        System.out.println(fun(202));
        System.out.println(fun(2024));
        System.out.println(fun(20240));
        System.out.println(fun(202404));
        System.out.println(fun(2024041));
        System.out.println(fun(20240413));
        System.out.println(fun(202404133));
        System.out.println(fun(2024041331));
    }

    /**
     *
     * @param target 目标数字
     * @return 召唤的数字精灵数量
     */
    static int fun(long target){
        long add = 0;
        long mult = 1;
        int res = 0;
        for(long i=1;i<=target;i++){
            mult *= i;
            add += i;
            if ((mult - add) % 100 == 0) {
                res++;
            }
        }
        return res;
    }
}

试题C 封闭图形个数

package question15th;

import java.util.Arrays;
import java.util.Comparato