vfp的界面，系统登陆时的表单。（压缩文件）

回溯法的模板，关键是回溯的过程，以及在深搜过程中的方向问题-Backtracking template, the key is back process, as well as in the course of the deep question of the direction search

字典序问题：在数据加密和数据压缩中常需要对特殊的字符串进行数字编号。给定的字母表 A 由 26 个小写英文字母组成 A={a,b,…,z}。该字母表产生的升序字符串是指字符串中字母按照从左 到右出现的次序与字母在字母表中出现的次序相同，且每个字符最多出现1 次。例如， a,b,ab,bc,xyz等字符串都是升序字符串。现在对字母表A 产生的升序字符串按照字典序排列 并编号如下。-Lexicographic problem

huffman树的基本实现. 利用读取TXT文件统计产生huffman树,从而对TXT文件进行压缩和解压.-huffman tree realize. the use of statistics to read TXT file generated huffman tree, thus TXT file compression and decompression.

本人大学时编写的算法包括 堆栈数据结构 链表数据结构 及二叉树等。。。。。。很多很全-I am prepared by the university, including stack algorithm data structure Chain and binary tree data structure so. . . . . . The whole lot

数据结构大型作业实验报告-哈夫漫-data structure large operations Experimental Report-Halff Man

*Cube:最大子长方体问题 问题描述: 一个长，宽，高分别为m,n,p的长方体被分割成个m*n*p个小立方体。每个小立方体内有一个整数。 求所给长方体的最大子长方体。子长方体的大小由它所含所有整数之和确定。 */-* Cube : The biggest problem for rectangular Problem description : a long, wide and high respectively m, n, p rectangular cut into the 000 m* n* p small cube. Within each small cube is an integer. Seeking to have the largest rectangular son cuboid. The son of rectangular size it contained all integral and defined.* /

给予B/S模式在线选课系统1. 用ASP/JSP+SQL Sever实现 2. 写出详细的需求分析 3. SQL代码、网页代码+截图-Given the B/S model online courses system in the ASP/JSP+ SQL Sever 2 write detailed requirements analysis 3 the SQL code, web page code+ screenshots

八 方块移动游戏要求从一个含8个数字（用1-8表示）的方块以及一个空格方块（用0表示）的3x3矩阵的起始状态开始，不断移动该空格方块以使其和相邻的方 块互换，直至达到所定义的目标状态。空格方块在中间位置时有上、下、左、右4个方向可移动，在四个角落上有2个方向可移动，在其他位置上有3个方向可移 动。例如，假设一个3x3矩阵的初始状态为： 8 0 3 2 1 4 7 6 5 目标状态为： 1 2 3 8 0 4 7 6 5-Eight-box requirements of mobile games from one containing eight numbers (1-8 with express) the box, as well as a space box (with 0) of the 3x3 matrix of the initial start, and constantly move the box to make space its adjacent box and swap until they reach their defined target state. Spaces in the middle position box has the upper and lower, left and right direction of four removable, in the four corners there are two directions can be mobile, in other locations has three movable direction. For example, suppose a 3x3 matrix of the initial state as follows: 803,214,765 target state as follows: 123,804,765

该程序完成对二叉树的非递归的前序遍历，在三种遍历方法中，这种遍历最简单，所以，核心代码自然要少很多。-completion of the process of non- recursive binary tree of the former preorder, the three traverse method, which traverse the most simple, so natural to the core code is much less.

void hugemenu()//最大的菜单 {     char menu;  //服务项目菜单  采用字符型比较可靠！因为如果定义成整型，万一输入了字符，可能会造成死循环错误     while(1) //系统将一直运行 直到运行 turnoff()函数     {         printf(" ********************欢迎您使用本系统******************** ");         printf(" 【请选择服务项目】: ");         printf(" 1.客户取票 2.VIP服务 3.客服系统 4.关闭系统 ");         printf(" 【您的选择】：");         scanf("%s",&menu); //用%s 比%c好 %c会记录字符 而且比如