资源列表
arrangement
- 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的贪心算法进行安排。（这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小会场数。） 对于给定的k 个待安排的活动，编程计算使用最少会场的时间表。 -Suppose you want to arrange a number of activities in the hall more than enough, and want
prog2_1
- 对N个样本点进行主成分分析，并将结果可视化-N sample points on principal component analysis and visualization of results
kuohaopipei
- 利用堆栈实现的括号匹配算法，如果输入有错，给出提示。-Parenthesis matching algorithm using a stack to achieve, if the input is wrong, give tips.
LPF(FIR-Hamming)
- 采用Hamming窗实现的低通滤波器，可设置通带频率、截止频率以及带宽等滤波器特性参数。-The low-pass filter is realized by using Hamming window, can set the passband filter characteristic parameters such as frequency, the cut-off frequency and bandwidth.
alg.cpp.tar
- 实现了一些经典的计算机算法，包括全排列，全组合，走迷宫，背包问题等-Implements some classic computer algorithms, including full arrangement, all combinations, Maze, backpacks issues
mathCode.tar
- 实现了一些常用的数学算法，包括一些经典的问题，比如素数环，约瑟夫问题等-Achieve some common mathematical algorithms, including some classic problems, such as prime ring, Joseph problems
Tree
- C++二叉树,前序遍历中序遍历后序遍历递归,非递归版都有-C++ binary tree, traversing the recursive traversal after the preorder traversal, non recursive
10.22
- C++实现链式数据结构,动态数组 栈 队列,用的迭代器,模版-C++ implementation of linked data structures, dynamic array stack queue, use iterators, template
VNOI code #1
- VNOI code primepath.pas dagiac.pas tour.pas qbbishop.pas
VNOI code #2
- VNOI code minion.pas nguoi_giao_hang.pas robot_leo_cot.pas Max_square.pas Max_square_rectangular.pas
VNOI code #3
- VNOI code cards.pas money.pas nhay.pas
VNOI code #4
- VNOI code Facebook.pas WINNER.PAS TSHIRT.PAS