Development of project management interface, etc. can be made simple and aesthet...

ART2000 DA AD板的dos系统测试程序，用于学习和开发ART2-ART2000 DA AD board dos system testing procedures, for learning and development ART2000

他可以随意添加按钮，还可以进行预览，还可以设置一些按钮的属性-He can add a button can also be used for preview, you can set up some button attributes

独立开发的足彩缩水算法，具有国内同类软件中最高的压缩率，delphi7开发-independent development of the five lotto shrink algorithm, similar software with domestic highest compression rate, delphi7 Development

图像压缩问题要求确定象素序列{p1,p2,…,pn}的最优分段，使得依此分段所需的存储空间最少。每个分段的长度不超过256位。数字化图像是m×m的像素阵列。假定每个像素有一个0 ~ 2 5 5的灰度值。因此存储一个像素至多需8位。若每个像素存储都用最大位8位，则总的存储空间为8m^2 位。为了减少存储空间，我们将采用变长模式（ variable bit scheme），即不同像素用不同位数来存储。像素值为0和1时只需1位存储空间； 值2、3各需2位；值4，5，6和7各需3位；以此类推。-image compression defined pixel sequence (p1, p2, ..., pn) sub-optimal, sub accordingly makes the storage space required at least. The length of each section is not more than 256. The digital image is m m pixel arrays. Assume that each pixel is a 0-2 5 5 of the gray values. Therefore storage of up to a pixel 8. If each pixel with the largest storage capacity of 8-bit, the total storage space for 8m ^ 2. In order to reduce storage space, and we will use variable-length model (variable bit scheme), that is different with different pixel median storage. Pixel values of 0 and 1 and only a storage space; The value of 2,3 required two; Value 4,5,6 and 7 of the required three; Analogy.

poj典型题目解题思路详解 包含源代码和解题时应注意的问题及题目陷阱设计分析-POJ typical Oklahoma Elaborates on topics include source code and they should pay attention to solving the problems and pitfalls topic Design Analysis

本人设计该软件用于记录串口的二进制数据, 能显示BIN数据,也可以存盘. -I designed the software used to record the serial binary data showing the BIN data, you can save.

采用邻接矩阵表示无向图，完成图的创建、图的深度优先遍历、图的广度优先遍历操作。其中图的顶点信息是字符型，图中顶点序号按字符顺序排列。本输入样例中所用的图如下所示： Input Format: 第一行输入两个值，第一个是图中顶点的个数，第二个是图中边的条数 第二行输入各顶点的信息，即输入每个顶点字符 第三行开始输入每条边，每条边的形式为两个顶点的序号，中间以空格隔开，输入完一条边换行 Output format: 首先输出图的顶点信息，输出完毕换行 接着输出图的邻接矩阵，假如图中有n个顶点，则输出形式为n行n列的邻接矩阵，输出完毕换行 接下来一行输出从图的第一个顶点开始进行深度优先遍历的序列，中间以空格隔开，输出完毕换行 最后一行输出从图的第一个顶点开始进行广度优先遍历的序列，中间以空格隔开，输出完毕换行 -Using an undirected graph adjacency matrix representation to complete the map creation, graph depth-first traversal, graph breadth-first traversal operation. In which vertex information is character, the graph vertex number by characters in order. The input sample used in the diagram are as follows: Input Format: The first line of input two values, the first one is the number of graph vertices, the second one is the number of graph edges Second row, enter information in each vertex, that enter each vertex character Start typing in the third line of each side, each side in the form of two vertices

在ＥＶＣ４.０开发环境下，基于ART2153数据采集卡的简单实现数据实时的采集功能-The EVC4.0 development environment, based on a simple data acquisition card ART2153 to achieve real-time data collection capabilities

PHP + 指纹识别的 Delphi 源代码，这是值得参考 ！

//: Snake.c /* * * * * * * * * * * * * * * * * * * * * * * // Project: RedSnake(贪吃蛇) // Author: Problue // Version: 1.0 // Date: 19:55 2012-10-29 * * * * * * * * * * * * * * * * * * * * * * */ #include #include #include #include "pcc32.h" // 定义地图的尺寸及坐标 #define MAP_WIDTH 32 // 地图宽度 #define MAP_HEIGHT 32 // 地图高度 #define OFFSET_X 1 // 地图左右的边距 #define OFFSET_Y 1 // 地图上下的边距 #define TOTAL_WIDTH (MAP_WIDTH + OFFSET_X * 2) // 窗口宽度 #define TOTAL_HEIGHT (MAP_HEIGHT + OFFSET_Y * 2) // 窗口高度 #define GotoMap(x, y) gotoTextPos((x) * 2, (y)) // 定义地图方格的状态，分别为: 空格、蛇头、蛇身、蛇尾、食物 #define BS_SPACE 0 #define BS_SHEAD 1 #define BS_SBODY 2 #define BS_STAIL 3 #define BS_FOOD 4 // 蛇默认长度 #define SNAKE_MIN_LEN 5 // 定义蛇运动方向: 上、下、左、右 #define DIR_UP 1 #define DIR_DOWN 2 #define DIR_LEFT 3