小工具知识网

当前位置: 首页 > 行业知识 > 第十五届蓝桥杯模拟赛【第三期】Java

行业知识

第十五届蓝桥杯模拟赛【第三期】Java

2026-11-16 14:53:14 来源:互联网转载

1.

package 第十五届模拟赛;public class problem01 {    public static void main(String[] args) {        int ans = 0;        for (int i = 1; i             if (2023 % i == 0) {                ans++;                System.out.println(i);            }        }        System.out.println(ans);    }}    public static void main(String[] args) {        int ans = 0;        for (int i = 10; i             for (int j = 0; j                 if (i - j = 10) {                    ans++;                }            }        }        System.out.println(ans);    }}    static final int N = 1000000;    static int[] p = new int[N + 10];    static boolean[] vis = new boolean[N + 10];    static int cnt = 0;    static void isP() {        for (int i = 2; i * i             for (int j = i * i; j                 vis[j] = true;            }        }    }    public static void main(String[] args) {        isP();        int ans = 0;        for (int i = 2; i             if (!vis[i] && check(i)) {                ans++;                //System.out.println(i);            }        }        System.out.println(ans);    }    static boolean check(int n) {        int res = 0;        while(n  0) {            res += n % 10;            n /= 10;        }        return res == 23;    }}    public static void main(String[] args) {        BigInteger a = new BigInteger("12345678901234567890123456789012345678901234567890");        BigInteger b = new BigInteger("2023");        BigInteger mod = a.mod(b);        System.out.println(mod);    }}    static int[][] mp = new int[30][20];    public static void main(String[] args) {        int n, m;        n = 30; m = 20;        Scanner scanner = new Scanner(System.in);        for (int i = 0; i = m);    }}

10.

package 第十五届模拟赛;import java.util.Scanner;public class problem10 {    static final int N = 1000000 + 10;    static final int MOD = 1000000007;    static int[] f = new int[N];    public static void main(String[] args) {        Scanner scanner = new Scanner(System.in);        int n = scanner.nextInt();        int a = scanner.nextInt();        int b = scanner.nextInt();        int c = scanner.nextInt();        f[a] = f[b] = f[c] = 1;        // a + b        for (int i = a + 1; i             f[i] = (f[i] + f[i - a]) % MOD;            if (i = b) {                f[i] = (f[i] + f[i - b]) % MOD;            }            if (i >= c) {                f[i] = (f[i] + f[i - c]) % MOD;            }        }        System.out.println(f[n] % MOD);    }}
()()

上一篇:CSS鼠标浮动样式定制秘籍,轻松打造独特悬浮效果!

下一篇:京东账户注销全攻略,轻松删除账户,细节一网打尽