一个求进制的c++算法,希望能给大家带来帮助!如果大家有更好的,别忘记发给我啊! emil:wyx32893039@163.com...

这是最好的考试系统，内容是太短。注意请： 代码没有很好的描述将被删除，你不会得到任何点。请描述更好地获得更多积分。

基于数据库设计一个网页,实现基本功能：增删改、查询、统计报表的功能要有.管理信息-A. General Queries- The system should be able to retrieve useful data stored in the database. B. Statistics Collection- The system should be able to generate useful statistics information. C. Modification of Data- The system should provide interface for the store managers to add, remove and update the data in the database. D. Dealing with special events in the system. Your system should be able to handle real life situations that may arise from running the business. E. You are required to implement a web user interface for your system. F. The user interface should be intuitive and effective to use. G. Please bear in mind that a casual user should not have problems to check some simple information. H. The system should provide an English UI. You can also design multi-lingual UI.

我的数据结构的实验题，停车场，用栈和队列 模拟停车场，实现进车和出车-my data structure experiment, a car park, with Stack and Queue simulated car parks, to achieve progress and out of cars

用C++语言实现的八数码问题，A*算法。-With C++ Language realize eight digital problem, A* algorithm.

数据结构中常用的Gauss-Seidel 迭代算法-commonly used data structures, the Gauss- Seidel iterative algorithm

创建一个ODBC系统数据源-create an ODBC data source

用prim算法实验最小生成树 本程序中用到函数adjg( )，此函数作用是通过接受输入的点数和边数，建立无向图。函数prg( )用于计算并输出无向图的邻接矩阵。函数prim( )则用PRIM算法来寻找无向图的最小生成树 定义了两个数组lowcost[max],closest[max]，若顶点k加入U中，则令lowcost[k]=0。 定义二维数组g[ ][ ]来建立无向图的邻接矩阵。 -Prim algorithm using minimum spanning tree of the experimental procedures used in function adjg (), this function is through the acceptance of input points and edges, the establishment of a directed graph. Function of prg () used to calculate and output undirected graph of adjacency matrix. Function prim () is used PRIM Algorithm to find the undirected graph of the minimum spanning tree array defines two lowcost [max], closest [max], if it joined the U of k vertices, then the lowcost [k] = 0. The definition of two-dimensional array g [] [] to create a undirected graph of adjacency matrix.

数据结构里面实现图：拓扑排序、最小生成树、关键路径、深搜、广搜、优先路径

编程求两个一元多项式的乘积。 输入 　　输入数据为两行，分别表示两个一元多项式。每个一元多项式以指数递增的顺序输入多项式各项的系数（整数）、指数（整数）。 　　例如：1+2x+x2表示为：,,, 输出 　　以指数递增的顺序输出乘积： ,,, 　　零多项式的输出格式为：,-Programming seeking the product of two one-polynomial. Enter the input data for the two lines represent two unary polynomial. One dollar for each polynomial order of the exponential increase of the input polynomial coefficients (integer), index (integer). For example: 1+2 x+ x2 expressed as: " 1,0" , " 2,1" , " 1,2" , the output of the order of the exponential increase output of the product: " coefficient, index" , " coefficient, index" , " coefficient, the index " , zero polynomial output format is:" 0,0 " ,

能够运行的c调用sqlite的程序1，适合学习sqlite-Be able to run sqlite in c call one of the procedures for learning sqlite