物协的起步趣味实验

早期我用csharp开发的一套流动人口管理系统（帮朋友开发的），入门学习很好(I use csharp early development of a floating population management system (developed to help a friend), started to learn good)

这是一本系统介绍设计模式的好书,非常适合有一定编程基础的人士阅读。(This is a good book to introduce design pattern systematically!)

火柴人的跳跃和滚动 按s滚动躲避障碍 按w跳跃躲避障碍(Stickman jumping and rolling)

C51单片机 中断控制方向启亮，定时器延时1秒彩灯C程序(C51 microcontroller interrupt control Fang Xiangqi bright lights timer delay 1 second C program)

LC_trie 算法程序源代码(LC_trie algorithm source code)

matcom插件调用matlab里面princomp函数对数据进行处理的小程序(plug-ins inside matcom call matlab function princomp data processing applet)

说明：  最完整的暴风影音源代码MPC，本站很多的此代码都不完整。(The most complete source code StormCodec MPC, this site a lot of this code is not complete.)

允许用户转储所有标准的ADTS头4极化8-8-4格式的文件到用户指定的输出文件(Allows the user to dump all headers for a standard ADTS 4-polarization 8-8-4 formatted file to a user-specified output file)

C-vrptw-sol C-vrptw-sol

01背包问题 问题陈述：给定n种物品和一背包，物品i的重量是wi，其价值为vi，背包的容量为C。合理选择物品装入背包，使得装入背包中物品的总价值最大。在选择装入背包的物品时，对每种物品i只有两种选择，即装入背包或不装入背包。不能将物品i装入背包多次，也不能只装入部分的物品i。 问题分析：0 1背包问题是一个子集选取问题，适合于用子集树表示0 1背包问题的解空间。在搜索解空间树时，只要其左儿子结点是一个可行结点，搜索就进入左子树，在右子树中有可能包含最优解时才进入右子树搜索；否则将右子树剪去。 (01 knapsack problem problem statement: given n kinds of items, and a backpack, the weight of the items i wi, the value of vi, backpack capacity C. Reasonable choice items into a backpack, making the total value of the items loaded backpack. Each item i select items loaded backpack, there are only two choices that loaded backpack or loaded backpack. Items i can not be loaded into a backpack many times not only loaded items i. The problem analysis: 01 knapsack problem is a selected subset of the problem and suitable for the tree represents a subset of the solution space of 01 knapsack problem. Search solution space tree, as long as its left son node is a feasible node, the search into the left subtree, right subtree may contain only into the right subtree search the optimal solution Otherwise, the right subtree cut.)