【第十四届蓝桥杯三月真题刷题训练——第 9 天（3.12）& 找素数 & 图书排列 & 日志统计 & 杨辉三角】

本文链接：https://blog.csdn.net/m0_52201500/article/details/129480345

第一题：找素数

解法：使用筛法进行筛选，很模板的题目。

public class Main {

    static int N = (int)1e7;
    static int[] primes = new int[N];
    static boolean[] st = new boolean[N];
    static int cnt;
    
    static void getPrimes(int n) {
        for(int i = 2; i <= n; i++) {
            if(!st[i]) {
                primes[++cnt] = i;
            }
            for(int j = 1; primes[j] <= n/i; j++) {
                st[primes[j]*i] = true;
                if(i % primes[j] == 0) break;
            }
        }
    }
    
    public static void main(String[] args) {
//        getPrimes(N-10);
//        System.out.println(primes[(int)1e5+2]);
        
        System.out.println(1299743);
    }

}

第二题：图书排列

第三题：日志统计

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class Main {
    static int N = (int)1e5 + 10;
    static List<Point> list = new ArrayList<>();
    static int[] a = new int[N];

    static class Point{
        int x, y;
        public Point(int x, int y){
            this.x = x;
            this.y = y;
        }
    }

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] s = br.readLine().split(" +");
        int n = Integer.parseInt(s[0]);
        int d = Integer.parseInt(s[1]);
        int k = Integer.parseInt(s[2]);

        for(int i = 1; i <= n; i++){
            s = br.readLine().split(" +");
            int ts = Integer.parseInt(s[0]);
            int id = Integer.parseInt(s[1]);
            list.add(new Point(ts, id));
        }
//
//        for(int i = 0; i < list.size(); i++){
//            Point t = list.get(i);
//            System.out.println(t.x + " " + t.y);
//        }

        list.sort(new Comparator<Point>() {
            @Override
            public int compare(Point o1, Point o2) {
                if(o1.x != o2.x){
                    return o1.x - o2.x;
                }
                return o1.y - o2.y;
            }
        });


        Set<Integer> set = new TreeSet<>();

        for(int i = 0, j = 0; i <= j && j < list.size(); i++){
            Point t1 = list.get(i);
            Point t2 = list.get(j);
//            System.out.println();
//            System.out.println(i + " 111 ");
            while(t1.x + (d-1) >= t2.x && j < list.size()){
//                System.out.println(i + " " + j);
                a[t2.y]++;
                if(a[t2.y] >= k) {
                   set.add(t2.y);
                }
                j++;
                if(j < list.size())
                    t2 = list.get(j);
            }

            a[t1.y]--;
        }

       for(int num: set){
           System.out.println(num);
       }

    }
}
//10 100 3
//30475 40668
//99004 84235
//51780 98028
//23121 8789
//78716 20034
//78719 20034
//78713  20034
//30519 40668
//30459 40668
//53454 97067