Ideal low

人机对下五子棋。。 博翌算法。。 算法有点简单-plane for the next 331. . Bo Yi algorithm. . A bit simple algorithm. .

用c语言编写的一个模拟文曲星上的猜数字猜单词游戏-use of a language simulation rings on the viewing guess word games

非常小巧好用的绿色版系统垃圾清除器-very handy compact version of the green garbage removal device

2G压成64K的剧作。 很强筋，一般的计算机就可以播放，全3D效果。彗星撞地球。-2G pressure into play 64K. Very strong gluten, the average computer can play, full 3D effect.彗星撞地球.

基于VB.NET开发的与RS232串口通信的编程实例，适用于开发者参考-on VB.NET development and RS232 serial communication programming examples, application developers to reference

可以根据已知条件进行计算，求出前方交会所需数据 -Can be calculated on the basis of known conditions, find the intersection in front of the required data

一个类定义的链队列和链表，并实现了若干操作函数-definition of a type of chain and Queue List, and to achieve a number of operational functions

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

This program uses virtual base classes

ARM7程序烧写工具，可以适用于多个公司的Flash芯片烧写，操作简单-ARM7 procedures burning tools can be applied in a variety of Flash chip burning, simple operation