第十四届蓝桥杯三月真题刷题训练——第 12 天

0 的个数

原题链接

0 的个数

问题描述

解题思路

模拟

参考代码

import java.util.*;
import java.math.*;
import java.io.*;

public class Main {

    static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    
    public static void main(String[] args) throws Exception {
    	long n = Long.parseLong(in.readLine());
    	int cnt = 0;
    	while (n > 0) {
    		int mod = (int)(n % 10);
    		if (mod == 0) cnt++;
    		else break;
    		n /= 10;
    	}
    	out.println(cnt);

        out.flush();
        in.close();
    }  
}

超级质数

原题链接

超级质数

问题描述

解题思路

根据题意模拟判断即可

参考代码

import java.util.*;
import java.math.*;
import java.io.*;

public class Main {

    static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    
    public static boolean isPrime(int x) {
    	if (x < 2) return false;
    	int end = (int)Math.sqrt(x);
    	for (int i = 2; i <= end; i++) {
    		if (x % i == 0) return false;
    	}
    	return true;
    }
    
    public static boolean check(int x) {
    	int cnt = 0, t = x;
    	while (t > 0) {
    		t /= 10;
    		cnt++;
    	}
    	t = 10;
    	for (int i = 1; i <= cnt; i++) {
    		if (!isPrime(x % t)) return false;
    		t *= 10;
    	}
    	return true;
    }
    
    public static void main(String[] args) throws Exception {
    	
    	int[] p = {2, 3, 5, 7};
    	List<Integer> pre = new ArrayList<>(), cur = new ArrayList<>();
    	pre.add(0);
    	boolean flag = true;
    	int mx = 0;
    	while (flag) {
    		flag = false;
    		for (int i = 0; i < 4; i++) {
        		for (int num: pre) {
        			int t = num * 10 + p[i];
        			if (isPrime(t) && check(t)) {
        				cur.add(t);
        				mx = Math.max(mx, t);
        				flag = true;
        			}
        		}	
        	}
    		pre = cur;
    		cur = new ArrayList<>();
    	}
    
    	out.println(mx);

        out.flush();
        in.close();
    }  
}

卡牌

原题链接

卡牌

问题描述

解题思路

经典二分答案

参考代码

import java.util.*;
import java.math.*;
import java.io.*;

public class Main {

    static BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
    static PrintWriter out = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
    
    static int N = (int)2e5 + 10;
    static long n, m;
    static int[] a = new int[N], b = new int[N];
    
    public static boolean check(int x) {
        long cnt = m;
        for (int i = 0; i < n; i++) {
            if (a[i] >= x) continue;
            int dif = x - a[i];
            if (dif <= cnt && dif <= b[i]) {
                cnt -= dif;
            } else {
                return false;
            }
        }
        return true;
    }
 
    public static void main(String[] args) throws Exception {
        String[] s = in.readLine().split(" ");
        n = Long.parseLong(s[0]);
        m = Long.parseLong(s[1]);
        String[] ss = in.readLine().split(" ");
        for (int i = 0; i < n; i++) a[i] = Integer.parseInt(ss[i]);
        ss = in.readLine().split(" ");
        for (int i = 0; i < n; i++) b[i] = Integer.parseInt(ss[i]);
        
        int l = 0, r = (int)4e5 + 10;
        while (l < r) {
            int mid = l + ((r - l + 1) >> 1);
            if (check(mid)) {
                l = mid;
            } else {
                r = mid - 1;
            }
        }
        out.println(l);
        
        out.flush();
        in.close();
    }  
}

染色时间

原题链接

染色时间

问题描述

解题思路

todo：这里是解题思路

参考代码

todo：这里是参考代码