第十二届蓝桥杯省赛JavaC组【第二场】真题——详细答案对照(完整版)

（1+11+52）/8

1

public static void main(String[] args) {
    int x=2021,sum=1;
    for (int i = 3; i <= 2021; i+=2) {
            sum=(sum*i)%100000;
    }
    System.out.println(sum);

}

public static void main(String[] args) {
    int sum=0;
    for (int i = 1; i < 2021; i++) {
        for (int j = 1; j < 2021; j++) {
            if(i*j<=2021) {
                sum++;
            }
        }
    }
    System.out.println(sum);

}

public static void main(String[] args) {
        long[][] dp = new long[6][2022];
        java.util.Arrays.fill(dp[1], 1);
        for (int k = 2; k <= 5; k++)
            for (int i = k; i <= 2021; i++)
                dp[k][i] = dp[k][i - 1] + dp[k - 1][i - 1];
        System.out.println(dp[5][2021]);
    }

public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    int a=sc.nextInt();
    int b=sc.nextInt();
    int c=sc.nextInt();
    System.out.println(f(a,b,c,0));

}
public static String f(int x,int y,int z,int count) {
    if(count>=6) {
        return "no";
    }
    if((x+y)%3==0) {
        return "yes";
    }else {
        return f(y,z,x,count+1);
    }
}

static int sum=0;
public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    for (int i = 0; i < 5; i++) {
        f(sc.nextInt());
    }
    System.out.println(sum);

}
public static void f(int x) {
    if(x%10==x/100%10+1&&x/1000==x/10%10) {
        sum++;
    }
}

public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    int x=sc.nextInt();
    int y=x/2;
    int sum=0;
    for (int i = 1; i <= x-1; i++) {
        double a=Math.pow(i, 2)%x;
        if(a<y) {
            sum++;
        }
    }
    System.out.println(sum);
}

public static void main(String[] args) {
    Scanner sc=new Scanner(System.in);
    int n=sc.nextInt();
    int a=1;
    while(true) {
        String str=String.valueOf(Math.sqrt(n*a));
        int x=str.indexOf(".");
        int b=Integer.parseInt(String.valueOf(str.charAt(x+1)));
        if(b==0&&str.length()-x-1==1) {
            System.out.println(a);
            return;
        }
        a++;
    }
}

Input：
2 6
5 5
1 1 5 3
2 2 2 6
3 1 2 3
4 1 6 1
5 1 3 3
6 1 3 4

Output：
2
-1
-1
1
-1
0

代码实现 (有个bug没修，但是给的测试用例没问题)
//存储任务的总信息
	static Map<Integer, List<Integer>> map=new HashMap<>();
	//存储每个任务的时间
	static List<Integer> times=new ArrayList<>();
	//存储每个任务所消耗的空间
	static List<Integer> kj=new ArrayList<>();
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();//电脑的数量
		int m=sc.nextInt();//任务数
		for (int i =1 ; i < n+1; i++) {
			map.putIfAbsent(i, new ArrayList<>());
			map.get(i).add(sc.nextInt());
		}
		for (int i = 1; i < m+1; i++) {
			int a=sc.nextInt();//读取任务编号
			int b=sc.nextInt();//读取电脑编号
			int c=sc.nextInt();//读取时间消耗
			int d=sc.nextInt();//读取空间消耗
			//时间消耗随着任务的增长而减小
			for (Integer item:map.keySet()) {
				if(map.get(item).size()==5) {
					for (int j = 0; j < times.size(); j++) {
						int y=times.get(j)-1;
						if(y==0) {
							int x=map.get(item).get(0);
							map.get(item).set(0,x+kj.remove(j));
							times.remove(j);
						}else {
							times.set(j, y);
						}		
					}
				}
			}
			//初始化电脑的任务
			if(map.get(b).get(0)>d&&map.get(b).size()<5) {
				map.get(b).add(a);
				map.get(b).add(b);
				map.get(b).add(c);
				map.get(b).add(d);
//				times.add(c);
//				kj.add(d);
			}
			//判断任务的消耗是否超出电脑本身的消耗
			if(map.get(b).get(0)-d<0) {
				System.out.println(-1);
				continue;
			}else {
				//未超出电脑消耗的话则为任务分配空间
				int x=map.get(b).get(0)-d;
					times.add(c);
					kj.add(d);
					System.out.println(x);
				map.get(b).set(0,x);
			}
			
		}
	}

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.PriorityQueue;
import java.util.Queue;

public class Main {

    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        Queue<Item> queue = new PriorityQueue();
        int n = in.nextInt(), m = in.nextInt();
        int[] comp = new int[n + 1];
        int a, b, c, d, time = 1;
        for (int i = 1; i <= n; i++)
              comp[i] = in.nextInt();
        for (int i = 0; i < m; i++) {
            a = in.nextInt();
            b = in.nextInt();
            c = in.nextInt();
            d = in.nextInt();
            if (a > time) time = a;
            while (queue.size() > 0) {
                Item item = queue.peek();
                if (item.time > time) break;
                comp[item.idx] += item.val;
                queue.remove();
            }
            if (comp[b] >= d) {
                queue.add(new Item(b, d, time + c));
                out.println(comp[b] -= d);
            } else out.println("-1");
        }
        out.flush();
    }

    static class Item implements Comparable<Item> {

        int time, idx, val;

        Item(int idx, int val, int time) {
            this.time = time;
            this.idx = idx;
            this.val = val;
        }

        @Override
        public int compareTo(Item o) {
            return this.time - o.time;
        }
    }

    static class InputReader {

        BufferedReader read;
        StringTokenizer token;
        String delimiters;

        InputReader (InputStream in) { this(in, " \t\n\r\f"); }

        InputReader (InputStream in, String delimiters) {
            this.read = new BufferedReader(new InputStreamReader(in));
            this.token = new StringTokenizer("", this.delimiters = delimiters);
        }

        String next() {
            while (!token.hasMoreTokens())
                try {
                    token = new StringTokenizer(read.readLine(), delimiters);
                } catch (IOException e) {
                    e.printStackTrace();
                }
            return token.nextToken();
        }

        int nextInt() { return Integer.parseInt(next()); }
    }
}