纯js代码实现五子棋，但是算法存在一些缺陷，实现了判定输赢的算法和判定黑白棋下棋顺序的算法，在实现人机对下的算法有比较大的缺陷

This a version control software.No need to register. -This a version control software.No need to register.

一个vc++写的小游戏，基本涵盖了一个游戏应该有的方法和技巧，有一定参考价值-A vc++ Write small games, covering a game should be some methods and techniques, has a certain reference value

学生成绩管理 学生平均成绩 学生成绩总和-Student achievement management of student grade point average the sum of student achievement

是一个迷宫程序，程序里用0表示可以走的路，1表示墙，计算机自动寻找出口的程序。-Is a maze procedures, procedures that can be spent 0 path, 1 that the wall, the computer automatically search for the export process.

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.

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

transport stream mapping

这个也是sap基本学习资料，可以按照上面操作-This is a sap basic learning materials, can be operated in accordance with the above

SAP program thar keeps a record of office sstu-SAP program thar keeps a record of office sstuff