通过认证，未通过认证，删除，生成文件等简单功能 后台管理：look.asp 默认密码：admin...

用于 数据转换f-for data conversion f

Multisim9xunfang.rar, 压缩包解压时不能有密码。-Multisim9xunfang.rar, compressed packets can not extract the password.

实现对INI文件的读写-realization of the right to read and write INI file

Realization of alogrithm of chaos detection by determining Lyapunov exponents.

图片特效显示程序，在vb下显示图片各种特技的方法。-Photo Effects display program, in vb display pictures under a variety of special effects approach.

这是数字图像处理的教程，比较专用与系统，pdf格式-This is the Digital Image Processing Guide, compared with dedicated systems, pdf format

www.acm.pku.edu.cn上的1005题-www.acm.pku.edu.cn of 1005 that

gcc的object c的源代码,具有非常高的参考价值-c gcc object of the source code with a very high reference value

vc++开发的俄罗斯方块,vc的典游戏,vc6学有源码学习下载-vc++ development of Tetris, vc of the Code of the game, vc6 school have to learn to download source code

邮票问题:设一国家发行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? ?