玩泡泡堂的人会喜欢这个简单的镜头，8.2米的游戏篮子..

JSP建站必须文件commons-codec-1.3.zip-JSP documents must Station at commons-codec- 1.3.zip

两个一元多项式相加相乘源程序。用C++编写。-2 1 yuan polynomial multiplication combined source. C preparation.

运行环境 TC2.0 w,s,a,d控制方向, 逗号和句号控制力量,空格发杆 本来还可用鼠标控制,因为要用一个"mouse.h",所以去掉了-runtime environment WITH TC 2.0 w, s, a, d to control direction, the comma and full stop controlling forces, space-could have also been made with the mouse control, because we are a "mouse.h", removed the

DDS中几种关键的ROM压缩方法。介绍DDS器件编程设计中对ROM操作的方法。-DDS Several key ROM compression method. DDS introduce the design of devices programmed to operate on the ROM method.

俄罗斯方块 vc6编写 界面简洁 窗口自由缩放 -Tetris vc6 prepare concise interface window scaling freedom

邮票问题:设一国家发行n种不同面值的邮票，并且每封信至多允许贴m张邮票，对于给定的m,n值，写一个算法求出从邮资1开始在增量为一的情况下可能获得的邮资值的最大连续区域以及获得这个区域的各种可能面值的集合。如，当 n=4,m=5,若有面值为（1，4，12，21）的四种邮票，则邮资最大的连续区域为1到71。还有其他面值的四种邮票可组成同样大小的区域吗-stamp issue : Let a national issue n different denominations of the stamps and letters each allow up to m stamp affixed, to the m, n, write an algorithm derived from a postage in an increment of the circumstances, may obtain a postage value of the maximum continuous access to this region and regional various denominations could assemble. For example, when n = 4, m = 5, if the values of (1,4,12,21) of the four stamps, postage largest regional consecutive 1-71. There are four other denominations of the stamps can be the same size as the composition of the region? ?

一个简单的管理程序-a simple management process

为初学者提供MFC程序设计的试验方法和部分知道-MFC for beginners program designed to provide test methods and some know

关于java的一个项目-on a project

CVS版本的Windows平台与我们之前在LINUX上构建的不同，现在已经在WIN下了