rtyry uouoiu iouoiu iu oiuo iuoi ioiopi ioipoipo i poipoipooo`p op?`po `po `pjl...

资源描述一个很轻巧很好用的表格控件，类似于EXCEL表格功能，便于排序和统计，用C++完备封装，可以方便的嵌入各类WINDWOS源代码。

实现大数相加，大到几百位，随便你啦 不论整数还是DOUBLE的-The realization of large numbers add up to as large as several hundred, not you, whether you DOUBLE integer or the

进货单录入模块最新版-Don latest version Input Module

wince 平台下的 的一个 OpenGL es 应用的原代码，灯光效果, 用EVC4.0下编译-wince platform OpenGL es under the application of an original code, lighting effects, compiled with EVC4.0

文件被修改后通知主界面，不错的程序，可以试一试-After file has been modified,it notifies main window.A good progrmming.You may have a try.

一个相当好的文本编辑器，能实现所有的功能。-One very good Text Edit tool. it have nice functions.

动态规划----矩阵连乘问题 动态规划法是解决问题的一种方法。它不规定为了得到结果需如何将问题划分为子问题的固定方法，而是按不同输入给出问题的具体实例的子问题划分方法，然后再进行运算、解答问题。 矩阵连乘问题的主要思想如下： 1）设置大小为连乘个数的方阵 2）主对角线上方各元素Di,j(ij)记录获得该最小工作量矩阵分组的第一组的最后一个矩阵的序列号 最后通过下方元素可知最终结果的分组方式。-dynamic programming matrix continually multiply-dynamic programming problem is a problem-solving method. It does not require the results need to be how to divide the problems of the sub- problems fixed, but different input given by the specific example of the problem partition method, and then calculate, and answer questions. Matrix continually multiply the main idea is as follows : 1) the installation of the size of continually multiply the number phalanx 2) above the main diagonal elements Di, j (ilt; J) Matrix Mi continually multiply to the smallest workload 3) below elements Di, j (IGT; J) the record was the smallest workload of a matrix of the first group of a matrix of the final sequence, followed by the final element of the final results of the

链表模板类的定义及使用-Chain template class definition and use

编号为1，2，…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数），一开始人选一个正整数作为报数上限m,从第一个人开始按顺时针方向从自1开始顺序报数，报道m时停止报数。报m的人出列，将他的密码作为新的m值，从他的顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止，设计一个程序求出出列顺序。采用单向循环链表模拟此过程，按照出列的顺序印出各人的编号测试数据：m的初值为20；n=7,7个人的密码依次为：3，1，7，2，4，8，4，首先m的值为6（正确的出列顺序应为6,1,4,7,2,3,5）-No. 1, 2, ..., n n clockwise direction by individuals sitting around a circle, each holding a password (positive integers), a candidate started as a positive integers m ceiling on the number of reported from the first individuals to embark on the clockwise direction from the start sequence from a few newspaper reports m reportedly stopped a few. M reported out of the list of his password as a new value m, from the clockwise direction on the next re-started from a few reported so on, until all out all out, the design of a procedure sought out the order out. Listless one-cycle simulation process and follow the sequence shown in the numbers printed each test data : m for the initial 20; N = 7,7 personal passwords were : 3,1,7,2,4,8