剑气扬名-CSDN博客

原创 kuangbin带你飞专题1-23 题单

kuangbin大神，对于打过ACM比赛的ACMer，无人不知无人不晓。在此，附上vjudge平台上一位大神整理的[kuangbin带你飞]专题目录链接。[kuangbin带你飞专题目录1-23] : https://vjudge.net/article/187专题一简单搜索POJ 1321 棋盘问题POJ 2251 Dungeon MasterPOJ 3278 Catch That...

2020-01-27 10:07:07 2602

蓝桥杯第七届决赛真题JAVA大学C组#include <iostream>#include <cstdio>using namespace std;bool vis[1005];int main() { int ans = 0; for (int i = 0; i <= 1000; i ++) { if (!vis[(i * i) % 100]) ans ++; vis[(i * i) % 100] = true; } cout <&lt

2021-05-26 17:26:14 162

原创蓝桥杯2016年第七届C++B组

蓝桥杯2016年第七届C++B组#include <iostream>#include <algorithm>using namespace std;int main() { int ans = 600; for (int i = 0; i <= 300; i ++) { for (int j = 0; j <= 300; j ++) { if (i * 97 - j * 127 == 1) { ans = min(ans, i +

2021-05-24 18:48:09 246 5

原创第十届蓝桥杯大赛软件类决赛Java大学B组

第十届蓝桥杯大赛软件类决赛Java大学B组#include <iostream>#include <cstdio>#include <string>#include <cstring>#include <algorithm>using namespace std;int n = 30, m = 50;char mp[55][55];int cnt = 0;//string str = "LANNQIAO";string

2021-04-30 16:49:09 285 2

原创 ACM训练赛第19场补题

ACM训练赛第19场补题问题 A: At Least Average时间限制: 1 Sec 内存限制: 128 MB题目描述Blake plays a video game that has n levels. On each level, she can earn in between 0 and 10 points, inclusive. The number of points she gets on a level must be an integer. She has set up a

2021-04-22 20:30:15 208

原创 ACM训练赛第17场

ACM训练赛第17场问题 A: Bing Bong to Bong Bong时间限制: 2 Sec 内存限制: 128 MB题目描述Bing Bong, the pink imaginary friend from Riley’s childhood, is lonely.He wants to preserve his memory, but he wants to try to hide his name in the stories. He wants you to help him do

2021-04-14 16:32:47 285

原创 ACM训练赛第16场

ACM训练赛第16场问题 F: Exam Manipulation时间限制: 1 Sec 内存限制: 128 MB题目描述A group of students is taking a True/False exam. Each question is worth one point. You, as their teacher, want to make your students look as good as possible—so you cheat! (I know, you would

2021-04-12 17:36:58 519

原创 Linux环境下输出Hello World

Linux环境下输出Hello World进入home目录cd /home创建C++目录mkdir C++进入C++目录下cd C++创建C语言文件touch HelloWorld.c编辑C语言文件vim HelloWorld.c进入后按键盘上的i进入insert模式敲入C语言代码按住Esc键退出写入模式保存退出命令:wq生成可执行文件gcc HelloWorld.c -o HelloWorld运行HelloWorld文件./HelloWorld

2021-04-02 17:05:05 1816

原创贪心

贪心import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] a = new int[n + 5]; for (int i = 0; i < n; i ++) { a[i] = in.nextInt(); } int

2021-04-01 20:44:13 107

原创双指针与BFS

双指针与BFSimport java.util.ArrayList;import java.util.Collections;import java.util.Scanner;import java.util.Comparator;public class Main { static int[] cnt = new int[100000 + 5]; static boolean[] st = new boolean[100000 + 5]; public static void

2021-03-31 19:25:28 173 2

原创枚举、模拟与排序

枚举、模拟与排序import java.util.Scanner;public class Main { static int INF = 0x3f3f3f3f; public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int[] a = new int[n + 5]; for (int i = 0; i < n; i ++

2021-03-26 22:19:03 125

原创数学与简单DP

数学与简单DPimport java.util.Scanner;public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int m = in.nextInt(); System.out.println(n * m - n - m); }}import java.util.Scanner

2021-03-24 20:56:58 135

原创二分与前缀和

二分与前缀和import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); int q = in.nextInt(); int[] a = new int[n + 5]; for (int i = 0; i < n; i ++) { a[i

2021-03-23 19:25:03 146

原创递归与递推

递归与递推import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int n = in.nextInt(); for (int i = 0; i < 1 << n; i ++) { for (int j = 0; j < n; j ++) { if ((i

2021-03-22 16:40:02 177 1

原创蓝桥杯九宫重排

蓝桥杯九宫重排C++#include <iostream>#include <cstdio>#include <string> #include <cstring>#include <algorithm>#include <queue>using namespace std;int dx[] = {1, -1, 0, 0};int dy[] = {0, 0, 1, -1};int factor[] = {

2020-11-07 17:14:58 182

原创区间dp模板石子合并

石子合并设有N堆石子排成一排，其编号为1，2，3，…，N。每堆石子有一定的质量，可以用一个整数来描述，现在要将这N堆石子合并成为一堆。每次只能合并相邻的两堆，合并的代价为这两堆石子的质量之和，合并后与这两堆石子相邻的石子将和新堆相邻，合并时由于选择的顺序不同，合并的总代价也不相同。例如有4堆石子分别为 1 3 5 2，我们可以先合并1、2堆，代价为4，得到4 5 2，又合并 1，2堆，代价为9，得到9 2 ，再合并得到11，总代价为4+9+11=24；如果第二步是先合并2，3堆，则代价为7，得

2020-11-01 15:22:26 242

原创 01背包优先队列优化

01背包优先队列优化设重量为w，权值为v则单位重量价值为v / w设有物品1，物品2若v1 / w1 < v2 / w2则说明v2的单位重量价值高即v1 * w2 < v2 * w1于是可重载结构体，使得v2 * w1大的优先级高即：struct Node { LL w, v; Node() {}; Node(LL _w, LL _v) {w = _w, v = _v;} friend bool operator < (Node a, Node b) {

2020-10-31 19:17:11 526

原创 Java函数判定大素数

Java函数判定大素数import java.math.BigInteger;import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); BigInteger x; while(in.hasNextBigInteger()) { x = in.nextBigInteger(); if(x

2020-10-28 17:30:05 281

原创 SPFA最短路Java模板

SPFA最短路Java模板import java.util.LinkedList;import java.util.Queue;public class Main { public static void main(String[] args) { } static int MAXN = 10000 + 10; static int[] head = new int[MAXN]; static int[] nxt = new int[MAXN << 1]; st

2020-10-15 19:01:06 226 2

原创 ST表

ST表模板ST表求区间最大值模板import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); int T = in.nextInt(); while(T -- > 0) { int n = in.nextInt(); num = new int[100000 + 10][20]

2020-10-13 10:27:02 239

原创二进制枚举

二进制枚举ACM中二进制枚举C++1秒大约能枚举22位，for循环不能跑太多，加上子层循环和判断，所以一般范围大概就是在22左右。int i = 0; i < 1 << 221 << 30是1e9超过int类型需要转换为long long类型1ll << 301ll << 60二进制枚举范围为0到2^n - 1。例题import java.util.Scanner;public class Main { // 15个

2020-10-09 13:07:02 232

原创背包九讲总结

背包九讲总结n件物品，背包容量为m。物品体积为v，价值为w。01背包模板for(int i = 0; i < n; i ++) { for(int j = m; j >= v[i]; j --) { dp[j] = Math.max(dp[j], dp[j - v[i]] + w[i]); }}System.out.println(dp[m]);完全背包模板for(int i = 0; i < n; i ++) { for(int j = v[i]; j &lt

2020-10-08 12:55:00 181 4

原创第十一届蓝桥杯大赛软件类省赛Java大学B组（第一场）

第十一届蓝桥杯大赛软件类省赛Java大学B组（第一场）YeRikGSunlRzgDlvRwYkXkrGWWhXaAimport java.util.Date;import java.text.ParseException;import java.text.SimpleDateFormat;public class Main { public static void main(String[] args) throws ParseException { SimpleDateFor

2020-10-05 18:00:10 3068 5

原创 Java优先队列

Java优先队列Java优先队列默认为最小堆PriorityQueue<Integer> p = new PriorityQueue<Integer>();for(int i = 1; i <= 10; i ++) p.add(i);System.out.println(p.poll());运行结果为1重写compare函数得到最大堆static class cmp implements Comparator <Integer>{ public

2020-09-25 15:55:35 233

原创最长上升子序列

最长上升子序列模板动态规划#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>using namespace std;int num[100000 + 10];int dp[100000 + 10];int main(){ int n; scanf("%d", &n); for(

2020-09-05 20:22:32 109

原创卡特兰数模板

卡特兰数卡特兰数又称卡塔兰数，是组合数学中一个经常出现在各类计数问题中的数列。其前几项为：1, 1, 2, 5, 14, 42, 132, 429, 1430, 4862, 16796, 58786, 208012, 742900, 2674440, 9694845, 35357670, 129644790, 477638700, 1767263190, 6564120420, 24466267020, 91482563640, 343059613650, 1289904147324, 48619464

2020-07-25 21:29:08 435

空空如也

空空如也