组队

第一种直接看

第二种枚举

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;
class MC {int N = 30;int n = 5;int[][] d = new int[N][N];int[] a = new int[N];boolean[] st = new boolean[N];int res = 0;void dfs(int cnt){if(cnt == n + 1){res = Math.max(res, d[a[1]][1] + d[a[2]][2] + d[a[3]][3] + d[a[4]][4] + d[a[5]][5]);return;}for (int i = 1; i <= 20; i++) {if(st[i]) continue;st[i] = true;a[cnt] = i;dfs(cnt + 1);st[i] = false;}}public void run() throws IOException {Scanner sc = new Scanner(System.in);for (int i = 1; i <= 20; i++) {for (int j = 0; j <= 5; j++) {d[i][j] = sc.nextInt();}}dfs(1);System.out.println(res);}
}
public class Main {public static void main(String[] args) throws IOException {new MC().run();}
}

不同字串

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;class MC {public void run() throws IOException {Set<String> set = new HashSet<>();String s = "0100110001010001";//枚举字串长度for (int i = 1; i <= s.length(); i++) {//枚举起点for (int j = 0; j < s.length(); j++) {if (j + i > s.length()) break;String ts = s.substring(j, j + i);set.add(ts);}}System.out.println(set.size());}
}public class Main {public static void main(String[] args) throws IOException {new MC().run();}
}

数列求值

package al4;import java.io.*;class MC{public void run() throws IOException {long a = 1, b = 1, c = 1;for (int i = 4; i <= 20190324; i++) {long t = a + b + c;a = b % 10000;b = c % 10000;c = t % 10000;}System.out.println(c);}int toInt(String s){return Integer.parseInt(s);}BufferedReader br = new BufferedReader(new InputStreamReader(System.in));BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
}public class Main {public static void main(String[] args) throws IOException {new MC().run();}
}

数的分解

0不是正整数

各不相同的数！！

3个数随机排列，共有3！=6种可能，这6种算1种

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;class MC {boolean check(int x){while (x > 0){if (x % 10 == 2 || x % 10 == 4) return false;x /= 10;}return true;}public void run() throws IOException {int cnt = 0;for (int i = 1; i < 2019; i++) {for (int j = 1; j < 2019; j++) {int k = 2019 - i - j;if (k <= 0) continue;//各不相同的数if(i == j || i == k || j == k) continue;if (check(i) && check(j) && check(k)) cnt ++;}}//3!System.out.println(cnt / 6);}
}public class Main {public static void main(String[] args) throws IOException {new MC().run();}
}

迷宫

遍历方向的顺序一定按照DLRU,这样会使最小字典序最先出现

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Map;
import java.util.Queue;class PII {int[] first;String second;int dist;public PII(int[] first, String second, int dist) {this.first = first;this.second = second;this.dist = dist;}
}
class MC {int N = 60;int mw = 50, mh = 30;int[][] g = new int[N][N];boolean[][] st = new boolean[N][N];//遍历方向的顺序一定按照DLRU,这样会使最小字典序最先出现int[][] fx = new int[][]{{1, 0, 1}, {0, -1, 2}, {0, 1, 3}, {-1, 0, 4}};Map<Character, Integer> m = new HashMap<>();String[] mfx = new String[]{"", "D", "L", "R", "U"};String res = null;public void run() throws IOException {for (int i = 1; i <= mh; i++) {String s = br.readLine();for (int j = 1; j <= mw; j++) {g[i][j] = s.charAt(j - 1) - '0';}}m.put('D',1);m.put('L',2);m.put('R',3);m.put('U',4);//bfsQueue<PII> q = new LinkedList<>();q.add(new PII(new int[]{1, 1}, "", 0));st[1][1] = true;while (q.size() > 0){PII p = q.poll();int x = p.first[0], y = p.first[1];for (int i = 0; i < 4; i++) {int tx = x + fx[i][0], ty = y + fx[i][1];if(tx < 1 || tx > mh || ty < 1 || ty > mw) continue;if(st[tx][ty] || g[tx][ty] == 1) continue;st[tx][ty] = true;String ts = p.second + mfx[fx[i][2]];int td = p.dist + 1;if (tx == mh && ty == mw){res = ts;}q.add(new PII(new int[]{tx, ty}, ts, td));}}System.out.println(res);}BufferedReader br = new BufferedReader(new InputStreamReader(System.in));int toInt(String s){return Integer.parseInt(s);}
}public class Main {public static void main(String[] args) throws IOException {new MC().run();}
}

特别数的和

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
class MC {public void run() throws IOException {int n = toInt(br.readLine());long sum = 0;for (int i = 1; i <= n; i++) {boolean f = false;int x = i;while (x > 0){if (x % 10 == 2 || x % 10 == 0 || x % 10 == 1 || x % 10 == 9) {f = true;break;}x /= 10;}if (f) sum += i;}System.out.println(sum);}BufferedReader br = new BufferedReader(new InputStreamReader(System.in));int toInt(String s){return Integer.parseInt(s);}
}public class Main {public static void main(String[] args) throws IOException {new MC().run();}
}

外卖店优先级

跟着大佬走

人物相关性分析

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;class MC {int[] na = new int[10], nb = new int[10];String a = " Alice", b = " Bob";int la = 5, lb = 3;List<Integer> ea = new ArrayList<>(), eb = new ArrayList<>();public void run() throws IOException {//nagetNe(na, a, la);//nbgetNe(nb, b, lb);int k = toInt(br.readLine());String s =  br.readLine();int n = s.length();s = " " + s;match(s, n, a, na, la, ea);match(s, n, b, nb, lb, eb);int cnt = 0;for (Integer i : ea) {int end = i + k + lb;int begin = i - la + 1 - k - 1;for (Integer j : eb) {if (j > i && j <= end) cnt++;if (j < i && j >= begin) cnt++;}}System.out.println(cnt);}private void match(String s, int n, String p, int[] ne, int len, List<Integer> list) {for (int i = 1, j = 0; i <= n; i++) {while (j > 0 && s.charAt(i) != p.charAt(j + 1)) j = ne[j];if(s.charAt(i) == p.charAt(j + 1)) j++;if (j == len){//                System.out.println(i);if (isWord(i , len, n, s)) list.add(i);j = na[j];}}}private boolean isWord(int i, int len, int n, String s) {boolean f = true;int begin = i - len;if (begin>= 1){char c = s.charAt(begin);if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')) f= false;}if (i + 1 <= n){char c = s.charAt(i + 1);if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z')) f= false;}return f;}private void getNe(int[] ne, String s, int len) {ne[1] = 0;for (int i = 2, j = 0;  i <= len; i++) {while (j > 0 && s.charAt(i) != s.charAt(j + 1)) j = ne[j];if (s.charAt(i) == s.charAt(j + 1)) j++;ne[i] = j;}}BufferedReader br = new BufferedReader(new InputStreamReader(System.in));int toInt(String s){return Integer.parseInt(s);}
}public class Main {public static void main(String[] args) throws IOException {new MC().run();}
}

后缀表达式

跟着大佬走

import java.io.IOException;
import java.util.Scanner;
import java.util.Arrays;
class MC {int N = (int) (1e6 + 10);int[] a = new int[N];public void run() throws IOException {Scanner sc = new Scanner(System.in);int n = sc.nextInt(), m = sc.nextInt();int k = n + m + 1;for (int i = 0; i < k; i++) {a[i] = sc.nextInt();}long res = 0;if (m == 0){for (int i = 0; i < k; i++) {res += a[i];}}else{Arrays.sort(a, 0, k);res += a[k - 1] - a[0];for (int i = 1; i < k - 1; i++) {res += Math.abs(a[i]);}}System.out.println(res);}
}public class Main {public static void main(String[] args) throws IOException {new MC().run();}
}

灵能传输

第十届蓝桥杯大赛个人赛省赛（软件类）真题相关推荐

第九届蓝桥杯大赛个人赛决赛（软件类）C大学B组题解
因能力有限,题解部分参照前辈想法,并加以博主思考. 如有不足,欢迎指正~! 目录试题A: 换零钞试题B: 激光样式试题C: 格雷码试题D: 调手表试题E: 搭积木(待解决) 试题F: 矩阵求 ...
第九届蓝桥杯大赛个人赛决赛（软件类本科B组）做题笔记和订正
标题:换零钞 x星球的钞票的面额只有:100元,5元,2元,1元,共4种. 小明去x星旅游,他手里只有2张100元的x星币,太不方便,恰好路过x星银行就去换零钱. 小明有点强迫症,他坚持要求200元换 ...
第六届蓝桥杯大赛个人赛决赛（软件类）真题-Java语言B组
目录 1.分机号 2.五星填数 3.显示二叉树 4.穿越雷区 5.表格计算 6.铺瓷砖 1.分机号 X老板脾气古怪,他们公司的电话分机号都是3位数,老板规定,所有号码必须是降序排列,且不能有重复的数位 ...
第六届蓝桥杯大赛个人赛决赛（软件类） C++A组真题题解
文章目录题目链接 A组真题题目结构第一题方格填数第二题四阶幻方第三题显示二叉树第四题穿越雷区第五题切开字符串第六题铺瓷砖(待补) 题目链接 A组真题题目结构题目类型 ...
第六届蓝桥杯大赛个人赛决赛（软件类）真题 Java语言B组答案
标题:分机号 X老板脾气古怪,他们公司的电话分机号都是3位数,老板规定,所有号码必须是降序排列,且不能有重复的数位.比如: 751,520,321 都满足要求,而, 766,918,201 就不符合要 ...
第七届蓝桥杯大赛个人赛决赛（软件类）真题 Java语言B组答案
以下代码纯自想自打,如有误,请提出,如可简,请告之,谢谢大家了. 蓝桥杯辅助资料真题下载 1 愤怒小鸟 X星球愤怒的小鸟喜欢撞火车! 一根平直的铁轨上两火车间相距 1000 米两火车 (不妨称A和 ...
2019年第十届蓝桥杯 C / C ++省赛 B 组真题题解
A: 组队输入数据编号号位1 2 3 4 51 97 90 0 0 0 2 92 85 96 0 0 3 0 0 0 0 93 4 0 0 0 80 86 5 89 83 97 0 0 6 82 ...
2019年第十届蓝桥杯C/C++ 省赛B组真题+题解
答案和代码仅供参考,比赛时倒数第二题花了太多时间,导致没时间写填空题最后一题和大题最后一题,唉,总的来说今年的题目比去年的简单,今年的蓝桥杯可真是"暴力杯".先放这么多东西吧,以 ...
第六届蓝桥杯大赛个人赛决赛（软件类）真题
分号机 import java.io.IOException; class MC{public void run(){int cnt = 0;for (int i = 9; i >= 0; i- ...

第十届蓝桥杯大赛个人赛省赛（软件类）真题

组队

第一种直接看

第二种枚举

不同字串

数列求值

数的分解

0不是正整数

各不相同的数！！

3个数随机排列，共有3！=6种可能，这6种算1种

迷宫

遍历方向的顺序一定按照DLRU,这样会使最小字典序最先出现

特别数的和

外卖店优先级

人物相关性分析

后缀表达式

灵能传输

第十届蓝桥杯大赛个人赛省赛（软件类）真题相关推荐

最新文章

热门文章