资源列表
X_bit0mintest
- X位赋0mintest是实现芯片功耗测试不确定位填充算法-X-bit chip is to achieve the power conferred 0mintest test uncertain bit stuffing algorithm
00948259_ACM_1167
- 该程序能根据男子记录下的数据，计算出最少有多少条公交车线路经过该车站-The program can record the data according to man, to calculate the minimum number of bus lines through the station
00948259_ACM_1716
- 该程序能根据给定的若干个整数区间，找到最小整数集合中的元素个数，-The program according to a given number of integer intervals, find the smallest integer number of elements in the collection,
00948259_ACM_2083
- 该程序能按照输入的n值，生成满足题意的n度图形，每个n度图形是n-1度图形的某种重复-The process in accordance with the input values ??of n, n meaning of the questions generated to meet the degree of graphs, graphics for each degree n n-1 is a certain degree of duplication of graphics
00948259_ACM_1332
- 该程序能根据输入的情况和题目的约束条件来确定谁一定是说谎者-The program according to the input constraints of the situation and subject to determine who must be a liar
00948159_ACM2_1084
- 用火柴摆出n*n的正方形网格，然后去掉了几根火柴求至少还要再去掉多少根火柴，才能使得图中没有正方形-With a match put on n* n square grid, and then removed and at least a few matches and then seek to remove the number of matches in order to make the figure does not square
00948159_ACM2_3758
- 棋盘上有敌我双方的一些三种不同兵种的军队，以及一些草地和山（山不能跨过） 已知每种兵的移动范围、攻击力和克制关系，以及每支军队的士兵的数量 若一个军队对另一个军队发动进攻，则最多造成己方士兵数乘以攻击力的伤害（若有克制关系则再乘2） 现在要求依次（顺序不限）命令己方军队移动（也可不动）后攻击相邻敌军（也可不攻击），每支军队有且仅有一个命令 其中，移动时不能穿过敌方军队（即使敌方军队已全部被歼灭），且目标格不能有其他军队 求能消灭的敌军士兵数最大是多少-There are tw
CHAP04
- 数据库结构，线性表的类型定义，顺序的表示和实现-Database structure, linear table type definition, and implementation of the order of that
CHAP06
- 树的定义，遍历二叉树和顺序二叉树的定义和存储结构-The definition of the tree, binary tree and traversal sequence and store the definition of a binary tree structure
CHAP07
- 图的定义存储结构，图的遍历和图的连通性问题-The definition of storage structure diagram, graph traversal and graph connectivity problems
java_n_queen
- 使用java语言， 回溯法实现n后问题和0－1背包问题-java huisu suanfa slove N Queen question
xunhuaduilie
- 循环队列一站到位介绍及源码. 这是在嵌入式必须用的数据结构之一-One-stop place to introduce the circular queue and source