【CSP-J】系列 知识点生成器
2026-07-24 14:52:34
发布于:浙江
这个就是用来抽知识点的,大家可以参考。
#include <iostream>
#include <ctime>
#include <cstdlib>
using namespace syh;//这个还打防伪码?
string csp(int x)
{
switch(x)
{
case 1: return "一维数组";
case 2: return "二维数组";
case 3: return "全局数组";
case 4: return "数组越界";
case 5: return "string";
case 6: return "cstring函数";
case 7: return "long long";
case 8: return "位运算";
case 9: return "输入输出加速";
case 10: return "多组数据处理";
case 11: return "一维前缀和";
case 12: return "二维前缀和";
case 13: return "一维差分";
case 14: return "二维差分";
case 15: return "枚举";
case 16: return "模拟";
case 17: return "高精度加法";
case 18: return "高精度减法";
case 19: return "高精度乘法";
case 20: return "递归";
case 21: return "DFS";
case 22: return "回溯";
case 23: return "搜索剪枝";
case 24: return "BFS";
case 25: return "queue";
case 26: return "无权图最短路";
case 27: return "stack";
case 28: return "deque";
case 29: return "vector";
case 30: return "pair";
case 31: return "set";
case 32: return "map";
case 33: return "sort";
case 34: return "cmp比较函数";
case 35: return "结构体排序";
case 36: return "unique";
case 37: return "reverse";
case 38: return "贪心";
case 39: return "质数判定";
case 40: return "埃氏筛";
case 41: return "线性筛";
case 42: return "质因数分解";
case 43: return "gcd";
case 44: return "lcm";
case 45: return "模运算";
case 46: return "负数取模";
case 47: return "快速幂";
case 48: return "进制转换";
case 49: return "并查集find";
case 50: return "并查集unite";
case 51: return "路径压缩";
case 52: return "连通块统计";
case 53: return "邻接矩阵";
case 54: return "邻接表";
case 55: return "图DFS遍历";
case 56: return "图BFS遍历";
case 57: return "Kruskal最小生成树";
case 58: return "堆优化Dijkstra";
case 59: return "Floyd";
case 60: return "SPFA";
case 61: return "拓扑排序";
case 62: return "01背包";
case 63: return "完全背包";
case 64: return "多重背包";
case 65: return "滚动数组";
case 66: return "LIS";
case 67: return "LCS";
case 68: return "数字三角形";
case 69: return "整数二分";
case 70: return "二分答案";
case 71: return "离散化";
case 72: return "双指针";
case 73: return "Trie插入";
case 74: return "Trie查询";
case 75: return "字符串哈希";
case 76: return "priority_queue";
case 77: return "二叉树遍历";
case 78: return "奇偶分析";
case 79: return "Ad-Hoc构造";
case 80: return "时间复杂度估算";
}
}
int main()
{
srand((unsigned)time(NULL));
int x=rand()%80+1;
cout<<csp(x);
}
全部评论 6
如果 J 组考连通块我做梦都能笑醒
2026-07-25 来自 上海
0q
2026-07-25 来自 河北
0构造?
2026-07-25 来自 浙江
0构造?小木棍?
2026-07-25 来自 浙江
0其实是“构造?小?”
2026-07-25 来自 浙江
0棍木构造?
2026-07-25 来自 浙江
0
case 73: return "Trie插入"; case 74: return "Trie查询";Trie是J组算法吗?
2026-07-24 来自 上海
0好像23考过?
2026-07-24 来自 浙江
0
int x=rand()%15+1;为啥是15,不应该是80吗
2026-07-24 来自 浙江
0谢谢纠正,之间只有15个知识点,后面补了就没改:(
2026-07-24 来自 浙江
0前
2026-07-24 来自 浙江
0
这么快备考 Ad-hoc 构造,吓哭了
2026-07-24 来自 广东
0SPFA有必要学吗?st好像说这个没用
2026-07-24 来自 浙江
0没必要,你用不到
2026-07-25 来自 湖南
0给你卡的死死的
2026-07-25 来自 浙江
0


































有帮助,赞一个